세용용용용 2023. 7. 12. 19:44

def dfs(numbers, target, index_count, total_result):
    answer = 0
    if len(numbers) == index_count:
        if total_result==target:
            return 1
        else:
            return 0
    else:
        answer += dfs(numbers, target, index_count+1, total_result+numbers[index_count])
        answer += dfs(numbers, target, index_count+1, total_result-numbers[index_count])
    return answer


def solution(numbers, target):
    answer = dfs(numbers, target, 0, 0)
    print(answer)
    return answer
solution([1,1,1,1,1], 3)