原题:
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 tex2html_wrap_inline25 20c, 2 tex2html_wrap_inline25 10c, 10c+2 tex2html_wrap_inline25 5c, and 4 tex2html_wrap_inline25 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
中文:
给你一堆硬币,然后给你一个数值,问你用这些种硬币找钱有多少种方法。
#include <bits/stdc++.h>
using namespace std;
long long dp[30001];
int money[11]={10000,5000,2000,1000,500,200,100,50,20,10,5};
int main()
{
ios::sync_with_stdio(false);
double n;
memset(dp,0,sizeof(dp));
dp[0]=1;
for(int i=0;i<11;i++)
{
for(int j=money[i];j<=30000;j+=5)
dp[j]+=dp[j-money[i]];
}
while(cin>>n)
{
if(n==0)
return 0;
long long x=(n+0.005)*100.0;
cout<<fixed<<setprecision(2)<<setw(6)<<n<<setw(17)<<dp[x]<<endl;
}
return 0;
}
解答:
最简单的组合计数问题,都已经做过好多遍了。注意把小数换成乘以100变成整数时的精度问题即可。