Pagini recente » Cod sursa (job #466339) | Cod sursa (job #470425) | Cod sursa (job #480669) | Cod sursa (job #3261220) | Cod sursa (job #2566560)
#include <iostream>
#include <algorithm>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int n,v[1005],dr[1005],nr=0,tr=0;
bool ghiozdan[50005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
bool OK=0;
while(OK==0)
{
OK=1; tr++;
if(ghiozdan[v[tr]]==0)
{
nr++;
dr[nr]=v[tr];
ghiozdan[v[tr]]=1;
for(int i=1;i<=50000;i++)
if(i-dr[nr]>0)
ghiozdan[i]=ghiozdan[i-dr[nr]];
OK=0;
}
else OK=0;
if(tr==n) OK=1;
}
g<<nr;
for(int i=1;i<=nr;i++)
g<<endl<<dr[i];
}