Cod sursa(job #1033000)
Utilizator | Data | 16 noiembrie 2013 12:14:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | cei_mici3 | Marime | 0.26 kb |
var i,n,k:integer;
f,g:text;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
readln(f,n);
i:=1;k:=2;
if n mod 2=0 then k:=k+1;
repeat
i:=i+2;
if n mod i=0 then k:=k+1;
until i>=n div 2;
writeln(g,k);
close(f);close(g);
end.