Cod sursa(job #3164526)
| Utilizator | Data | 3 noiembrie 2023 15:32:36 | |
|---|---|---|---|
| Problema | Economie | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,v[1001],nr,k,fr[50002],x[1001];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
fr[0]=1;
for(int i=1;i<=n;i++)
{
if(fr[v[i]]==0)
{
x[++nr]=v[i];
for(int j=0;j+v[i]<=v[n];j++)
if(fr[j]==1)
fr[v[i]+j]=1;
}
}
fout<<nr<<'\n';
for(int i=1;i<=nr;i++)
fout<<x[i]<<" ";
return 0;
}
