摘要: A Knight's JourneyTime Limit:1000MSMemory Limit:65536KTotal Submissions:25463Accepted:8672DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a... 阅读全文
posted @ 2013-07-28 20:48 哥的笑百度不到 阅读(245) 评论(0) 推荐(0) 编辑
摘要: 下沙小面的(2)Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1131Accepted Submission(s): 429Problem Description前文再续,书接上一题。话说当上小面的司机的Lele在施行他的那一套拉客法则以后,由于走的路线太长,油费又贵,不久便亏本了。(真可怜~)于是他又想了一个拉客的办法。对于每一次拉客活动,他一次性把乘客都拉上车(当然也不会超过7个,因为位置只有7个)。然后,Lele计算出一条路线(出于某些 阅读全文
posted @ 2013-07-28 18:30 哥的笑百度不到 阅读(257) 评论(0) 推荐(0) 编辑
摘要: Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5038Accepted Submission(s): 2335Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to ... 阅读全文
posted @ 2013-07-28 16:34 哥的笑百度不到 阅读(215) 评论(0) 推荐(0) 编辑
摘要: Sum It UpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2983Accepted Submission(s): 1494Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. Fo... 阅读全文
posted @ 2013-07-28 15:43 哥的笑百度不到 阅读(240) 评论(0) 推荐(0) 编辑
摘要: Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19946Accepted Submission(s): 8935Problem 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 nu 阅读全文
posted @ 2013-07-28 10:48 哥的笑百度不到 阅读(125) 评论(0) 推荐(0) 编辑