Pagini recente » Cod sursa (job #17393) | Cod sursa (job #1477520) | Cod sursa (job #583190) | Cod sursa (job #2404060) | Cod sursa (job #2875615)
#include <bits/stdc++.h>
#define MAX_N 1000
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int main() {
int n, arr[MAX_N], mul = 0;
vector<int> nrs;
bitset<MAX_N> mask;
fin >> n;
for (int i = 0; i < n; i++)
fin >> arr[i];
sort(arr, arr + n);
for (int i = 0; i < n && mul < n; i++) {
if (mask[i])
continue;
nrs.push_back(arr[i]);
for (int j = i; j < n; j++)
if (arr[j] % arr[i] == 0)
mask[j] = 1, mul++;
}
fout << nrs.size() << '\n';
for (auto &nr: nrs)
fout << nr << '\n';
return 0;
}