Pagini recente » Cod sursa (job #3283523) | Cod sursa (job #3284167) | Cod sursa (job #2966454) | Cod sursa (job #1564471) | Cod sursa (job #1975509)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("economie.in");
ofstream g ("economie.out");
int v[1<<10],sol[1<<10],n;
bool a[1<<16];
int main()
{
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
sort(v+1,v+n+1);
a[0]=1;
for(int i=1;i<=n;++i)
{
if(!a[v[i]])
{
sol[++sol[0]]=v[i];
for(int j=0;j<=50000-v[i];++j) if(a[j]) a[j+v[i]]=1;
}
}
for(int i=0;i<=sol[0];++i) g<<sol[i]<<'\n';
return 0;
}