摘要: 链接:http://acm.xmu.edu.cn/JudgeOnline/problem.php?id=12371237.数袜子Time Limit: 2000 MS Memory Limit: 65536 K Total Submissions: 429 (101 users) Accepted: 92 (76 users) [ My Solution ] Description话说当年swgr早上起床时经常在一堆颜色相近但款式不同的袜子堆里找到两只配对的袜子,为此常常要浪费不少时间。久而久之,swgr终于想到了一劳永逸的办法:他买了一大堆一模一样的袜子,这样就不用担心配对的问题了。由于袜子 阅读全文
posted @ 2012-07-21 22:01 hnust_tongguang 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 1086: 超市购物Time Limit: 1 Sec Memory Limit: 128 MBSUBMIT: 130 Solved: 52[SUBMIT][STATUS]Description上次去超市扫荡回来的东西用完了,Staginner又得跑超市一趟,出发前他列了一张购物清单,打算去买K种不同的商品,每种买一件。到了超市,Staginner发现每种商品有N个品牌,每个品牌此商品的价格为Vi,对Staginner的作用值为Wi,他会从这N个品牌里面挑一个品牌买。这时,Staginner突然想起出门时只带了M元钱,又懒得去取钱了,所以不一定能买完K种商品,只好尽可能地让买的东西对自己的总作 阅读全文
posted @ 2012-07-21 21:45 hnust_tongguang 阅读(303) 评论(0) 推荐(0) 编辑
摘要: 链接:http://acm.hdu.edu.cn/showproblem.php?pid=4302Holedox EatingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1031 Accepted Submission(s): 354Problem DescriptionHoledox is a small animal which can be considered as one point. It lives in a straigh 阅读全文
posted @ 2012-07-21 21:32 hnust_tongguang 阅读(265) 评论(0) 推荐(0) 编辑