我家小破孩儿

摘要： RemainderTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2251Accepted Submission(s): 477Problem DescriptionCoco is a clever boy, who is good at mathematics. However, he is puzzled by a difficult mathematics problem. The problem is: Given three inte 阅读全文

摘要： How many waysTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1983Accepted Submission(s): 1213Problem Description这是一个简单的生存游戏，你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下：1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走，并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一 阅读全文

摘要： Oil DepositsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8264Accepted Submission(s): 4850Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangul 阅读全文

摘要： The Proper KeyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 164Accepted Submission(s): 41Problem DescriptionMany people think that Tetris was invented by two Russian programmers. But that is not the whole truth. The idea of the game is very old - 阅读全文

摘要： 1.对于代码中i-next[i]代表了字符串最小前缀且满足能不断的复制得到原字符串；len%(i-next[i])==0时代表字符串刚刚是子串的整数倍；若len%(i-next[i])==0匹配时每一次移动的距离i-next[i]是相等的，若不等则只有最后一次不等；2.len =strlen(s);next[len]代表匹配度最大的前缀或后缀。3.详细分析一下：【就用上面的第一个例子说明吧】(poj2752)求出next值：[非修正]下标： 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17串： a b a b c a b a b a b ... 阅读全文

摘要： 胜利大逃亡Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21700Accepted Submission(s): 8520Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟 阅读全文

摘要： Open the LockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3020Accepted Submission(s): 1327Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. E 阅读全文

摘要： JosephTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1313Accepted Submission(s): 808Problem DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . 阅读全文

摘要： Children’s QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8780Accepted Submission(s): 2789 Problem DescriptionThere are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He pres 阅读全文

摘要： Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 53114Accepted Submission(s): 14284 Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake 阅读全文