Pagini recente » Cod sursa (job #2861294) | Cod sursa (job #254495) | Cod sursa (job #3242336) | Cod sursa (job #993827) | Cod sursa (job #2406951)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
const int NMAX = 1005;
const int VMAX = 50005;
int a[NMAX],f[VMAX];
int rasp[NMAX];
int main()
{
int n;
fin >> n;
int maxim=0;
for(int i=1;i<=n;i++)
{
fin >> a[i];
if(a[i]>maxim) maxim=a[i];
}
sort(a+1,a+n+1);
int k=0;
f[0]=1;
for(int i=1;i<=n;i++)
{
if(f[a[i]]==0)
{
rasp[++k]=a[i];
for(int j=0;j<=maxim-a[i];j++)
{
if(f[j]==1)
f[j+a[i]]=1;
}
}
}
fout << k << '\n';
for(int i=1;i<=k;i++)
fout << rasp[i] << ' ';
return 0;
}