Cod sursa(job #445486)
Utilizator | Data | 23 aprilie 2010 22:11:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
program ciur;
var v:array[2..2000000]of boolean;i,j,k,n:longint;
f,g:text;
begin
assign(f,'ciur.in'); reset(f);
assign(g,'ciur.out');rewrite(g);
readln(f,n);
for i:=2 to n do
if not v[i] then
begin k:=k+1;
for j:=2 to n div i do
v[i*j]:=true;
end;
write(g,k);
close(f);close(g);
end.