完全背包基础小猪存钱罐

最新推荐文章于 2025-05-13 13:09:39 发布

CCYYHHH

最新推荐文章于 2025-05-13 13:09:39 发布

阅读量1k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：背包

本文链接：https://blog.youkuaiyun.com/CCYYHHH/article/details/80005809

该博客讨论了如何利用动态规划解决一个关于完全背包的问题。题目要求在给定每种硬币的重量和面值的情况下，找出达到特定总重量所需的最小金额。如果无法精确达到目标重量，则输出“这是不可能的。”动态规划是解决此类背包问题的关键方法。

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

Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.

But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights