Pagini recente » Cod sursa (job #2473253) | Cod sursa (job #2831399) | Cod sursa (job #2020219) | Cod sursa (job #1858279) | Cod sursa (job #426114)
Cod sursa(job #426114)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int V[1002],n,auxi[50002],i,j,k,update2[1002],update[1002],Din[50002],Dinamik[50002],affirmative,x,minim,ciur[100000],suma;
int cmp(int i, int j)
{
return j>i;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>V[i];
sort(V,V+n+1,cmp);
update[1]=V[1];
for(x=1;x*V[1]<=50005;x++)
ciur[x*V[1]]=1;
minim++;
k=2;
ciur[0]=1;
for(i=2;i<=n;i++)
for(x=2;x*V[i]<=50005;x++)
ciur[x*V[i]]=1;
int oz=0;
for(i=1;i<=50002;i++)
Din[i]=ciur[i];
Din[0]=1;
for(i=2;i<=n;i++)
for(j=50006;j>=0;j--)
if(Din[j]!=0)
Din[V[i]+j]++;
for(i=2;i<=n;i++)
if(ciur[V[i]]==0 && Din[V[i]]==1)
{
minim++;
update[k++]=V[i];
}
fout<<minim<<"\n";
for(i=1;i<=k-1;i++)
fout<<update[i]<<"\n";
}