Pagini recente » Cod sursa (job #1487653) | Cod sursa (job #9986) | Cod sursa (job #1973181) | Cod sursa (job #666760) | Cod sursa (job #1290243)
#include <iostream>
#include <cstdio>
using namespace std;
const int nmax = 50001;
int n, x, i, j, maxx, nr, a[nmax], b[nmax];
int main()
{
freopen("economie.in", "r", stdin);
freopen("economie.out", "w", stdout);
scanf("%d", &n);
for(i=1; i<=n; i++)
{
scanf("%d", &x);
if(maxx<x) maxx=x;
a[x]=1;
}
b[0]=1;
for(i=1; i<=maxx; i++)
if(a[i]==1)
for(j=0; j<=maxx-i; j++)
if(b[j]!=0 && b[j+i]!=1)
{
b[j+i]=1;
if (a[i]!=2) a[i]=2, nr++;
}
printf("%d\n", nr);
for(i=1; i<=maxx; i++)
if(a[i]==2)
printf("%d ", i);
fclose(stdin);
fclose(stdout);
return 0;
}