Pagini recente » Cod sursa (job #628938) | Cod sursa (job #2430540) | Cod sursa (job #2883256) | Cod sursa (job #1867261) | Cod sursa (job #1258255)
#include<cstdio>
#include<algorithm>
using namespace std;
int a[5002],vmax,i,n,nr,j,s[5002];
bool d[100000];
int main()
{
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
vmax=max(vmax,a[i]);
}
sort(a+1,a+n+1);
d[0]=true;
for(i=1;i<=n;i++)
{
if(!d[a[i]])
{
nr++;
s[nr]=a[i];
for(j=a[i];j<=vmax;j++)
{
if(d[j-a[i]])
{
d[j]=true;
}
}
}
}
printf("%d\n",nr);
for(i=1;i<=nr;i++)
{
printf("%d\n",s[i]);
}
}