uses crt; type int = longint; var n:int; function prime(n:int):boolean; var i:int; begin if (n < 2) then exit(false); if (n < 4) then exit(true); if (n mod 2 = 0) or (n mod 3 = 0) then exit(false); i:=5; while i*i <= n do begin if (n mod i = 0) or (n mod (i+2) = 0) then exit(false); inc(i,6); end; exit(true); end; begin clrscr; readln(n); inc(n); while prime(n) = false do inc(n); writeln(n); readln; end.
uses crt; var n,m:longint; function nt(a:longint):boolean; var i:longint; begin if a>1 then nt:=true else nt:=false; for i:=2 to trunc(sqrt(a)) do if a mod i=0 then nt:=false; end; begin readln(n); m:=n+1; while not(nt(m)) do m:=m+1; writeln(m); end.
