2010年4月15日
1023
摘要： [代码] 阅读全文
posted @ 2010-04-15 23:22 にんじゃ 阅读(266) 评论(0) 推荐(0)
1022
摘要： 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)
1021
摘要： [代码] 阅读全文
posted @ 2010-04-15 23:18 にんじゃ 阅读(142) 评论(0) 推荐(0)
1020
摘要： [代码] 阅读全文
posted @ 2010-04-15 23:16 にんじゃ 阅读(167) 评论(0) 推荐(0)
1019
摘要： [代码] 阅读全文
posted @ 2010-04-15 23:15 にんじゃ 阅读(136) 评论(0) 推荐(0)
1018
摘要： [代码] 阅读全文
posted @ 2010-04-15 23:13 にんじゃ 阅读(276) 评论(0) 推荐(0)
1017
摘要： /*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)
1016
摘要： 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)
1015
摘要： [代码] 阅读全文
posted @ 2010-04-15 22:57 にんじゃ 阅读(156) 评论(0) 推荐(0)
1014
摘要： [代码] 阅读全文
posted @ 2010-04-15 22:49 にんじゃ 阅读(337) 评论(0) 推荐(0)