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