Cod sursa(job #604926)
| Utilizator | Data | 26 iulie 2011 01:50:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
program ciur;
var
n,i,count,j:longint;
v:array[1..2000000] of longint;
f,g:text;
begin
assign(f,'ciur.in');
assign(g,'ciur.out');
reset(f);
read(f,n);
close(f);
for i:=2 to n do
v[i]:=i;
for i:=2 to n do
begin
if v[i]<>0 then
begin
inc(count);
for j:=i+1 to n do
if j mod v[i]=0 then
v[j]:=0;
end;
end;
rewrite(g);
write(g,count);
close(g);
end.