UVa 10803 - Thunder Mountain

10803 - Thunder Mountain

 * http://acm.uva.es/p/v108/10803.html

Summary
Given points in the plane, construct a graph following the rules, and find the longest of the all-pairs shortest path. If it not connected, then print "Send Kurdy".

Explanation
Use an All-Pairs Shortest Path algorithm, and go through each possible connections, find the max of the shortest paths. If the graph is disconnected, print "Send Kurdy". Remember to use integers when possible.

Input
2 5 0 0 10 0 10 10 13 10 13 14 2 0 0 10 1

Output
Case #1: 25.0000

Case #2: Send Kurdy