Pagini recente » Cod sursa (job #2558001) | Cod sursa (job #3231388) | Cod sursa (job #3237794) | Cod sursa (job #1407496) | Cod sursa (job #3262381)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,i,j,val,sol,v[1005],MAX;
bool d[100005];
set<int> s;
bool verificare()
{
for (auto x: s)
if (d[x]==0)
return false;
return true;
}
int main()
{
fin>>n;
for (i=1; i<=n; i++)
{
fin>>val;
s.insert(val);
MAX=max(MAX,val);
}
for (auto y: s)
{
d[y]=1;
v[++sol]=y;
for (i=1; i<=MAX; i++)
if (d[i])
d[i+y]=1;
if (verificare())
break;
}
fout<<sol<<"\n";
for (i=1; i<=sol; i++)
fout<<v[i]<<"\n";
return 0;
}