摘要： EmergencyTime Limit 3000msMemory Limit 65536KdescriptionKudo’s real name is not Kudo. Her name is Kudryavka Anatolyevna Strugatskia, and Kudo is only her nickname. Now, she is facing an emergency in her hometown: Her mother is developing a new kind of spacecraft. This plan costs enormous energy but 阅读全文

摘要： ClockwiseTime Limit 1000msMemory Limit 65536KdescriptionSaya have a long necklace with N beads, and she signs the beads from 1 to N. Then she fixes them to the wall to show N-1 vectors – vector i starts from bead i and end up with bead i+1. One day, Kudo comes to Saya’s home, and she sees the beads 阅读全文

摘要： Problem DWavio SequenceInput:Standard InputOutput:Standard OutputTime Limit:2 SecondsWavio is a sequence of integers. It has some interesting properties.·Wavio is of odd length i.e.L = 2*n + 1.·The first(n+1)integers of Wavio sequence makes a strictly increasing sequence.·The last(n+1 阅读全文

摘要： Traveling salesmen ofnhn. (the prestigious Korean internet company) report their current location to the company on a regular basis. They also have to report their new location to the company if they are moving to another location. The company keep each salesman's working path on a map of his wo 阅读全文

摘要： Problem H: Partitioning by PalindromesWe say a sequence of characters is apalindromeif it is the same written forwards and backwards. For example, 'racecar' is a palindrome, but 'fastcar' is not.Apartitionof a sequence of characters is a list of one or more disjoint non-empty groups 阅读全文

摘要： Problem DPrince and PrincessInput:Standard InputOutput:Standard OutputTime Limit:3 SecondsIn ann x nchessboard, Prince and Princess plays a game. The squares in the chessboard are numbered1, 2, 3 ... n*n,as shown below:Prince stands in square1, makepjumps and finally reach squaren*n. He enters a squ 阅读全文

摘要： Let's play a stone removing game.Initially,nstones are arranged on a circle and numbered1,...,nclockwise (Figure 1). You are also given two numberskandm. From this state, remove stones one by one following the rules explained below, until only one remains. In step 1, remove stonem. In step 2, lo 阅读全文

摘要： Problem E: VacationThe ProblemYou are planning to take some rest and to go out on vacation, but you really don't know which cities you should visit. So, you ask your parents for help. Your mother says"My son, you MUST visit Paris, Madrid, Lisboa and London. But it's only fun in this ord 阅读全文

摘要： Question 1: Is Bigger Smarter?The ProblemSome people think that the bigger an elephant is, the smarter it is. To disprove this, you want to take the data on a collection of elephants and put as large a subset of this data as possible into a sequence so that the weights are increasing, but the IQ' 阅读全文

摘要： Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4581Accepted Submission(s): 1656Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the rig 阅读全文