Cod sursa(job #1198886)
Utilizator | Data | 17 iunie 2014 16:03:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
type tablou=array [1..2000005]of 0..1;
var t:tablou;
i,j,k,n:longint;
f,g:text;
begin
assign(f,'ciur.in');
assign(g,'ciur.out');
reset(f);
rewrite(g);
read(f,n);
for i:=2 to n do
if t[i]=0 then begin
inc(k);
for j:=2 to n div i do
t[i*j]:=1;
end;
write(g,k);
close(f);
close(g);
end.