// 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.
var a,b,c:integer; begin readln(a,b,c); if (a>b) and (a>c) and (b>c) then writeln('c=',c,'b=',b,'a=',a) else if (b>a) and (b>c) and (a>c) then writeln('c=',c,'a=',a,'b=',b) else if (c>a) and (c>b) and (b>a) then writeln('a=',a,'b=',b,'c=',c) else if (a>b) and (a>c) and (c>b) then writeln('b=',b,'c=',c,'a=',a) else if (b>a) and (b>c) and (c>a) then writeln('a=',a,'c=',c,'b=',b) else if (c>a) and (c>b) and (a>b) then writeln('b=',b,'a=',a,'c=',c) else readln; end.
// 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.
Тестовое решение:
n= 10
401 828 780 444 694 965 23 341 673 875
k=3
2. А вот так это пишется с процедурой
// 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.
Тестовое решение:
n= 12
199 43 71 365 417 904 170 212 694 103 161 689
k=4
var a,b,c:integer;
begin
readln(a,b,c);
if (a>b) and (a>c) and (b>c) then writeln('c=',c,'b=',b,'a=',a) else
if (b>a) and (b>c) and (a>c) then writeln('c=',c,'a=',a,'b=',b) else
if (c>a) and (c>b) and (b>a) then writeln('a=',a,'b=',b,'c=',c) else
if (a>b) and (a>c) and (c>b) then writeln('b=',b,'c=',c,'a=',a) else
if (b>a) and (b>c) and (c>a) then writeln('a=',a,'c=',c,'b=',b) else
if (c>a) and (c>b) and (a>b) then writeln('b=',b,'a=',a,'c=',c) else
readln;
end.