懒鬼的私人泳池

Subway Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7504 Accepted: 2440 DescriptionYou have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of get

Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions: 26380 Accepted: 7238 DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the

Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18350 Accepted: 7772 DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one uni

昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 41711 Accepted: 12188 Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低

Extended Traffic Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu SubmitStatusPracticeLightOJ 1074 Description Dhaka city is getting crowded and noisy day by day. Certain

The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4297 Accepted Submission(s): 999Problem Description This is a

0 or 1Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1701 Accepted Submission(s): 479Problem Description Given a n x n matrix Cij (1<=i,j<

Description 农夫约翰正驾驶一条小艇在牛勒比海上航行． 海上有N(1≤N≤100)个岛屿，用1到N编号．约翰从1号小岛出发，最后到达N号小岛．一 张藏宝图上说，如果他的路程上经过的小岛依次出现了Ai，A2，…，AM(2≤M≤10000)这样的序列（不一定相邻），那他最终就能找到古老的宝藏． 但是，由于牛勒比海有海盗出没．约翰知道任意两个岛屿之间的航线上海盗出没的概率

DescriptionFJ的N(1 <= N <= 100)头奶牛们最近参加了场程序设计竞赛:)。在赛场上，奶牛们按1..N依次编号。每头奶牛的编程能力不尽相同，并且没有哪两头奶牛的水平不相上下，也就是说，奶牛们的编程能力有明确的排名。 整个比赛被分成了若干轮，每一轮是两头指定编号的奶牛的对决。如果编号为A的奶牛的编程能力强于编号为B的奶牛(1 <= A <= N; 1 <= B <= N; A !

Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8605 Accepted: 4834 DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming co

MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7182 Accepted: 4375 DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Ody

Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 37628 Accepted: 13850 DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormh

Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 22675 Accepted: 7424 DescriptionIn the age of television, not many people attend theater performances. Antiqu

Tram Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 12338 Accepted: 4497 DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of

Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 25357 Accepted: 6717 DescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargolifter p

Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 31345 Accepted: 10104 DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona F

Dijkstra算法（Dijkstra’s Algorithm）图论中一种求单源最短路径的算法。

Currency Exchange Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 23595 Accepted: 8542 DescriptionSeveral currency exchange points are working in our city. Let us suppose that

Til the Cows Come Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36731 Accepted: 12512 DescriptionBessie is out in the field and wants to get back to the barn to get as

Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 15897 Accepted: 7238 DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is goin

DescriptionFarmer John打算将电话线引到自己的农场，但电信公司并不打算为他提供免费服务。于是，FJ必须为此向电信公司支付一定的费用。 FJ的农场周围分布着N(1 <= N <= 1,000)根按1..N顺次编号的废弃的电话线杆，任意两根电话线杆间都没有电话线相连。一共P(1 <= P <= 10,000)对电话线杆间可以拉电话线，其余的那些由于隔得太远而无法被连接。 第i对电话线