Pagini recente » Cod sursa (job #1941569) | Cod sursa (job #1009069) | Cod sursa (job #2152956) | Cod sursa (job #694331) | Cod sursa (job #1187130)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int v[1005], sol[1005], soln;
int N;
void read()
{
int x;
fin >> N;
for(int i = 0; i < N; i++)
fin >> v[i];
}
void solve()
{
sort(v,v+N);
sol[0] = v[0];
soln += 1;
for(int i = 0; i < N; i++)
{
for(int j = 0; j < soln; j++)
{
if(v[i] % sol[j])
{
sol[soln] = v[i];
soln += 1;
}
}
}
}
void show()
{
fout << soln << "\n";
for(int i = 0; i < soln; i++)
fout << sol[i] << "\n";
}
int main()
{
read();
solve();
show();
return 0;
}