[백준] 2629번 양팔저울 (파이썬)

2629번: 양팔저울

 

 

코드

n = int(input(""))
n_list = list(map(int, input().split()))
m = int(input(""))
m_list = list(map(int, input().split()))
possible = []
answer = [[0]*15001 for i in range(n+1)]

def solution(n_list, n, now, left, right, possible):
    new = abs(left-right)
    if new not in possible:
        possible.append(new)
    if now == n:
        return 0
    if answer[now][new] == 0:
        solution(n_list, n, now+1, left+n_list[now], right, possible)
        solution(n_list, n, now+1, left, right+n_list[now], possible)
        solution(n_list, n, now+1, left, right, possible)
        answer[now][new] = 1

solution(n_list, n, 0, 0, 0, possible)
for i in range(m):
    if m_list[i] in possible:
        print("Y", end=" ")
    else:
        print("N", end=" ")