UVa 10245 - The Closest Pair Problem

10245 Closest Pair Problem
http://online-judge.uva.es/p/v102/10245.html

Summary
Simple Computational Geometry Problem.

You can use the line-sweep or the divide-and-conquer Closest Pair algorithm to solve.

Hints

 * Notice that each digit has five block/part.
 * Make sure your output doesn't have any trailing spaces or extra newlines

Input
1 0123456789 2 0123456789 3 0123456789 0 0

Output
INFINITY 36.2215

Solutions
C++ Divide-and-Conquer: http://www.lukejduncan.com/2009/11/uva-10245---the-closest-pair-problem.php