Cod sursa(job #175798)
Utilizator | Data | 10 aprilie 2008 13:42:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
program erathostenes;
var i,j,n,x,nr:longint;
v:array[1..2000002] of 0..1;
f,g:text;
begin
assign(f,'ciur.in'); assign(g,'ciur.out');
reset(f); rewrite(g);
readln(f,n);
for i:=2 to n do
if v[i]=0 then
begin
nr:=nr+1;
for j:=2 to n div i do
v[i*j]:=1;
end;
write(g,nr);
close(f); close(g);
end.