Pagini recente » Cod sursa (job #2672699) | Cod sursa (job #2479639) | Cod sursa (job #1834878) | Cod sursa (job #362059) | Cod sursa (job #2297861)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
bool a[50001];
int sol[1001],v[1001];
int i,j,k,n;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
a[0]=1;
for(i=1;i<=n;i++)
if(a[v[i]]==0)
{
for(j=0;j<=v[n]-v[j];j++)
if(a[j]==1)
a[j+v[i]]=1;
sol[++k]=v[i];
if(a[n]==1)
break;
}
fout<<k<<'\n';
for(i=1;i<=k;i++)
fout<<sol[i]<<'\n';
return 0;
}