2013年7月30日
poj 3373 Changing Digits (DFS + 记忆化剪枝+鸽巢原理思想)
摘要： http://poj.org/problem?id=3373Changing DigitsTime Limit:3000MSMemory Limit:65536KTotal Submissions:2719Accepted:863DescriptionGiven two positive integersnandk, you are asked to generate a new integer, saym, by changing some (maybe none) digits ofn, such that the following properties holds:mcontains 阅读全文
posted @ 2013-07-30 16:41 crazy_apple 阅读(405) 评论(0) 推荐(0) 编辑
hdu 3303 Harmony Forever (线段树 + 抽屉原理)
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=3303Harmony ForeverTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 813 Accepted Submission(s): 222 Problem DescriptionWe believe that every inhabitant of this universe eventually will find a way to live 阅读全文
posted @ 2013-07-30 11:03 crazy_apple 阅读(654) 评论(0) 推荐(0) 编辑