[백준][Python] 1660 캡틴이다솜 후보군을 구하고 knapsack import sys input = sys.stdin.readline N = int(input()) nums = [] num = 0 idx = 1 while num i: break dp[i] = min(dp[i], 1 + dp[i - num]) print(dp[N]) practivceAlgorithm/백준 2021.10.04