Coin Change----------蛮力法

硬币找零问题求解

最新推荐文章于 2021-07-28 19:00:42 发布

原创最新推荐文章于 2021-07-28 19:00:42 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c #iostream #input #types #output #each

acm综合专栏收录该内容

5 篇文章

订阅专栏

本文探讨了一种算法解决方案，用于计算特定金额下不同硬币组合的数量。通过使用五种面额的硬币（50、25、10、5和1美分），程序能够找出对于任意给定金额的所有可能的找零方式。

第 2348 题： Coin Change【hdoj2069】
(时间限制为：500毫秒)

Problem Description

Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money.

For example, if we have 11 cents, then we can make changes with one 10-cent coin and one 1-cent coin, or two 5-cent coins and one 1-cent coin, or one 5-cent coin and six 1-cent coins, or eleven 1-cent coins. So there are four ways of making changes for 11 cents with the above coins. Note that we count that there is one way of making change for zero cent.

Write a program to find the total number of different ways of making changes for any amount of money in cents. Your program should be able to handle up to 100 coins.

Input

The input file contains any number of lines, each one consisting of a number ( ≤250 ) for the amount of money in cents.

Output

For each input line, output a line containing the number of different ways of making changes with the above 5 types of coins.

Sample Input

Sample Output