Pagini recente » Cod sursa (job #65249) | Cod sursa (job #1211237) | Cod sursa (job #526082) | Cod sursa (job #2077928) | Cod sursa (job #810475)
Cod sursa(job #810475)
#include<cstdio>
#include<algorithm>
using namespace std;
int a[1001],r[50001],s[50001],i,j,k,n,l,c[1001];
int main()
{freopen("economie.in","r",stdin),freopen("economie.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",a+i);
sort(a+1,a+n+1);
for(i=1;i<=n;i++)
{for(j=a[1];j<=a[n];j++)
r[j]=s[j];
if(r[a[i]]<a[i])
s[a[i]]=a[i];
for(j=a[1];j<=a[n]-a[i];j++)
if(r[j+a[i]]<r[j]+a[i])
s[j+a[i]]=r[j]+a[i];}
for(i=1;i<=n;i++)
if(r[a[i]]==a[i])
c[++k]=a[i];
printf("%d\n",k);
for(i=1;i<=k;i++)
printf("%d\n",c[i]);
return 0;}