摘要： Round NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6051Accepted: 2050DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host of other name 阅读全文

摘要： Wine Trading in GergoviaTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2765Accepted: 1245DescriptionAs you may know from the comic “Asterix and the Chieftain’s Shield”, Gergovia consists of one street, and every inhabitant of the city is a wine salesman. You wonder how this economy works? 阅读全文

摘要： Minimum CostTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 10978Accepted: 3692DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (ma 阅读全文

摘要： Going HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13994Accepted: 7167DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to p 阅读全文

摘要： A Plug for UNIXTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11636Accepted: 3834DescriptionYou are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow of information and 阅读全文

摘要： DiningTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6586Accepted: 3015DescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against 阅读全文

摘要： ACM Computer FactoryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4077Accepted: 1366Special JudgeDescriptionAs you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at the 阅读全文

摘要： Power NetworkTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 18309Accepted: 9643DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 阅读全文

摘要： Treasure ExplorationTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 5480Accepted: 2154DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would neve 阅读全文

摘要： Guardian of DecencyTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 4071Accepted: 1702DescriptionFrank N. Stein is a very conservative high-sc... 阅读全文