Pagini recente » Cod sursa (job #2351824) | Cod sursa (job #1288697) | Cod sursa (job #2673516) | Cod sursa (job #1103453) | Cod sursa (job #720829)
Cod sursa(job #720829)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int i,j,n,nr,v[1001],a[1001],b[50001];
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>a[i];
b[0]=1;
sort(a+1,a+n+1);
for(i=1;i<=n;++i)
if(b[a[i]]==0)
{for(j=0;j+a[i]<=a[n];++j)
if(b[j]!=0)
b[j+a[i]]=1;
for(j=1;j<=n;++j)
if(b[j]!=1)
break;
++nr;
v[nr]=a[i];
if(j>n)
break;
}
g<<nr<<'\n';
for(j=1;j<=nr;++j)
g<<v[j]<<'\n';
f.close();
g.close();
return 0;
}