Description:将一笔零钱换成5分、2分和1分的硬币,要求每种硬币至少有一枚,有几种不同的换法?
Input:输入仅一行,输入待换的零钱数额x∈(8,100)。
Output:要求按5分、2分和1分硬币的数量依次从大到小的顺序,输出各种换法。每行输出一种换法,格式为:“fen5:5分硬币数量, fen2:2分硬币数量, fen1:1分硬币数量, total:硬币总数量”。最后一行输出“count = 换法个数”。
Sample Input:
13
Sample Output:
fen5:2, fen2:1, fen1:1, total:4
fen5:1, fen2:3, fen1:2, total:6
fen5:1, fen2:2, fen1:4, total:7
fen5:1, fen2:1, fen1:6, total:8
count = 4
n = int(input())
count = 0
fen5 = int(n / 5)
while fen5 > 0:
fen2 = int(n / 2)
while fen2 > 0:
fen1 = n
while fen1 > 0:
if fen5 * 5 + fen2 * 2 + fen1 == n:
print("fen5:" + str(fen5) + ", ", end='')
print("fen2:" + str(fen2) + ", ", end='')
print("fen1:" + str(fen1) + ", ", end='')
print("total:" + str(fen5 + fen2 + fen1))
count += 1
fen1 -= 1
fen2 -= 1
fen5 -= 1
print("count =", count)