Var m,n,k,i:integer; a:array[1..1000] of integer; begin write('Write size array: '); readln(n); write('Write m: '); readln(m); k:=0; for i:=1 to n do begin read(a[i]); if a[i]>m then inc(k); end; writeln(k); readln; 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.
// 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.
m,n,k,i:integer;
a:array[1..1000] of integer;
begin
write('Write size array: '); readln(n);
write('Write m: '); readln(m);
k:=0;
for i:=1 to n do
begin
read(a[i]);
if a[i]>m
then inc(k);
end;
writeln(k);
readln;
readln
end.