DP-1424: Coin Change

硬币找零算法

最新推荐文章于 2019-12-01 20:43:14 发布

原创最新推荐文章于 2019-12-01 20:43:14 发布 · 726 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#input #types #output #each #list #file

ACM_动态规划专栏收录该内容

100 篇文章

订阅专栏

Status	In/Out	TIME Limit	MEMORY Limit	Submit Times	Solved Users	JUDGE TYPE
	stdin/stdout	3s	8192K	298	95	Standard

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.

Input

The input file contains any number of lines, each one consisting of a number 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

11
26

Sample Output

4
13

This problem is used for contest: 81

Submit / Problem List / Status / Discuss

#include<stdio.h>
int main()
{
 int coin[5]={1,5,10,25,50};
 int a[7490]={0};
 a[0]=1;
 for(int i=0;i<5;i++)
 for(int j=coin[i];j<=7489;j++)
 a[j]+=a[j-coin[i]];
 int n;
 while(scanf("%d",&n)!=EOF)
 printf("%d/n",a[n]);
 return 0;
}