// 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 b,c:boolean; a:integer; begin readln(a); writeln(not odd(a)); if a mod 10 = 7 then b:=true; writeln(b); writeln(not odd(a mod 10)); end.
var r,a:integer; begin read(r,a); if a*a>pi*r*r then writeln('Square') else if a*a<pi*r*r then writeln('Circle') else writeln('Equal'); end.
var m1,m2,v1,v2:integer; begin read(m1,v1,m2,v2); if m1/v1>m2/v2 then writeln('p1>p2') else if m1/m2<m2/v2 then writeln('p1<p2') else writeln('p1=p2'); end.
var a,b:real; begin read(a,b); b*=0.45; if a>b then writeln(b) else if a<b then writeln(a) else writeln('Equal'); end.
