Pagini recente » Cod sursa (job #3126385) | Cod sursa (job #3250258) | Cod sursa (job #2852004) | Cod sursa (job #1493521) | Cod sursa (job #2770944)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("economie.in");
ofstream fout ("economie.out");
int n,i,s,k,v[1001],h[1001];
int main()
{
fin>>n;
for (i=1; i<=n; i++)
fin>>v[i];
sort (v+1,v+n+1);
s=v[1];
h[++k]=v[1];
for (i=2; i<=n; i++)
{
if (v[i]%s!=0)
{
h[++k]=v[i];
s=s+v[i];
}
}
fout<<k<<"\n";
for (i=1; i<=k; i++)
fout<<h[i]<<" ";
return 0;
}