2012年8月19日
HDU 1124 Factorial（简单数论）
摘要： FactorialTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1741Accepted Submission(s): 1114Problem DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this . 阅读全文
posted @ 2012-08-19 21:13 Suhx 阅读(179) 评论(0) 推荐(0) 编辑
HDU 2844 Coins（多重背包+二进制优化）
摘要： CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3424Accepted Submission(s): 1345Problem 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 de. 阅读全文
posted @ 2012-08-19 17:25 Suhx 阅读(250) 评论(0) 推荐(0) 编辑
HDU 2159 FATE（二维费用完全背包）
摘要： FATETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3905Accepted Submission(s): 1718Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍. 阅读全文
posted @ 2012-08-19 11:12 Suhx 阅读(242) 评论(0) 推荐(0) 编辑