Cod sursa(job #1154155)
Utilizator | Data | 25 martie 2014 23:43:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
var a:array[1..2000100] of byte;
i,n,j,nr:longint;
f,g:text;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
readln(f,n);
nr:=0;
for i:=2 to n do
if a[i]=0 then begin
inc(nr);
for j:=2 to (n div 2) do
a[j*i]:=1;
end;
write(g,nr);
close(f);
close(g);
end.