我家小破孩儿

摘要： void fun(){ vit[1]=false; vit[2]=true; for(int i=3; i<=M; i++) { if(i%2) vit[i]=true; else vit[i]=false; } for(int i=3; i<=M; i+=2) { if(vit[i]) { for(int j=i*2; j<=M; j+=i) vit[j]=false; } } cat=0; for(int i=2; i<=M; i++) { if(vit[i]) vis[++cat]=i; }} 阅读全文

摘要： IstheNameofThisProblemTime Limit:1000ms,Special Time Limit:2500ms,Memory Limit:32768KBTotal submit users:23,Accepted users:21Problem 11354 :No special judgementProblem descriptionThe philosopher Willard Van Orman Quine (1908–2000) described a novel method of constructing a sentence in order to illus 阅读全文

摘要： JugglefestTime Limit:1000ms,Special Time Limit:2500ms,Memory Limit:32768KBTotal submit users:16,Accepted users:16Problem 11357 :No special judgementProblem descriptionMany people are familiar with a standard 3-ball juggling pattern in which you throw ballA, then ballB, then ballC, then ballA, then b 阅读全文

摘要： Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7269Accepted Submission(s): 2076Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but m 阅读全文

摘要： Lazy Math InstructorA math instructor is too lazy to grade a question in the exam papers in which students are supposed to produce a complicated formula for the question asked. Students may write correct answers in different forms which makes grading very hard. So, the instructor needs help from com 阅读全文

摘要： A strange liftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8989Accepted Submission(s): 3404Problem 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 # include # in 阅读全文

摘要： Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10997Accepted Submission(s): 4209Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of 阅读全文

摘要： find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2759Accepted Submission(s): 1176 Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的 阅读全文

摘要： 1stingTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2444Accepted Submission(s): 979Problem DescriptionYou will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ there. Surly, you may get many di 阅读全文

摘要： PP and QQTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 303Accepted Submission(s): 128Problem DescriptionPP and QQ were playing games at Christmas Eve. They drew some Christmas trees on a paper: Then they took turns to cut a branch of a tree, and 阅读全文