백준 2309번 일곱 난쟁이(파이썬)

정답 코드

a = []

for i in range(9):
    b = int(input())
    a.append(b)

t = []
visited = [False for j in range(9)]


def dfs(cnt, start):
    if cnt == 7:
        if sum(t) == 100:
            t.sort()
            for t1 in t:
                print(t1)

    for k in range(start, 9):
        if not visited[k]:
            t.append(a[k])
            visited[k] = True
            dfs(cnt + 1, k)
            visited[k] = False
            t.pop()


dfs(0, 0)