摘要：As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems d 阅读全文

摘要：过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23353 Accepted Submission(s): 10128Probl... 阅读全文

摘要：Theme SectionProblem DescriptionIt's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play o... 阅读全文

摘要：Best RewardProblem DescriptionAfter an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasu... 阅读全文

摘要：Problem DescriptionGenerally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two st... 阅读全文

摘要：PeriodProblem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we wa... 阅读全文

摘要：Simpsons’ Hidden TalentsProblem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah,... 阅读全文

摘要：Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulip... 阅读全文

摘要：Cyclic NacklaceProblem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any sur... 阅读全文

摘要：Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28715 Accepted Submission(s... 阅读全文

摘要：人随着岁数的增长是越大越聪明还是越大越笨，这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考，因为他在很小的时候就知道亲和串如何判断了，但是发现，现在长大了却不知道怎么去判断亲和串了，于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。 亲和串的定义是这样的：给定两个字符串s1... 阅读全文

摘要：某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。 现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。Input本题目包含多组数据，请处... 阅读全文

摘要：There are N (2#include#include#include#define inf 9999999 int e[1100][1100];int book[1100],a[1100];int dis[1100];int isprime[2010000];int Min(int a,in... 阅读全文

摘要：RescueProblem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M #include#include#i... 阅读全文

摘要：胜利大逃亡Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-... 阅读全文

摘要：Catch That CowProblem DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a po... 阅读全文

摘要：A strange liftProblem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 #include#include... 阅读全文

摘要：Knight MovesProblem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour ... 阅读全文

摘要：C Oil DepositsProblem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works w... 阅读全文

摘要：A - Tempter of the Bone Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the ... 阅读全文