Python/백준(BOJ) 알고리즘
[백준] - 11047 파이썬 python
Present_Kim
2021. 7. 11. 17:18
n, k = map(int, input().split())
a = [0 for _ in range(n)]
cost = 0
for i in range(n):
a[i]= int(input())
for i in range(n-1,-1,-1):
cost = cost + (k // a[i])
k = k - (a[i] * (k // a[i]))
print(cost)