标签：des style blog http io color ar os for
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int dp[8000];
int coin[5]={1,5,10,25,50};
int main()
{
int i,j,x;
dp[0]=1;
for(i=0;i<5;i++)
for(j=0;j<7500;j++)
dp[j+coin[i]]+=dp[j];
while(cin>>x)
cout<<dp[x]<<endl;
return 0;
}UVA - 674
| Time Limit:3000MS | Memory Limit:Unknown | 64bit IO Format:%lld & %llu |
Description
| 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
4 13
Source
标签：des style blog http io color ar os for
原文地址：http://blog.csdn.net/stl112514/article/details/40829043
