Pagini recente » Cod sursa (job #888031) | Cod sursa (job #135686) | Cod sursa (job #1611907) | Cod sursa (job #2558034) | Cod sursa (job #1126478)
#include<fstream>
#include<algorithm>
#define NMAX 1005
#define LMAX 50005
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,v[NMAX],sol[NMAX],k;
bool use[LMAX];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n;i++)
{
if(use[v[i]])
continue;
use[v[i]]=1;
for(int j=1;j<=50000-v[i];j++)
if(use[j])
use[j+v[i]]=1;
sol[++k]=v[i];
}
fout<<k<<'\n';
for(int i=1;i<=k;i++)
fout<<sol[i]<<'\n';
return 0;
}