// PascalABC.NET 3.1, сборка 1200 от 13.03.2016 function IsPrime(n:integer):boolean; begin if n<4 then Result:=True else begin var found:= (n mod 2 = 0); var p:=3; while (not found) and (sqr(p)<=n) do begin found:=(n mod p = 0); p+=2 end; Result:=not found end end;
begin Writeln('k=',ArrRandom(ReadInteger('n='),1,999).Println. Where(x->IsPrime(x)).Count) end.
// PascalABC.NET 3.1, сборка 1200 от 13.03.2016 procedure IsPrime(n:integer; var res:boolean); begin if n<4 then res:=True else begin var found:= (n mod 2 = 0); var p:=3; while (not found) and (sqr(p)<=n) do begin found:=(n mod p = 0); p+=2 end; res:=not found end end;
begin var a:=ArrRandom(ReadInteger('n='),1,999); a.Println; var k:=0; var prime:boolean; foreach var e in a do begin IsPrime(e,prime); if Prime then Inc(k) end; Writeln('k=',k) end.
#include <math.h>
#include <cstdlib>
using namespace std;
int main()
{
int position = 0;
int i,j, ch,a,s;
int* mass = NULL;
cout << "Заданное число А: ";
cin >> a;
while (1)
{
cin >> ch;
if (ch == 0) break;
mass = (int*)realloc(mass, (position+1)*sizeof(int));
mass[position] = ch;
position++;
}
s=0;
j=0;
for (i=0;i<position;i++){
if (((mass[i] > 0) && (mass[i+1] > 0)) || ((mass[i] < 0) && (mass[i+1] < 0)))
j++;
if (((mass[i] > 0) && (mass[i] < a)))
s++;
}
cout << "Номер поседней пары: " << j << endl;
cout << "Положительно и не больше А: " << s << endl;
return 0;
}