算法爱好者

摘要： Problem F Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 332Accepted Submission(s): 143 Problem DescriptionAs is known to all, the blooming time and duration varies between different kinds of flowers. Now there is a garden planted full of flower 阅读全文

摘要： Quoit DesignTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15345Accepted Submission(s): 3814Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled a 阅读全文

摘要： Tick and TickTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5214Accepted Submission(s): 1402Problem DescriptionThe three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and e 阅读全文

摘要： A. Homeworktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce when Gerald studied in the first year at school, his teacher gave the class the following homework. She offered the students a string consisting of n small Latin letters; the task wa 阅读全文

摘要： Perfect Pth PowersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 14512Accepted: 3263DescriptionWe say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a perfect cube if, for some integer b, x = b3. More generally, x is a perfect pth power if, for some integer b, x 阅读全文

摘要： Prime PathTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7574Accepted: 4302DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter of securit 阅读全文

摘要： ZOJ Problem Set - 1879Jolly JumpersTime Limit: 2 Seconds Memory Limit: 65536 KBA sequence of n > 0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 1 through n-1. For instance,1 4 2 3is a jolly jumper, because the absolu 阅读全文

摘要： 取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1304Accepted Submission(s): 732Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2<=n& 阅读全文

摘要： Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3987Accepted Submission(s): 2053Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, an 阅读全文

摘要： 1006 - Hex-a-bonacci PDF (English) Statistics Forum Time Limit: 0.5 second(s)Memory Limit: 32 MBGiven a code (not optimized), and necessary inputs, you have to find the output of the code for the inputs. The code is as follows:inta,b,c,d,e,f;intfn(intn){if(n==0)returna;if(n==1)returnb;if(n==2)retu.. 阅读全文