摘要： C - Count The Carries时间限制:3000 Ms内存限制:65535 Kb问题描述One day, Implus gets interested in binary addition and binary carry. He will transfer all decimal digits to binary digits to make the addition. Not as clever as Gauss, to make the addition from a to b, he will add them one by one from a to b in order 阅读全文

摘要： A - Play the Dice时间限制:2000 MS内存限制:65535 MB问题描述There is a dice withN sides, which are numbered from 1,2,...,n and have the equal possibility to show up when one rolls a dice. Each side has an integer Aion it. Now here is a game that you can roll this dice once, if the i-th side is up, you will getAiy 阅读全文

摘要： 南京邀请赛算是我第一次参加的邀请赛吧（以前只参加了区域赛）。这次比赛根据教练的安排是和两个大二的小朋友组队，感觉还是蛮好的，可以带着学弟学妹出去训练，但是压力也确实蛮大的，所以比赛前一个月花了很多的时间去准备，找比赛的感觉。这次根据铎铎妹的建议，取了队名AC_lions，感觉还是很不错的，也是给铎铎做广告吧~~ 因为这次去的南京比较近，而且我们学校去三个队，所以行程还是比较紧的，11号早上7:00坐高铁去南京，12号晚上8点回来。11号早早就起来去火车站了，然后坐高铁去了南京，之后坐地铁到了南京理工大学，找到了志愿者，然后去住的宾馆，竟然还没有房间，叫我们12点以后回来。然后就先去南京理工.. 阅读全文

摘要： LawrenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1523Accepted Submission(s): 671Problem DescriptionT. E. Lawrence was a controversial figure during World War I. He was a British officer who served in the Arabian theater and led a group of Ar 阅读全文

摘要： Cut the SequenceTime Limit:2000MSMemory Limit:131072KTotal Submissions:7972Accepted:2287DescriptionGiven an integer sequence {an} of lengthN, you are to cut the sequence into several parts every one of which is a consecutive subsequence of the original sequence. Every part must satisfy that the sum 阅读全文

摘要： SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3266Accepted Submission(s): 1063Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference betwe 阅读全文

摘要： Nim or not Nim?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 540Accepted Submission(s): 246Problem DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player 阅读全文

摘要： Euclid's GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1116Accepted Submission(s): 516Problem DescriptionTwo players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the 阅读全文

摘要： Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1514Accepted Submission(s): 427Problem DescriptionDo not sincere non-interference。Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae 阅读全文

摘要： Marriage Match IIITime Limit: 10000/4000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 771Accepted Submission(s): 236Problem DescriptionPresumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the ever game of pl 阅读全文