Cod sursa(job #625259)
Utilizator | Data | 24 octombrie 2011 09:24:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
var f,g:text;
a:array[1..3000000]of 0..1;
n,i,y:0..2000005; nr:0..100000;
begin
assign(f,'ciur.in'); assign(g,'ciur.out'); reset(f); rewrite(g);
read(f,n); nr:=0;
for i:=2 to n do
if a[i]=0 then begin y:=i;
while y<=n do
begin
if y+i<2000000 then y:=y+i
else y:=n+1;
a[y]:=1;
end;
nr:=nr+1;
end;
write(g,nr);
close(f); close(g);
end.