Const i=10; var k:array[1..i] of integer; n:integer; begin writeln('Введите элементы массива'); for n:=1 to i do begin read(k[n]); if k[n]<0 then k[n]:=sqr(k[n]); end; for n:=1 to i do write(k[n], ' '); 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.
// 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.
i=10;
var k:array[1..i] of integer;
n:integer;
begin
writeln('Введите элементы массива');
for n:=1 to i do begin
read(k[n]);
if k[n]<0 then k[n]:=sqr(k[n]);
end;
for n:=1 to i do write(k[n], ' ');
end.