Pagini recente » Cod sursa (job #1535312) | Cod sursa (job #69823) | Cod sursa (job #1313571) | Cod sursa (job #418762) | Cod sursa (job #753193)
Cod sursa(job #753193)
#include <fstream>
#include <algorithm>
using namespace std;
int v[1001],m[50001],x[1001];
int main()
{
ifstream f("economie.in");
ofstream g("economie.out");
int n,i,j,k=0;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
m[0]=1;
for(i=1;i<=n;i++)
{ if(m[v[i]]==0)
{ for(j=0;j+v[i]<=v[n];j++)
{ if(m[j]!=0) m[j+v[i]]=1;}
x[++k]=v[i];
}
}
g<<k<<"\n";
for(i=1;i<=k;i++) g<<x[i]<<"\n";
f.close();
g.close();
return 0;
}