摘要：No Pain No GameTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17Accepted Submission(s): 5Problem DescriptionLife is a game,and you lose it,so you suicide.But you can not kill yourself before you solve this problem:Given you a sequence of number a1
阅读全文
摘要：Sad Love StoryTime Limit: 40000/20000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 16Accepted Submission(s): 2Problem DescriptionThere's a really sad story.It could be about love or about money.But love will vanish and money will be corroded.These points will la
阅读全文
摘要：Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1437Accepted Submission(s): 690Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble a
阅读全文
摘要：Minimum SumTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2235Accepted Submission(s): 512Problem DescriptionYou are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a
阅读全文
摘要：Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 2154Accepted Submission(s): 662Problem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sun
阅读全文
摘要：National TreasuresTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 871Accepted Submission(s): 291Problem DescriptionThe great hall of the national museum has been robbed few times recently. Everyone is now worried about the security of the treasures
阅读全文
摘要：LightningTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1099Accepted Submission(s): 363Problem DescriptionThere are N robots standing on the ground (Don't know why. Don't know how).Suddenly the sky turns into gray, and lightning storm come
阅读全文
摘要：Jimmy’s AssignmentTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 464Accepted Submission(s): 224Problem DescriptionJimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maximum matching in a special
阅读全文
摘要：Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1247Accepted Submission(s): 542Special JudgeProblem DescriptionYour old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been
阅读全文
摘要：Daizhenyang's CoinTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 183Accepted Submission(s): 83Problem DescriptionWe know that Daizhenyang is chasing a girlfriend. As we all know, whenever you chase a beautiful girl, there'll always be an o
阅读全文
摘要：GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 214Accepted Submission(s): 150Problem Descript...
阅读全文
摘要：Nim or not Nim?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 613Accepted Submission(s): 282Problem DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player
阅读全文
摘要：Occupy CitiesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 509Accepted Submission(s): 125Problem DescriptionThe Star Wars is coming to an end as the Apple Planet is beaten by the Banana Planet. Captain Chen, the glorious leader of the Army of Ba
阅读全文
摘要：邂逅明下Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1432Accepted Submission(s): 670Problem Description当日遇到月，于是有了明。当我遇到了你，便成了侣。那天，日月相会，我见到了你。而且，大地失去了光辉，你我是否成侣？这注定是个凄美的故事。（以上是废话）小t和所有世俗的人们一样，期待那百年难遇的日食。驻足街头看天，看日月渐渐走近，小t的脖子那个酸呀（他坚持这个姿势已经有半个多小时啦）。他低下仰起
阅读全文
摘要：Palindrome Sub-ArrayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 173Accepted Submission(s): 80Problem Description A palindrome sequence is a sequence which is as same as its reversed order. For example, 1 2 3 2 1 is a palindrome sequence, but 1.
阅读全文
摘要：WeaponTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 22Accepted Submission(s): 18Problem Description Doctor D. are researching for a horrific weapon. The muzzle of the weapon is a circle. When it fires, rays form a cylinder that runs through the .
阅读全文
摘要：Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 90Accepted Submission(s): 12Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel between any two planet
阅读全文
摘要：Warm up 2Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 28Accepted Submission(s): 8Problem Description Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in the
阅读全文
摘要：Vases and FlowersTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 38Accepted Submission(s): 10Problem Description Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers,.
阅读全文
摘要：Balls RearrangementTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 25Accepted Submission(s): 8Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily, he pu.
阅读全文
