Cod sursa(job #2579484)
Utilizator | bety bety bety | Data | 12 martie 2020 15:18:37 |
---|---|---|---|
Problema | Economie | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <bits/stdc++.h>
#define NUM 50005
int v[NUM];
int ok[NUM];
int sol[NUM];
int n;
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
f >> v[i];
sort(v + 1, v + n + 1);
ok[0] = 1;
for(int i = 1; i <= n; ++i)
{
if(!ok[v[i]])
{
sol[++sol[0]] = v[i];
for(int j = 0; j + v[i] <= v[n]; ++j)
if(ok[j])
ok[j + v[i]] = 1;
}
}
for(int i = 0; i <= sol[0]; ++i)
g << sol[i] << '\n';
f.close();
g.close();
}