[Python] 백준 <2293-동전 1>

https://www.acmicpc.net/problem/2293

 

import sys
input = sys.stdin.readline

N, K = map(int, input().split())
li = list()
for _ in range(N):
    li.append(int(input()))

dp = [0]*(K+1)
dp[0] = 1

# 점화식 : dp[j] = dp[j] + dp[i(동전 종류)]
for i in li:
    for j in range(i, K+1):
        dp[j] += dp[j-i]
print(dp[K])