Source: Problem - 996A - Codeforces
状态转移方程
题解
n=eval(input())
big=n//100
n%=100
coins=[1,5,10,20,100]
dp=[float("inf") for i in range(n+1)]
dp[0]=0
for i in range(1,n+1):
for coin in coins:
if i-coin >=0:
dp[i]=min(dp[i],dp[i-coin]+1)
print(dp[n]+big)