Pagini recente » Cod sursa (job #1434083) | Cod sursa (job #1554218) | Cod sursa (job #2070932) | Cod sursa (job #2211744) | Cod sursa (job #2922376)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <fstream>
using namespace std;
ifstream fin ("semne.in");
ofstream fout("semne.out");
int F[50001];
long long V[50001],S,s,i,n;
int solutie(long long suma,int n)
{
int j;
if(suma<s)
return 0;
if(suma==s)
return 1;
for(j=n;j>=1;j--)
{
F[j]=0;
if(solutie(suma-2*V[j],j-1))
return 1;
F[j]=1;
}
return 0;
}
int main()
{
fin>>n>>s;
for(i=1;i<=n;i++)
{
fin>>V[i];
S=S+V[i];
F[i]=1;
}
solutie(S,n);
for(i=1;i<=n;i++)
{
if(F[i]==1)
fout<<"+";
else
fout<<"-";
}
return 0;
}