Cod sursa(job #2501153)
| Utilizator | Data | 29 noiembrie 2019 09:48:02 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | simu | Marime | 0.81 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1005],f[50005],viz[50005],s[1005];
int main()
{
ifstream cin("economie.in");
ofstream cout("economie.out");
int n,k=0,x;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>x;
if(viz[x]==0)
{
viz[x]=1;
v[++k]=x;
}
}
sort(v+1,v+k+1);
int cnt=0;
for(int i=1; i<=k; i++)
{
if(f[i]==0)
{
f[i]=1;
cnt++;
s[cnt]=v[i];
for(int j=i+1; j<=k; j++)
{
if(v[j]%v[i]==0)
{
f[j]=1;
}
}
}
}
cout<<cnt<<"\n";
for(int i=1; i<=cnt; i++)
cout<<s[i]<<" ";
return 0;
}
