Pagini recente » Cod sursa (job #1892727) | Cod sursa (job #48513) | Cod sursa (job #1146410) | Cod sursa (job #37420) | Cod sursa (job #1960495)
#include<bits/stdc++.h>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int n,v[1002];
bitset<100002>F;
int a[1002],l;
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n;++i)
if(F[v[i]]==0)
{
for(int j=1;j<=50000;++j)
if(F[j]==1)
F[j+v[i]]=1;
else
if(j%v[i]==0)
F[j]=1;
++l;
a[l]=v[i];
}
g<<l<<'\n';
for(int i=1;i<=l;++i)
g<<a[i]<<" ";
return 0;
}