Cod sursa(job #990046)
| Utilizator | Data | 27 august 2013 12:16:48 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int n, a[1005], sol[1005], dim;
int main()
{
f>>n;
for (int i=1; i<=n; ++i) f>>a[i];
sort(a+1, a+n+1); sol[++dim]=a[1];
for (int i=2; i<=n; ++i)
{
bool ok=1;
for (int j=1; j<i && ok; ++j)
if (a[i]%a[j]==0) ok=0;
if (ok) sol[++dim]=a[i];
}
g<<dim<<'\n';
for (int i=1; i<=dim; ++i) g<<sol[i]<<'\n';
return 0;
}
