Cod sursa(job #165705)
Utilizator | Data | 26 martie 2008 17:06:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
var v:array[1..2000000] of byte;
n,i,j,k:longint;
f,g:text;
begin
assign(f,'ciur.in'); reset(f);
assign(g,'ciur.out'); rewrite(g);
readln(f,n);
v[1]:=1;
for i:=2 to trunc(sqrt(n)) do
for j:=2 to n div i do
v[i*j]:=1;
for i:=1 to n do if v[i]=0 then k:=k+1;
write(g,k);
close(f); close(g);
end.