UVa 674 - Coin Change 背包dp
2013-04-22 17:54
453 查看
Coin Change |
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
------------------
----------------
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int OO=1e9; int f[11111]; int n; int a[5]={1,5,10,25,50}; int main() { while (~scanf("%d",&n)) { memset(f,0,sizeof(f)); f[0]=1; for (int i=0;i<5;i++) { for (int j=0;j<=n-a[i];j++) { if (f[j]) f[j+a[i]]+=f[j]; } } printf("%d\n",f ); } return 0; }
Coin Change |
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
相关文章推荐
- UVA.674 Coin Change (DP 完全背包)
- UVA674 Coin Change【0/1背包+DP】
- UVa 674 - Coin Change 背包dp
- 【解题报告】uva674_Coin Change(硬币找零, dp, 完全背包)
- uva 674 && hdu 2069 coin change(水完全背包)
- UVA 674 Coin Change(dp + 完全背包)
- uva 674 Coin Change(类似完全背包)
- uva674 - Coin Change(dp)
- UVA - 674 - Coin Change (背包型DP)
- UVa 674 Coin Change(经典DP)
- UVA 674-Coin Change(DP)
- UVA 674 Coin Change 钱币兑换问题 类似完全背包
- uva 674 Coin Change (DP)
- [背包九讲笔记] UVa 674 Coin Change
- UVA674——DP(找钱1)—— Coin Change
- UVa 674 Coin Change (经典DP)
- uva 674 - Coin Change(dp)
- UVa 674 & hdu 2069 Coin Change (母函数,dp)
- UVA674 完全背包DP
- 算法->完全背包问题 UVa 674 Coin Change