PS/동적 계획법
[백준] No.2293 동전 1 完
_빌런
2023. 8. 22. 23:57
# ---------- Import ----------
import sys
input = sys.stdin.readline
# ---------- Main ----------
N, K = map(int, input().split())
coins = [int(input()) for _ in range(N)]
dp = [0] * (K+1)
dp[0] = 1
for coin in coins:
for k in range(coin, K+1):
dp[k] += dp[k-coin]
print(dp[-1])