Pagini recente » Cod sursa (job #1511074) | Cod sursa (job #1384025) | Autentificare | Istoria paginii runda/qwegqe | Cod sursa (job #287569)
Cod sursa(job #287569)
#include<algorithm>
using namespace std;
#define DIM 100001
#define MAX 50001
int n,a[DIM],f[DIM],sol[DIM];
void solve(){
int i,j,m;
scanf("%d",&n);
for(i=1; i<=n; ++i)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=f[0]=1,m=0; i<=n; ++i)
if(!f[a[i]]){
sol[++m]=a[i];
for(j=0; j<MAX; ++j)
if(f[j])
++f[j+a[i]];}
printf("%d\n",m);
for(i=1; i<=m; ++i)
printf("%d\n",sol[i]);}
int main(){
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
solve();
return 0;}