Pagini recente » Cod sursa (job #429089) | Cod sursa (job #583086) | Cod sursa (job #2343713) | Cod sursa (job #3166863) | Cod sursa (job #918713)
Cod sursa(job #918713)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream f("economie.in");
ofstream g("economie.out");
short n,i,k;
f>>n;
unsigned short a[n],megoldas[n],db=0;
fill(megoldas,megoldas+n,0);
fill(a,a+n,0);
for(i=0;i<n;i++)
{
f>>a[i];
}
sort(a,a+n);
bool van=true;
bool oszthato[n];
fill(oszthato, oszthato+n,false);
for(k=0;k<n;k++)
{
if(oszthato[k]==false)
{
db++;
megoldas[k]=a[k];
van=false;
for(i=k;i<n;i++)
{
if(a[i]%a[k]==0)
{
oszthato[i]=true;
}
if(oszthato[i]==false)
{
van=true;
}
}
}
if(!van)
{
k=n;
}
}
g<<db<<"\n";
for(i=0;i<n;i++)
{
if(megoldas[i]>0)
{
g<<megoldas[i]<<"\n";
}
}
}