uva-147 - Dollars

#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
int coin[11]={10000,5000,2000,1000,500,200,100,50,20,10,5};
long long dp[30010][20];
long long dfs(int x,int s)
{
	int i;
	if(x<0)
		return 0;
	if(dp[x][s]!=-1)
		return dp[x][s];
	dp[x][s]=0;
	for(i=s;i<11;i++)
		dp[x][s]+=dfs(x-coin[i],i);
	return dp[x][s];
}
int main()
{
	int i;
	double x;
	memset(dp,-1,sizeof(dp));
	for(i=0;i<11;i++)
		dp[0][i]=1;
	sort(coin,coin+11);
	dfs(30000,0);
	while(cin>>x)
	{
		if(x==0)
			return 0;
		printf("%6.2f%17lld\n",x,max(dp[int((x+0.005)*100)][0],0ll));
	}
}

New Zealand currency consists of $100, $50, $20, $10, and $5 notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program that will determine, for any given amount, in how many ways that amount may be made up. Changing the order of listing does not increase the count. Thus 20c may be made up in 4 ways: 1 20c, 2 10c, 10c+2 5c, and 4 5c.

Input

Input will consist of a series of real numbers no greater than $300.00 each on a separate line. Each amount will be valid, that is will be a multiple of 5c. The file will be terminated by a line containing zero (0.00).

Output

Output will consist of a line for each of the amounts in the input, each line consisting of the amount of money (with two decimal places and right justified in a field of width 6), followed by the number of ways in which that amount may be made up, right justified in a field of width 17.

Sample input

0.20
2.00
0.00

Sample output

  0.20                4
  2.00              293

uva-147 - Dollars

原文：http://blog.csdn.net/stl112514/article/details/40891607