New~ 歡迎熱愛編程的"高考少年"報考——"杭州電子科技大學-電腦學院"~Play on WordsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3818 Accepted Submission(s): 1229Problem DescriptionSome of the secret doors contain a
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 30 Accepted Submission(s) : 16Problem DescriptionYou are a butler in a large mansion. This mansion has so many rooms that they are merely
WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5222 Accepted: 2187 Special JudgeDescriptionBessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers
A. Puzzlestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to
Problem DescriptionHow can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT: [i i i i o o o oi o i i o o i o]where i stands for Push and o stands for Pop. Your program
Language:DefaultThe Bad NumberDescriptionJohn and Brus believe that number N is a very bad number. Thus they try to avoid it every time and everywhere.Now the guys would like to represent number M as a sum of positive numbers, each of which not
Revolving DigitsTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1165 Accepted Submission(s): 351Problem DescriptionOne day Silence is interested in revolving the digits of a positive integer.
Ant TripTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 860 Accepted Submission(s): 324Problem DescriptionAnt Country consist of N towns.There are M roads connecting the towns.Ant
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24605 Accepted Submission(s): 9768Problem
John's tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6042 Accepted: 1981 Special JudgeDescriptionLittle Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wanted to visit all his friends, but
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6782 Accepted Submission(s): 3069Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size
MAX Average ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4899 Accepted Submission(s): 1229Problem DescriptionConsider a simple sequence which only contains positive integers as a1,
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 43907 Accepted: 12862Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33152 Accepted: 9641DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at
Ouroboros SnakeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 889 Accepted: 428DescriptionOuroboros is a mythical snake from ancient Egypt. It has its tail in its mouth and continously devours itself. The Ouroboros numbers are binary