SOJ-1009（dollars，简单动态规划）

最新推荐文章于 2020-12-29 00:34:36 发布

famousDT

最新推荐文章于 2020-12-29 00:34:36 发布

阅读量1.5k

点赞数

分类专栏：普通算法

本文链接：https://blog.csdn.net/famousDT/article/details/6921600

版权

普通算法专栏收录该内容

71 篇文章 0 订阅

订阅专栏

ll s[] = {5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000};
int main()
{
	ll i, j;
	ll d[5005] = {0};
	d[0] = 1;
	for (i = 0; i <= 10; ++i) {
		for (j = 0; s[i] + j <= 5000; ++j)
			d[s[i] + j] += d[j];
	}
	double n;
    while (scanf("%lf", &n) == 1 && (int)(n * 100) != 0)
		printf("%5.2lf%12lld\n", n, d[(int)((n + 0.005) * 100)]);
    return 0;
}