uva 674 - Coin Change

最新推荐文章于 2026-04-22 05:31:06 发布

原创最新推荐文章于 2026-04-22 05:31:06 发布 · 2.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

动态规划专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种解决硬币找零问题的算法实现，通过动态规划的方法找出特定金额下使用5种不同面额硬币的所有可能组合数。该算法能够处理高达7489美分的金额，并附带了一个C语言程序示例。

Coin Change

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, two 5-cent coins and one 1-cent coin, 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 7489 cents.

11
26

Sample Output

4
1

#include<stdio.h>
#include<string.h>
#define max 7489
int a[max+1][5],b[5]={5,10,25,50};
int main()
{
 int i,j,x;
 for (i=1;i<=max;i++)
 a[i][0]=1;
 for (i=0;i<4;i++)
 {
  for (j=1;j<=max;j++)
  if (j<b[i]) a[j][i+1]=a[j][i];
         else if (j==b[i]) a[j][i+1]=a[j][i]+1;
                else       a[j][i+1]=a[j-b[i]][i+1]+a[j][i];
 }
 while (scanf("%d",&x)!=EOF)
 printf("%d\n",a[x][4]);
 return 0;
}