Coin Change(UVA 674)
2015-03-20 14:49
405 查看
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 withthe 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
题解:完全背包问题
for 硬币价值1 -> 硬币价值n
if(w>p[i]) d[w]+=d[w-p[i]] w值从小到大排列
代码:c++
// Memory 0KB ; Time:242ms
#include<iostream>#include<queue>#include<string.h>#include<math.h>#define MAXN 7500using namespace std;int d[MAXN];int main(){int money;int p[5]={1,5,10,25,50};memset(d,0,sizeof(d));for(int a=0;a<5;a++){d[p[a]]++;for(int b=p[a]+1;b<=MAXN;b++){d[b]+=d[b-p[a]];}}while(cin>>money){cout<<d[money]<<endl;}return 0;}
相关文章推荐
- UVa 674 Coin Change (经典DP)
- Coin Change(UVA 674)
- UVA 674 - Coin Change
- UVA 674_Coin Change
- uva 674 Coin Change (DP)
- UVa 674 - Coin Change 背包dp
- uva 674 Coin Change
- uva 674 && hdu 2069 coin change(水完全背包)
- UVA 674-Coin Change(DP)
- UVA 674 Coin Change
- uva 674 - Coin Change
- UVa 674 - coin change
- UVA 674 - Coin Change
- UVa 674 Coin Change【记忆化搜索】
- UVA 674 Coin Change
- uva 674 Coin Change
- UVA 674 Coin Change ,Commence
- UVa 674 - Coin Change
- UVA 674 coin change
- 算法->完全背包问题 UVa 674 Coin Change