Pagini recente » Cod sursa (job #2320612) | Cod sursa (job #1995487) | Cod sursa (job #2170802) | Cod sursa (job #333036) | Cod sursa (job #425912)
Cod sursa(job #425912)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int V[1002],n,i,j,k,update[1002],affirmative,x,minim;
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];
minim++;
affirmative=1;
k=2;
for(i=2;i<=n;i++)
{
if(affirmative==1)
{
for(x=1;x<=V[i-1]/2;x++)
if(x*V[i-1]==V[i])
{
minim++;
update[k++]=V[i];
}
else
affirmative=0;
}
}
fout<<minim<<"\n";
for(i=1;i<=k-1;i++)
fout<<update[i]<<" ";
return 0;
}