Cod sursa(job #753193)
| Utilizator | Data | 29 mai 2012 20:14:37 | |
|---|---|---|---|
| Problema | Economie | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1001],m[50001],x[1001];
int main()
{
ifstream f("economie.in");
ofstream g("economie.out");
int n,i,j,k=0;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
m[0]=1;
for(i=1;i<=n;i++)
{ if(m[v[i]]==0)
{ for(j=0;j+v[i]<=v[n];j++)
{ if(m[j]!=0) m[j+v[i]]=1;}
x[++k]=v[i];
}
}
g<<k<<"\n";
for(i=1;i<=k;i++) g<<x[i]<<"\n";
f.close();
g.close();
return 0;
}