UVA 147 Dollars

 Dollars

New Zealand currency consists of $100, $50, $20, $10, and $5notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program thatwill determine, for any given amount, in how many ways that amount maybe 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.00each on a separate line. Each amount will be valid, that is will be amultiple 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 placesand right justified in a field of width 6), followed by the number ofways in which that amount may be made up, right justified in a fieldof width 17.

Sample input

0.202.000.00

Sample output

  0.20                4  2.00              293

子集和问题

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <set>#include <queue>using namespace std;#define maxn 6005#define inf 0x7ffffffpair <int ,int > p;int arr[]={1,2,4,10,20,40,100,200,400,1000,2000};long long dp[maxn];double n;int main(){   fill(dp,dp+maxn,1);    for(int i = 1; i < 11;i++){        for(int j = arr[i]; j < 6001;j++){            dp[j] += dp[j - arr[i]];        }    }    while(scanf("%lf",&n) != EOF && n){       int tmp = n* 20;        printf("%6.2lf%17lld\n",n,dp[tmp]);    }    return 0;}