2013年3月24日
HDU 2845 Beans
摘要： BeansTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1819Accepted Submission(s): 921 Problem DescriptionBean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one be 阅读全文
posted @ 2013-03-24 22:56 Jack Ge 阅读(248) 评论(0) 推荐(0)
HDU 2844 Coins (多重背包)
摘要： CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4071Accepted Submission(s): 1629 Problem DescriptionWhuacmers 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 d 阅读全文
posted @ 2013-03-24 13:22 Jack Ge 阅读(473) 评论(0) 推荐(1)
HDU 3006 The Number of set (状态压缩)
摘要： The Number of setTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 889Accepted Submission(s): 550 Problem DescriptionGiven you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set 阅读全文
posted @ 2013-03-24 12:37 Jack Ge 阅读(227) 评论(0) 推荐(0)