Pagini recente » Cod sursa (job #686174) | Cod sursa (job #1369426) | Cod sursa (job #979397) | Cod sursa (job #2040676) | Cod sursa (job #1737443)
#include <cstdio>
#include <algorithm>
#define nmax 1005
using namespace std;
int n,v[nmax],s[nmax*50];
int p[nmax],k;
int main()
{
int i,j;
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
s[0]=1;
for (i=1;i<=n;i++)
if (s[v[i]]==0) {
p[++k]=v[i];
for (j=0;j+v[i]<=v[n];j++)
if (s[j]==1)
s[j+v[i]]=1;
}
printf("%d\n",k);
for (i=1;i<=k;i++)
printf("%d\n",p[i]);
return 0;
}