Pagini recente » Cod sursa (job #2167161) | Cod sursa (job #2813387) | Cod sursa (job #1989855) | Cod sursa (job #2726792) | Cod sursa (job #2059756)
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream in("economie.in");
ofstream out("economie.out");
int a[50001],s[1001],v[1001],n;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
a[0]=1;
for(int i=1;i<=n;i++)
if(a[v[i]]==0)
{
s[++s[0]]=v[i];
for(int j=0;j<=50000;j++)
if(a[j]==1 && (j+v[i])<=50000)
{
a[j+v[i]]=1;
}
}
out<<s[0]<<'\n';
for(int i=1;i<=s[0];i++)
out<<s[i]<<'\n';
return 0;
}