摘要：
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21703Accepted Submission(s): 9682Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of nu 阅读全文
摘要：
Quoit DesignTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25335Accepted Submission(s): 6716Problem 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 阅读全文
摘要：
Dating with girls(1)Time Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2127Accepted Submission(s): 730Problem DescriptionEveryone in the HDU knows that the number of boys is larger than the number of girls. But now, every boy wants to date with pretty 阅读全文
摘要：
Schedule ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1085Accepted Submission(s): 448Special JudgeProblem DescriptionA project can be divided into several parts. Each part should be completed continuously. This means if a part should take 阅读全文
摘要：
IntervalsTime Limit:10 Seconds Memory Limit:32768 KBYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:> reads the number of intervals, their endpoints and integers c1, ..., cn from the standard input,> computes the minimal size of a set Z of int 阅读全文
摘要：
Probability OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 379Accepted Submission(s): 293Problem DescriptionNumber guessing is a popular game between elementary-school kids. Teachers encourage pupils to play the game as it enhances their arithm 阅读全文
摘要：
Invitation CardsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1588Accepted Submission(s): 714Problem DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They 阅读全文
摘要：
XYZZYTime Limit:1000MSMemory Limit:30000KTotal Submissions:3105Accepted:887DescriptionThe prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expanded into a puzzle-oriented game by Don Woods at S 阅读全文
摘要：
ArbitrageTime Limit:1000MSMemory Limit:65536KTotal Submissions:13800Accepted:5815DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 阅读全文
摘要：
Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:24372Accepted:13408DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the st 阅读全文
摘要：
FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:22557Accepted:7339DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen 阅读全文
摘要：
昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:33365Accepted:9500Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。"探险家就跑到大祭司那里，向他要求皮袄或水晶球，大祭司要他用金币来换，或者替他弄来其他的东西，他可 阅读全文
摘要：
转自：http://www.hnyzsz.net/Article/ShowArticle.asp?ArticleID=735【石子合并】 在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。 试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。【输入文件】包含两行，第1 行是正整数n（1n then t←(i+k) mod n else t←i+k {最后一个连第一个的情况处理} s[i,j]←最优{s[i,k]+s[t,j-k]+sum[1,3]} {sum[i,j]表示从i开始数 阅读全文
摘要：
Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2118Accepted Submission(s): 580Problem DescriptionThe final battle is coming. Now Harry Potter is located at city 1, and Voldemort is located at city n. To make the wo 阅读全文
摘要：
FlightTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2014Accepted Submission(s): 428Problem DescriptionRecently, Shua Shua had a big quarrel with his GF. He is so upset that he decides to take a trip to some other city to avoid meeting her. He w 阅读全文