Cod sursa(job #226678)
Utilizator | Data | 2 decembrie 2008 12:30:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
var con,cont,i,b,N:longint;
begin
assign(i,ciur.in); reset(i);
assign(o,ciur.our); rewrite(o);
read(N);
for i:=2 to N do begin
for b:=1 to i do begin
if i mod b=0 then cont:=cont+1;
end;
if cont=2 then con:=con+1;
end;
write(con);
end.