Pagini recente » Cod sursa (job #887717) | Cod sursa (job #2360763) | Cod sursa (job #224598) | Cod sursa (job #98491) | Cod sursa (job #935413)
Cod sursa(job #935413)
#include <fstream>
#include<algorithm>
using namespace std;
int n, i, a[1003], x[50003], f[1003], maxim, j, nr;
int main(){
ifstream fin("economie.in");
ofstream fout("economie.out");
fin>>n;
for(i=1; i<=n; i++){
fin>>a[i];
if(a[i]>maxim)
maxim=a[i];
}
sort(a+1, a+n+1);
x[0]=1;
for(i=1; i<=n; i++){
if(x[a[i]]==0){
f[++nr]=a[i];
for(j=0; j+a[i]<=maxim; j++)
if(x[j]==1)
x[j+a[i]]=1;
}
}
fout<<nr<<"\n";
for(i=1; i<=nr; i++)
fout<<f[i]<<"\n";
return 0;
}