摘要：
Currency ExchangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:15324Accepted:5275DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can 阅读全文
摘要：
WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:23270Accepted:8301DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE 阅读全文
摘要：
Median Weight BeadTime Limit:1000MSMemory Limit:30000KTotal Submissions:2494Accepted:1249DescriptionThere are N beads which of the same shape and size, but with different weights. N is an odd number and the beads are labeled as 1, 2, ..., N. Your task is to find the bead whose weight is median (the 阅读全文
摘要：
ArbitrageTime Limit:1000MSMemory Limit:65536KTotal Submissions:12287Accepted:5168DescriptionArbitrage 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, 阅读全文
摘要：
FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:19928Accepted:6464DescriptionFreddy 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 阅读全文
摘要：
106 miles to ChicagoTime Limit:2000MSMemory Limit:65536KTotal Submissions:3305Accepted:1557Special JudgeDescriptionIn the movie "Blues Brothers", the orphanage where Elwood and Jack were raised may be sold to the Board of Education if they do not pay 5000 dollars in taxes at the Cook Count 阅读全文
摘要：
MPI MaelstromTime Limit:1000MSMemory Limit:10000KTotal Submissions:3896Accepted:2330DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advis 阅读全文
摘要：
Is It A Tree?Time Limit:1000MSMemory Limit:10000KTotal Submissions:17523Accepted:6005DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is exa 阅读全文
摘要：
Stars in Your WindowTime Limit:1000MSMemory Limit:65536KTotal Submissions:8175Accepted:2246DescriptionFleeting time does not blur my memory of you. Can it really be 4 years since I first saw you? I still remember, vividly, on the beautiful Zhuhai Campus, 4 years ago, from the moment I saw you smile, 阅读全文
摘要：
Sequence operationTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4357Accepted Submission(s): 1256Problem Descriptionlxhgww got a sequence contains n characters which are all '0's or '1's.We have five operations here:Change operati 阅读全文