Pagini recente » Cod sursa (job #2220186) | Cod sursa (job #2389796) | Cod sursa (job #1477233) | Cod sursa (job #1466656) | Cod sursa (job #2277199)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,i,v[1010],f[50100],sol[50100],k,maxim,j,nr,s,t;
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
maxim=max(maxim,v[i]);
}
sort(v+1,v+n+1);
if(v[1]==1){
fout<<"1\n1";
return 0;
}
for(i=1;i<=n;i++)
if(f[i]==0){
nr++;
sol[++k]=v[i];
for(j=1;j<=k;j++)
for(t=1;t<=maxim;t++)
if(t+sol[j]<=maxim&&f[t+sol[j]]==0)
f[t+sol[j]]=1;
}
fout<<nr<<"\n";
for(i=1;i<=k;i++)
fout<<sol[i]<<"\n";
return 0;
}