题解：Coins（多重背包）

最新推荐文章于 2021-07-23 22:37:49 发布

嘘......

最新推荐文章于 2021-07-23 22:37:49 发布

阅读量273

点赞数

分类专栏：杂七杂八

本文链接：https://blog.csdn.net/weixin_43540515/article/details/99568504

版权

在银币国度Silverland，人们使用不同面额的硬币进行交易。Tony想要购买一块手表，他希望用手中恰好足够的硬币来支付确切的价格，且知道价格不会超过m。给定硬币面额和数量，编程计算可以支付多少种不同的价格。输入包含多个测试案例，每个案例有n个硬币种类和价格上限m，以及每种硬币的数量。最后以两个零结束。程序需按多重背包思路处理问题。

摘要由CSDN通过智能技术生成

People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box 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.