[Python] 백준 11047 동전 0

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

풀이

N, K = map(int, input().split())

coin = []

for _ in range (N):
    coin.append(int(input()))

index = N-1
count = 0

while K > 0:
    if coin[index] > K:
        index -= 1
    else:
        count += K // coin[index]
        K %= coin[index]
print(count)