随笔分类 -  ACM（HOJ）题目解题报告

摘要：Assign the taskTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 636Accepted Submission(s): 322Problem DescriptionThere is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader 阅读全文

摘要：Gems Fight!Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 114Accepted Submission(s): 46Problem Description Alice and Bob are playing "Gems Fight!": There are Gems of G different colors , packed in B bags. Each bag has several Gems. G 阅读全文

摘要：Rabbit KingdomTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40Accepted Submission(s): 20Problem Description Long long ago, there was an ancient rabbit kingdom in the forest. Every rabbit in this kingdom was not cute but totally pugnacious, so th. 阅读全文

摘要：Zhuge Liang's PasswordTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 59Accepted Submission(s): 47Problem Description In the ancient three kingdom period, Zhuge Liang was the most famous and smart military leader. His enemy was Sima Yi, the mil 阅读全文

摘要：Stealing Harry Potter's PreciousTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 126Accepted Submission(s): 63Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in h 阅读全文

摘要：Lights Against DudelyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 171Accepted Submission(s): 53Problem DescriptionHarry: "But Hagrid. How am I going to pay for all of this? I haven't any money."Hagrid: "Well there's your m 阅读全文

摘要：Bob’s RaceTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1994Accepted Submission(s): 619Problem DescriptionBob wants to hold a race to encourage people to do sports. He has got trouble in choosing the route. There are N houses and N - 1 roads in h 阅读全文

摘要：Alice's mooncake shopTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2596Accepted Submission(s): 619Problem DescriptionThe Mid-Autumn Festival, also known as the Moon Festival or Zhongqiu Festival is a popular harvest festival celebrated by Chi 阅读全文

摘要：LooploopTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 781Accepted Submission(s): 220Problem DescriptionXXX gets a new toy named Looploop. The toy has N elements arranged in a loop, an arrow pointing to one of the elements, and two preset paramete 阅读全文

摘要：str2intTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 841Accepted Submission(s): 297Problem DescriptionIn this problem, you are given several strings that contain only digits from '0' to '9', inclusive.An example is shown below.1 阅读全文

摘要：Function CurveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 203Accepted Submission(s): 67Problem DescriptionGiven sequences of k1, k2, … kn, a1, a2, …, anand b1, b2, …, bn. Consider following function:Then we draw F(x) on a xy-plane, the value of 阅读全文

摘要：Simple FunctionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 111Accepted Submission(s): 31Problem DescriptionKnowing that x can be any real number that x2+ Dx + E ≠ 0. Now, given the following function:What is the range of y?InputThe first line c 阅读全文

摘要：Theme SectionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 271Accepted Submission(s): 121Problem DescriptionIt's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their repr 阅读全文

摘要：StoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 179Accepted Submission(s): 137Problem DescriptionTang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Jiang will alternatively 阅读全文

摘要：Cut the CakeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 300Accepted Submission(s): 135Problem DescriptionMMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawb 阅读全文

摘要：Poker ShuffleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 95Accepted Submission(s): 24Problem DescriptionJason is not only an ACMer, but also a poker nerd. He is able to do a perfect shuffle. In a perfect shuffle, the deck containing K cards, wh 阅读全文

摘要：FlyerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 386Accepted Submission(s): 127Problem DescriptionThe new semester begins! Different kinds of student societies are all trying to advertise themselves, by giving flyers to the students for introdu 阅读全文

摘要：Divide GroupsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 423Accepted Submission(s): 161Problem DescriptionThis year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus bac 阅读全文

摘要：Count The PairsTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 277Accepted Submission(s): 150Problem DescriptionWith the 60th anniversary celebration of Nanjing University of Science and Technology coming soon, the university sets n tourist spots 阅读全文

摘要：Walk Through SquaresTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 200Accepted Submission(s): 57Problem DescriptionOn the beaming day of 60th anniversary of NJUST, as a military college which was Second Artillery Academy of Harbin Military Enginee 阅读全文