Cod sursa(job #3162438)
| Utilizator | Data | 29 octombrie 2023 11:37:37 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
#include <vector>
#include <algorithm>
#define max_val 50000
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int v[1005];
int n;
bool c[max_val+5];
vector <int> sol;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for(int i = 1;i<=n;i++)
{
if(!c[v[i]])
sol.push_back(v[i]);
for(int j=v[i];j<=max_val;j+=v[i])
c[j]=true;
}
fout<<int(sol.size())<<'\n';
for(auto& i : sol)
fout<<i<< ' ';
}
