摘要: 1 数位DP 2 3 4 这类题,才刚刚接触,记得去年网络赛,就有道这样的题,我完全不会, 5 6 对于这类题基本方法是,是利用数的位数来构造转移方程。 7 8 下面给出两篇论文的链接: 9 10 《数位计数问题解法研究》11 12 《浅谈数位类统计问题》13 14 下面给出某位大牛关于此类题报告的链接:15 16 http://www.cppblog.com/Yuan/archive/2011/07/15/139299.html17 18 FOJ 204219 20 http://acm.fzu.edu.cn/problem.php?pid=204221 22 解法23 24 h... 阅读全文
posted @ 2013-09-11 22:50 龚细军 阅读(284) 评论(0) 推荐(0)
摘要: The Number Off of FFFTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 169 Accepted Submission(s): 83 Problem DescriptionX soldiers from the famous "*FFF* army" is standing in a line, from left to right. You, as the captain of *FFF*, deci 阅读全文
posted @ 2013-09-11 19:03 龚细军 阅读(301) 评论(0) 推荐(0)
摘要: Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 61 Accepted Submission(s): 39 Problem DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, w 阅读全文
posted @ 2013-09-11 18:57 龚细军 阅读(411) 评论(0) 推荐(0)
摘要: A Computer Graphics ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 92 Accepted Submission(s): 80 Problem DescriptionIn this problem we talk about the study of Computer Graphics. Of course, this is very, very hard. We have designed a new m 阅读全文
posted @ 2013-09-11 18:50 龚细军 阅读(289) 评论(0) 推荐(0)