算法爱好者

摘要： Silver Cow PartyTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 9222Accepted: 4156DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way 阅读全文

摘要： Invitation CardsTime Limit: 8000MSMemory Limit: 262144KTotal Submissions: 15101Accepted: 4897DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. T 阅读全文

摘要： 1028: MultiplicationTime Limit: 2 Sec Memory Limit: 128 MBSubmit: 547 Solved: 126[Submit][Status][Web Board]DescriptionIf C=A⋄B, thenC[k]=∑max(i,j)=kA[i]⋅B[j]mod(109+7).Work out sequence C=A⋄B for given sequence A and B.InputThe first line contains a integer n, which denotes the length of sequence.. 阅读全文

摘要： ZOJ Problem Set - 1232Adventure of Super MarioTime Limit: 2 Seconds Memory Limit: 65536 KBAfter rescuing the beautiful princess, Super Mario needs to find a way home -- with the princess of course :-) He's very familiar with the 'Super Mario World', so he doesn't need a map, he only 阅读全文

摘要： P - Commando WarTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11729Appoint description:Description G Commando WarInput: Standard InputOutput: Standard Output “Waiting for orders we held in the wood, word from thefront never cameBy evening the sound of . 阅读全文

摘要： O - Dragon of LoowaterTime Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 11292Appoint description:DescriptionDownload as PDFProblem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The sh... 阅读全文

摘要： Cave RaiderTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 551Accepted: 171DescriptionAfkiyia is a big mountain. Inside the mountain, there are many caves. These caves are connected by tunnels. Hidden in one of the caves is a terrorist leader. Each tunnel connects two caves. There could be 阅读全文

摘要： 最优连通子集Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1940 Accepted: 1018Description众所周知，我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示，如果x, y都是整数，我们就把点P称为整点，否则点P称为非整点。我们把平面上所有整点构成的集合记为W。定义1 两个整点P1(x1, y1), P2(x2, y2)，若|x1-x2| + |y1-y2| = 1，则称P1, P2相邻，记作P1~P2，否则称P1, P2不相邻。定义 2 设点集S... 阅读全文

摘要： ArbitrageTime Limit: 2 Seconds Memory Limit: 65536 KBArbitrage 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, 1 British pound buys 10.0 French fr... 阅读全文

摘要： Transport GoodsTime Limit: 2 Seconds Memory Limit: 65536 KBThe HERO country is attacked by other country. The intruder is attacking the capital so other cities must send supports to the capital. There are some roads between the cities and the goods must be transported along the roads.According ... 阅读全文