Mai intai trebuie sa te autentifici.
Cod sursa(job #136805)
| Utilizator | Data | 15 februarie 2008 23:51:32 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
var n,i,j,k:integer;
a:array[1..1000] of integer ;
f,g:text;
begin
assign(f,'economie.in');reset(f);
assign(g,'economie.out');rewrite(g);
readln(f,n);
for i:=1 to n do readln(f,a[i]);
i:=1;
j:=2;
while i<>n do
begin
while j<n do
begin
if a[j] mod a[i]=0 then begin
k:=j;
while k<>(n+1) do
begin
a[k]:=a[k+1];
inc(k);
end;
n:=n-1;
end
else inc(j);
end;
inc(i);
j:=2;
end;
for i:=1 to n do write(g,a[i]);
close(f);
close(g);
end.