Cod sursa(job #775694)
| Utilizator | Data | 8 august 2012 18:03:49 | |
|---|---|---|---|
| Problema | Economie | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
using namespace std;
bool v[50000];
int x[1000],a[1000],i,j,n,k;
int main()
{
ifstream f("economie.in");
ofstream g("economie.out");
f>>n;
for (i=1;i<=n;i++) f>>a[i];
sort(a+1,a+n+1);
v[0]=true;
for (i=1;i<=n;i++) {
if (v[a[i]]==false)
{
for (j=0;j+a[i]<=a[n];j++)
{if (v[j]!=false) v[j+a[i]]=true; }
x[++k]=a[i];
}
}
g<<k<<'\n';
for (i=1;i<=k;i++) g<<x[i]<<'\n';
f.close();
g.close();
return 0;
}
