Cod sursa(job #872567)
Utilizator | Data | 6 februarie 2013 11:48:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
Var f,g:text;
v:array [1..2000000] of boolean;
n,i,j,s:longint;
Begin
assign(f, 'ciur.in');reset(f);
assign(g, 'ciur.out');rewrite(g);
read(f, n);
for i:=2 to trunc(sqrt(n)) do
if v[i]=true then
for j:=i*i to n do
v[j]:=false;
for i:=1 to n do
if v[i]=true then inc(s);
write(g, s);
close(f);
close(g);
End.