UVa 216 - Getting in Line

216 - Getting in Line

 * http://acm.uva.es/p/v2/216.html

Summary
This is the standard Traveling Salesperson Problem, without going back home. Since n is at most 8, we can simply enumerate all the possibilities by exhaustive search without resorting to dynamic programming.

Explanation
Standard exhaustive search techniques should suffice.

Gotcha's

 * Rounding errors.

Input
Input Here

Output
Output Here