Cod sursa(job #3154509)
Utilizator | Data | 4 octombrie 2023 21:24:34 | |
---|---|---|---|
Problema | Economie | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int dim1=1005,dim2=5e4+5;
int a[dim1],n,len,sol[dim1];
bool viz[dim2];
int main(){
ifstream f("economie.in");
ofstream g("economie.out");
f>>n;
for(int i=1;i<=n;i++){
f>>a[i];
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
if(!viz[a[i]]){
viz[a[i]]=1;
sol[++len]=a[i];
for(int j=2*a[i];j<dim2;j++){
viz[j-a[i]]=1;
}
}
}
g<<len<<'\n';
for(int i=1;i<=len;i++){
g<<sol[i]<<' ';
}
return 0;
}