Cod sursa(job #2844070)
| Utilizator | Data | 3 februarie 2022 18:21:39 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int v[1001],deja[50001];
bool fr[50001];
int main()
{
int n,rez=0,poz=0;
fin>>n;
for(int i=0;i<n;i++)
{
fin>>v[i];
}
sort(v,v+n);
int valmax=v[n-1];
for(int i=0;i<n;i++)
{
if(fr[v[i]]==0)
{
rez++;
deja[poz]=v[i];
poz++;
for(int j=0;j<poz;j++)
{
if(deja[j]+v[i]>valmax)
continue;
fr[deja[j]+v[i]]=1;
deja[poz]=deja[j]+v[i];
poz++;
}
}
}
fout<<rez;
}
