Pagini recente » Cod sursa (job #2455252) | Cod sursa (job #987034) | Cod sursa (job #2223988) | Cod sursa (job #190716) | Cod sursa (job #1126400)
#include<fstream>
#include<algorithm>
#include<vector>
#define NMAX 1005
#define LMAX 50005
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,v[NMAX];
bool use[LMAX];
vector<int> sol;
void ciur(int val)
{
for(int j=val;j<LMAX;j+=val)
use[j]=1;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n;i++)
{
if(use[v[i]])
continue;
ciur(v[i]);
for(int j=50000;j;j--)
if(use[j])
use[j+v[i]]=1;
sol.push_back(v[i]);
}
fout<<sol.size()<<'\n';
for(size_t i=0;i<sol.size();i++)
fout<<sol[i]<<'\n';
return 0;
}