Pagini recente » Cod sursa (job #2117215) | Cod sursa (job #2588711) | Borderou de evaluare (job #1330268) | Cod sursa (job #3249451) | Cod sursa (job #2704626)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n, dim, v[1005];
bool ok[50005];
vector <int> rez;
int main() {
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i], dim = max(dim, v[i]);
sort(v + 1, v + n + 1);
for (int i = 1; i <= n; ++i) {
if (ok[v[i]])
continue;
rez.push_back(v[i]);
for (int j = v[i]; j <= dim; j += v[i])
ok[j] = true;
}
fout << rez.size() << "\n";
for (int i = 0; i < rez.size(); ++i)
fout << rez[i] << "\n";
return 0;
}