UVA 147 Dollars

和之前的647思路都一样，

只是这个题精度卡的很准；

而且，枚举钱数必须从小到大，不按顺序写上去就会WA；

讲浮点数分成两部分的整数去处理防止精度问题 ， 而且钱种类多，组合数非常大，需要用long long；

Description

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.202.000.00

Sample output

  0.20                4  2.00              293

AC代码：

#include <bits/stdc++.h>using namespace std ;long long dp[400000];int main(){int a[11]={5,10,20,50,100,200,500,1000,2000,5000,10000};dp[0]=1;for(int i = 0 ; i<11;i++){for(int j =a[i];j<=30000;j++){dp[j]+=dp[j-a[i]];}}int i , j ;while(scanf("%d.%d",&i,&j),i+j){int n ;n=i*100+j;printf("%6.2lf%17lld\n",n*1.0/100,dp[n]);}return 0 ;}