Cod sursa(job #172282)
Utilizator | Data | 6 aprilie 2008 01:02:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
program ciur;
var f,g:text;
prim:array[1..2000000] of byte;
i,j,k,n:longint;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
readln(f,n);
k:=0;
for i:=2 to n do
if prim[i]=0 then
begin
k:=k+1;
j:=i+i;
while j<=n do
begin
prim[j]:=1;
j:=j+i;
end;
end;
write(g,k);
close(g);
end.