Cod sursa(job #328949)
Utilizator | Data | 3 iulie 2009 23:45:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
var v:array[2..2000000] of 0..1;
n,i,j,nr:longint;
f,g:text;
begin
assign(f,'ciur.in');
assign(g,'ciur.out');
reset(f);rewrite(g);
read(f,n);
for i:=2 to n do
if v[i]=0 then
begin
nr:=nr+1;
for j:=i to n div i do
v[j*i]:=1;
end;
write(g,nr);
close(f);close(g);
end.