Program n1; var a,b,s1,s2: integer; begin readln(a,b); s1:=(a mod 10)+(a div 10); s2:=(b mod 10)+(b div 10); if s1>s2 then write(a); if s1<s2 then write(b); 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.
var a,b,s1,s2: integer;
begin
readln(a,b);
s1:=(a mod 10)+(a div 10);
s2:=(b mod 10)+(b div 10);
if s1>s2 then write(a);
if s1<s2 then write(b);
end.