Pagini recente » Cod sursa (job #2409154) | Cod sursa (job #1142401) | Cod sursa (job #2598602) | Cod sursa (job #875250) | Cod sursa (job #2566523)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int cnt,v[1005],maxim,n,rasp,aux[1005];
bool apar[50005];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
apar[v[i]]=1;
maxim=max(maxim,v[i]);
}
sort(v+1,v+n+1);
apar[0]=1;
for(int i=1;i<=n;i++)
{
if(apar[v[i]])
{
rasp++;
aux[rasp]=v[i];
apar[v[i]]=0;
for(int j=1;j<=maxim-v[cnt];j++)
{
if(apar[j]==1)
{
apar[j+v[i]]=0;
}
}
}
}
fout<<rasp<<endl;
for(int i=1;i<=rasp;i++)
fout<<aux[i]<<endl;
}