1068. Find More Coins (30)-PAT甲级真题（01背包）

柳婼

已于 2023-11-09 17:31:54 修改

阅读量3.7k

点赞数 8

文章标签： PAT 算法

于 2016-08-22 17:37:42 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/52278809

版权

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 104 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=104, the total number of coins) and M(<=102, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers. All the numbers in a line are separated by a