题目
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
Inputcopy | Outputcopy |
---|---|
11 26 | 4 13 |
目标
输入一个数,用50,25,10,5,1来凑出这个数。输出能有多少种组合
代码1(超时)
#define _CRT_SECURE_NO_DEPRECATE
#include<stdio.h>
int main()
{
int a,i50,i25,i10,i5,i1,count=0;
while(1)
{
scanf("%d", &a);
for(i1=0;i1<=a;i1++)
for(i5=0;i5<=a/5;i5++)
for(i10=0;i10<=a/10;i10++)
for(i25=0;i25<=a/25;i25++)
for (i50 = 0; i50 <= a/50; i50++)
if (i50 * 50 +i25 * 25 + i10 * 10 + i5 * 5 + i1 == a)count++;
printf("%d\n", count);
count = 0;
}
}
使用了枚举,使每输入一个不同的数都要从新开始算,耗时长。
代码2
移步HDU - 2069 Coin Change(换硬币)解题报告(dp入门)_nagisa-kun的博客-CSDN博客
利用二维数组dp,通过找出与上一个实现金额的关系,从0开始推到上限250,dp所有数据都是从上一个推出,节省了时间。