Pagini recente » Cod sursa (job #1641882) | Cod sursa (job #236058) | Cod sursa (job #2285202) | Cod sursa (job #608898) | Cod sursa (job #2116166)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream in ("economie.in");
ofstream out ("economie.out");
int n,sol,val[1001],obtin[100001],x,rez[1001];
int main (void) {
in >> n;
for (int i = 1; i <= n; i ++) {
in >> val[i];
}
sort (val+1,val+n+1);
for (int i = 1; i <= n; i ++) {
if (obtin[val[i]] == 0) {
for (int j = 0; j < i; j ++) {
x = val[i] + val[j];
if (obtin[x] == 0) {
for (int k = x; k <= 50000; k += x) {
obtin[k] = 1;
}
}
}
rez[++sol] = val[i];
}
}
out << sol <<"\n";
for (int i = 1; i <= sol; i ++) {
out << rez[i] <<"\n";
}
}