算法爱好者

摘要： Bus PassTime Limit: 5 Seconds Memory Limit: 32768 KBYou travel a lot by bus and the costs of all the seperate tickets are starting to add up.Therefore you want to see if it might be advantageous for you to buy a bus pass.The way the bus system works in your country (and also in the Netherlands) i... 阅读全文

摘要： Red and BlackTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only o 阅读全文

摘要： Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KBHart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is given n*n squares. Each square is divided into four triangles marked four numbers (range from 0 to 9). In a square, t... 阅读全文

摘要： Oil DepositsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9776Accepted: 5356DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the 阅读全文

摘要： Frogs' NeighborhoodTime Limit: 5000MSMemory Limit: 10000KTotal Submissions: 4928Accepted: 2169Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名湖)，每个湖泊Li里住着一只青蛙Fi(1 ≤ i ≤ N)。如果湖泊Li和Lj之间有水路相连，则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1, x2, ..., xn，请你给出每两个湖泊之间的相连关系。Input第一行是测试数据的组数T(0 ≤ T ≤ 20)。每组数据包括 阅读全文

摘要： LCM SumTime Limit: 5000 ms Case Time Limit: 5000 ms Memory Limit: 262144 KBSubmit: 4 Accepted: 0 This problem will be judged on SPOJ. Original ID: LCMSUM.[Prev][Next]DescriptionGiven n, calculate the sum LCM(1,n) + LCM(2,n) + .. + LCM(n,n), where LCM(i,n) denotes the Least Common Multiple of the ... 阅读全文

摘要： 249. Matrixtime limit per test: 1 sec.memory limit per test: 65536 KBinput: standardoutput: standardIt is necessary to arrange numbers from 0 to 2^(N+M)-1 in the matrix with 2^N rows and 2^M columns. Moreover, numbers occupying two adjacent cells must differ only in single bit in binary notation. Ce 阅读全文

摘要： Level upTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2381Accepted Submission(s): 648Problem DescriptionLevel up is the task of all online games. It's very boooooooooring. There is only level up in those games, except level up.In a online ga 阅读全文

摘要： Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 823Accepted Submission(s): 451Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble ag 阅读全文

摘要： Kth numberTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2354Accepted Submission(s): 800Problem DescriptionGive you a sequence and ask you the kth big number of a inteval.InputThe first line is the number of the test cases. For each test case, th 阅读全文