Cod sursa(job #410987)
Utilizator | Data | 4 martie 2010 17:48:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
var a:array[1..10000000] of 0..1;
f,g:text;
i,j,b,n:longint;
begin
assign(f,'ciur.in'); reset(f);
assign(g,'ciur.out'); rewrite(g);
read(f,n);
for i:=2 to n do begin
for j:=2 to n do begin
b:=j*i;
a[b]:=1;
end; end;
for b:=1 to n do
if a[b]=0 then write(g,b,' ');
close(g);
close(f);
end.