《动态规划》— POJ 3181 Dollar Dayz(完全背包+大数)

6个小石头

于 2017-04-15 21:21:56 发布

阅读量714

点赞数

分类专栏：动态规划文章标签： ACM 动态规划完全背包问题 POJ 3181 Doolar Dayz

本文链接：https://blog.youkuaiyun.com/LiuJiuXiaoShiTou/article/details/70187178

版权

本文介绍了如何用动态规划算法解决ACM中的Dollar Dayz问题，即农夫约翰在有限预算内购买不同价格工具的所有可能组合。通过分析1到K元的工具，可以找到所有花费N元的购买方式。题目给出的例子中，当N为5元，K为3时，有5种不同的购买策略。程序的目标是输出在给定条件下FJ的花钱方案数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Dollar Dayz

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7124		Accepted: 2656

Description

Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer John has exactly $5 to spend. He can buy 5 tools at $1 each or 1 tool at $3 and an additional 1 tool at $2. Of course, there are other combinations for a total of 5 different ways FJ can spend all his money on tools. Here they are:

        1 @ US$3 + 1 @ US$2

        1 @ US$3 + 2 @ US$1

        1 @ US$2 + 3 @ US$1

        2 @ US$2 + 1 @ US$1

        5 @ US$1

Write a pro

最低0.47元/天解锁文章