摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:26
にんじゃ
阅读(306)
评论(0)
推荐(0)
摘要：
Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich citie... 阅读全文
posted @ 2010-04-15 23:25
にんじゃ
阅读(456)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:24
にんじゃ
阅读(24921)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:22
にんじゃ
阅读(267)
评论(0)
推荐(0)
摘要：
Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the... 阅读全文
posted @ 2010-04-15 23:20
にんじゃ
阅读(162)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:18
にんじゃ
阅读(142)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:16
にんじゃ
阅读(168)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:15
にんじゃ
阅读(137)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 23:13
にんじゃ
阅读(276)
评论(0)
推荐(0)
摘要：
/*Description: to * * Author: Vincent* * Date:2010/04/* Contact:agilely@126.com * Zju CS Lab*///1017搜索 /格式如下：//Case %d: %d\n//每个块间有一空行，最后一块没有，Case 每块从1开始计数；/*Problem DescriptionGiven two integers n an... 阅读全文
posted @ 2010-04-15 23:00
にんじゃ
阅读(156)
评论(0)
推荐(0)
摘要：
Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Not... 阅读全文
posted @ 2010-04-15 22:59
にんじゃ
阅读(110)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 22:57
にんじゃ
阅读(156)
评论(0)
推荐(0)
摘要：
[代码] 阅读全文
posted @ 2010-04-15 22:49
にんじゃ
阅读(337)
评论(0)
推荐(0)
摘要：
Digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13784Accepted Submission(s): 3853Problem DescriptionThe digital root of a positive inte... 阅读全文
posted @ 2010-04-15 22:04
にんじゃ
阅读(228)
评论(0)
推荐(0)
摘要：
Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.OutputOutput... 阅读全文
posted @ 2010-04-15 22:01
にんじゃ
阅读(122)
评论(0)
推荐(0)
摘要：
打算把以前做过的题整理一下顺便再学习一遍。 阅读全文
posted @ 2010-04-15 21:57
にんじゃ
阅读(77)
评论(0)
推荐(0)
摘要：
代码 阅读全文
posted @ 2010-04-15 21:55
にんじゃ
阅读(147)
评论(0)
推荐(0)
摘要：
代码 阅读全文
posted @ 2010-04-15 21:44
にんじゃ
阅读(139)
评论(0)
推荐(0)
浙公网安备 33010602011771号