Cod sursa(job #146945)
| Utilizator | Data | 2 martie 2008 14:02:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
var v:array [1..2000000] of integer;
n,i,j,k:longint;
begin
assign(input,'ciur.in'); reset(input);
assign(output,'ciur.out'); rewrite(output);
readln(n);
for i:=2 to n do
if v[i]=0 then begin
inc(k);
for j:=2 to n div i do v[i*j]:=1;
end;
writeln(k);
for i:=2 to n do
if v[i]=0 then write(i,' ');
close(input); close(output);
end.