K - Coins(多重背包的变种题）

最新推荐文章于 2021-09-02 16:11:11 发布

年轻过成了秃顶

最新推荐文章于 2021-09-02 16:11:11 发布

阅读量489

点赞数

CC 4.0 BY-SA版权

分类专栏： dp 文章标签： C语言背包dp

本文链接：https://blog.youkuaiyun.com/qq_43506138/article/details/89054778

这是一个关于如何用C语言解决多重背包问题的实例。给定不同面值的硬币和数量，以及最大价格m，目标是计算可以使用这些硬币支付多少种不同的价格。通过标记硬币能表示的价值并利用二进制优化，可以找出能用硬币表示的m以内所有价值中被标记过的数量。

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

题目描述：

Whuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1 ≤ n ≤ 100),m(m ≤ 100000).The second line contains 2n integers, denoting A1,A2,A3…An,C1,C2,C3…Cn (1 ≤ Ai ≤ 100000,1 ≤ Ci ≤ 1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 10
1 2 4 2 1 1
2 5
1 4 2 1