摘要：
Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the mor... 阅读全文
摘要：
Description Freddy 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 ... 阅读全文
摘要：
Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man w... 阅读全文
摘要：
Description One 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 ≤ ... 阅读全文
摘要：
Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and p... 阅读全文
摘要：
Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a o... 阅读全文
摘要：
Description BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hie... 阅读全文
摘要：
Description N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better tha... 阅读全文
摘要：
Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the sam... 阅读全文
摘要：
Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They wa... 阅读全文
摘要：
Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class... 阅读全文
摘要：
Description You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day... 阅读全文
摘要：
Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switc... 阅读全文
摘要：
Description Dhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoi... 阅读全文
摘要：
Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algor... 阅读全文
摘要：
Description Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take place between city A and B. Starv... 阅读全文
摘要：
Description Given a n*n matrix C ij (1k 边权为第一行第k个的值，然后求1->n的最短路就好。。。。。。 不过这里还有一种特殊情况，就是1和其他形成一个环，N和其他形成一个环。所以答案就是两个环的和，和最短路中小的那一个。。。代码如下：#include ... 阅读全文
摘要：
Description Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 #include #include #include #include #... 阅读全文
摘要：
最短路的话，就是求一个点到其他点的最短的距离。。。 然后算法的话，有 Dijkstra，Bellman-Ford，SPFA等等，还有Floyd。 然后常用的话就是Dijkstra(优先队列优化)以及SPFA了。。。 可以看下面这篇文章： http://blog.csdn.net/zhon... 阅读全文
摘要：
Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家 拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水... 阅读全文