Pagini recente » Cod sursa (job #2365805) | Cod sursa (job #735351) | Cod sursa (job #2609436) | Cod sursa (job #3224002) | Cod sursa (job #290109)
Cod sursa(job #290109)
#include<fstream>
#include<algorithm>
using namespace std;
int aux,monede,i,n,m,j,x[50010],v[1010];
int cmp(int a,int b) {return a<b;}
int main()
{
ifstream f("economie.in");
ofstream g("economie.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1,cmp);
m=v[n];
for(i=1;i<=n;i++)
{ aux=v[i];
if(!x[aux]) monede++;
for(j=aux;j<=m;j++)
if(j%aux==0) { x[j]=1; if(j+aux<=m) x[j+aux]=1;}
else if(x[j]) if(j+aux<=m) x[j+aux]=1;
}
g<<monede<<'\n'; for(i=1;i<=monede;i++) g<<v[i]<<'\n';
f.close();
g.close();
return 0;
}