Pagini recente » Cod sursa (job #127921) | Cod sursa (job #2751853) | Cod sursa (job #658001) | Cod sursa (job #880869) | Cod sursa (job #426866)
Cod sursa(job #426866)
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int sol[1005],V[1005];
bitset<50001> Din;
int N,cnt,vf,h;
int main()
{
int i,j;
f >> N;
for (i=1;i<=N;i++)
f >> V[i];
sort(V+1,V+N+1);
Din[0] = 1; //e clar
for (i=1;i<=N;i++)
if (Din[V[i]]==0)
{
sol[++cnt]=V[i];
for (j=0;j<=V[N];j++)
if (Din[j] && j+V[i]<=V[N])
Din[j+V[i]]=1;
}
g << cnt << "\n";
for (i=1;i<=cnt;i++) g<< sol[i] << "\n";
}