[TIL] Algorithms Day 5 - Greedy, Combination
Problem 1. Coin (Greedy)
N, K = map(int, input().split())
arr = []
count = 0
for _ in range(N):
arr.append(int(input()))
for i in range(N-1, -1, -1):
if K >= arr[i]:
count += K // arr[i]
K = K % arr[i]
print(count)
Problem ...
siwonlog.hashnode.dev2 min read