HDU2069 - Coin Change - 基础dp（经典硬币问题）

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

原创

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

2 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #acm竞赛 #动态规划

这是一篇关于HDU2069 Coin Change问题的博客，主要讨论如何使用动态规划解决经典硬币组合问题。文章介绍了题目背景，分析了限制硬币数量情况下的一维和二维动态规划解决方案，并给出了相关代码实现。

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

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 t