[Python]2529. 부등호

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

2529번: 부등호

---

 

 

def recur(idx):
 
    if len(tmp) == k+1:
        result.append(tmp[:])
        return
 
    for i in range(10):
        if idx == -1 and candi[i]:
            tmp.append(i)
            candi[i] -= 1
            recur(idx + 1)
            tmp.pop()
            candi[i] += 1
        else:
            if a[idx] == '<':
                if tmp[idx] < i and candi[i]:
                    tmp.append(i)
                    candi[i] -= 1
                    recur(idx+1)
                    tmp.pop()
                    candi[i] += 1
 
            elif a[idx] == '>':
                if tmp[idx] > i and candi[i]:
                    tmp.append(i)
                    candi[i] -= 1
                    recur(idx+1)
                    tmp.pop()
                    candi[i] += 1
 
k = int(input())
a = input().split()
candi = [1]*10
tmp = []
result = []
recur(-1)
print(''.join(map(str, result[-1])))
print(''.join(map(str, result[0])))