Cod sursa(job #945533)
| Utilizator | Data | 2 mai 2013 11:12:14 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream>
#define DIM 50100
#define NM 1000
#include<algorithm>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int v[NM],n,sol[NM],i,t,j,D[DIM],DI;
int main ()
{
f>>n;
for(i=1;i<=n;++i)
{
f>>v[i];
if(v[i]>DI)
DI=v[i];
}
sort(v+1,v+n+1);
D[0]=1;
for(i=1;i<=n;++i)
{
if(D[v[i]])
continue;
else
{
for(j=0;j<=DI-v[i];++j)
if(D[j])
D[j+v[i]]=1;
sol[++t]=v[i];
}
}
g<<t<<"\n";
for(i=1;i<=t;++i)
g<<v[i]<<" ";
return 0;
}