Pagini recente » Cod sursa (job #622254) | Cod sursa (job #46032) | Cod sursa (job #2177384) | Cod sursa (job #1108188) | Cod sursa (job #1898326)
#include <fstream>
#include <algorithm>
#include <vector>
#define NMAX 50005
using namespace std;
ifstream in("economie.in");
ofstream out("economie.out");
int N, contor;
int v[NMAX];
int S[NMAX];
int sol[NMAX];
int maxi;
void Read(){
in >> N;
for(int i = 1; i <= N; ++i)
in >> v[i];
}
void Solve(){
sort(v + 1, v + N + 1);
maxi = v[N];
for(int i = 1; i <= N; ++i){
if(!S[v[i]]){
contor++;
for(int j = i + 1; j <= maxi; ++j){
if(S[j])
S[j + v[i]] = 1;
else if(j % v[i] == 0)
S[j] = 1;
}
}
}
}
void Print(){
out << contor << "\n";
for(int i = 1; i <= N; ++i){
if(!S[v[i]])
out << v[i] << " ";
}
}
int main()
{
Read();
Solve();
Print();
return 0;
}