[Python]1248. 맞춰봐

https://www.acmicpc.net/problem/1248

1248번: 맞춰봐

---

 

 

def check(aa):
    global n
    v3 = v[:]
    for i in range(n):
        for j in range(i, n):
            vv = v3.pop(0)
            if vv == '+':
                if sum(aa[i:j+1]) <= 0:
                    return False
            elif vv == '-':
                if sum(aa[i:j + 1]) >= 0:
                    return False
            elif vv == '0':
                if sum(aa[i:j + 1]) != 0:
                    return False
    return True
 
def recur(idx):
    global n, result
 
    if result:
        return
 
    if idx == n:
        if check(a):
            result = ' '.join(map(str, a))
        return
 
    if s[idx][idx] == '0':
        a[idx] = 0
        recur(idx + 1)
    elif s[idx][idx] == '+':
        for i in range(1,11):
            a[idx] = i
            recur(idx + 1)
    elif s[idx][idx] == '-':
        for i in range(-1,-11,-1):
            a[idx] = i
            recur(idx + 1)
 
n = int(input())
v = list(input())
lst = list(range(-10, 11))
s = [[None]*n for _ in range(n)]
a = [None]*n
v2 = v[:]
for i in range(n):
    for j in range(i,n):
        s[i][j] = v2.pop(0)
 
result = ''
recur(0)
 
print(result)