多种面额硬币组合问题,类似于此题:UVA - 674 - Coin Change(动态规划)。
由于出现小数,所以将金额扩大100倍变成整数。
d[]要用long long
WA了一次,百思不得其解,原来是浮点数精度问题:
用int mm = 100*money;
输入285.65可能mm = 284
改成int mm = 100*money+0.5;
则可以确保mm = 285
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAX_N = 301*100, MAX_M = 11, INF = 0x3f3f3f3f;
int N;
long long d[MAX_N];
int m[11] = {5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000};
int main()
{
//freopen("in.txt", "r", stdin);
double money;
d[0] = 1;
for(int i = 0; i < 11; i++)
for(int j = m[i]; j <= MAX_N; j++)
d[j] += d[j-m[i]];
while(scanf("%lf", &money) && money!=0)
{
int mm = 100*money+0.5;
printf("%6.2lf%17lld\n", money, d[mm]);
}
return 0;
}