Cod sursa(job #153099)
Utilizator | Data | 10 martie 2008 09:33:30 | |
---|---|---|---|
Problema | Economie | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 1.62 kb |
var n,i,j,nn,aux:word;
a:array[1..50000] of longint;
ok:boolean;
v:array[1..50000] of boolean;
f,g:text;
begin
assign(f,'economie.in');reset(f);
assign(g,'economie.out');rewrite(g);
read(f,n);
for i:=1 to n do read(f,a[i]);
repeat
ok:=True;
for i:=1 to n-1 do
if a[i]>a[i+1] then begin
ok:=false;
aux:=a[i];
a[i]:=a[i+1];
a[i+1]:=aux;
end;
until ok=true;
if a[1]=1 then begin
writeln(g,1);
writeln(g,1);
end
else if (a[1]=2) and (a[2]=3) then begin
writeln(g,2);
writeln(g,2,' ',3);
end
else begin
v[1]:=true;
nn:=n;
for i:=2 to n do begin
v[i]:=true;
for j:=1 to i-1 do
if a[i] mod a[j]=0 then begin
v[i]:=false;
nn:=nn-1;
break;
end;
end;
writeln(g,nn);
for i:=1 to n do
if v[i]=true then writeln(g,a[i]);
end;
close(f);
close(g);
end.