Pagini recente » Monitorul de evaluare | Profil DeanWinchester | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #906543)
Cod sursa(job #906543)
#include <cstdio>
const int MAXN = 50001;
int S, N;
long long A[MAXN];
char res[MAXN];
bool doit(long long sum, int pos)
{
if (sum < S)
return false;
if (sum == S)
return true;
for (int i = 0; i <= pos; ++i) {
res[i] = '-';
if (doit(sum - 2 * A[i], i - 1))
return true;
res[i] = '+';
}
return false;
}
int main()
{
freopen("semne.in", "r", stdin);
freopen("semne.out", "w", stdout);
scanf("%d %d", &N, &S);
long long sum = 0;
for (int i = 0; i < N; ++i) {
scanf("%lld", &A[i]);
sum += A[i];
res[i] = '+';
}
doit(sum, N - 1);
for (int i = 0; i < N; ++i)
printf("%c", res[i]);
printf("\n");
return 0;
}