Pagini recente » Cod sursa (job #3191493) | Cod sursa (job #48667) | Cod sursa (job #2827716) | Cod sursa (job #87784) | Cod sursa (job #2987181)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int dp[50005];
int n,v[1005];
int main()
{
fin>>n;
int sol;
for(int i=1;i<=n;i++){
fin>>v[i];
}
dp[0]=1;
sort(v+1,v+n+1);
for(int i=1;i<=n;i++)
if(!dp[v[i]])
{
bool ok=true;
for(int j=0;j<=v[n]-v[i];j++)
if(dp[j])
dp[j+v[i]]=1;
for(int k=1;k<=n;k++){
if(!dp[v[k]])
ok=false;
}
if(ok){
sol=i;
break;
}
}
fout<<sol<<"\n";
for(int i=1;i<=sol;i++)
fout<<v[i]<<"\n";
return 0;
}