Pagini recente » Cod sursa (job #2550853) | Cod sursa (job #1294760) | Cod sursa (job #429542) | Cod sursa (job #938944) | Cod sursa (job #788136)
Cod sursa(job #788136)
#include<fstream>
#include<algorithm>
#include<vector>
using namespace std;
int n,v[1010],valmax;
bool posibil[50100];
vector <int> sol;
int main()
{
int i,j;
ifstream fin("economie.in");
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin.close();
sort(v+1,v+n+1);
valmax=v[n];
for(i=1;i<=n;i++)
{
if(posibil[v[i]]==true)
continue;
sol.push_back(v[i]);
posibil[v[i]]=true;
for(j=1;j+v[i]<=valmax;j++)
{
if(posibil[j]==true)
posibil[j+v[i]]=true;
}
}
ofstream fout("economie.out");
fout<<sol.size()<<"\n";
for(i=sol.size()-1;i>=0;i--)
fout<<sol[i]<<"\n";
fout.close();
return 0;
}