Cod sursa(job #145430)
Utilizator | Harangus Daiana HDaiana | Data | 28 februarie 2008 20:13:33 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
const max=10000;
var v:array[1..max] of byte;
i,j,n,c:integer;
begin
assign(input,'ciur.in');reset(input);
assign(output,'ciur.out');rewrite(output);
readln(n);
for i:=2 to trunc(sqrt(n)) do
if v[i]=0 then
for j:=2 to max div i do
v[i*j]:=1;
for i:=2 to n do begin
if v[i]=0 then inc(c);end;write(c);writeln;
for i:=2 to n do
if v[i]=0 then write(i,' ');
close(input);close(output);
end.