Truck Driving#93
Umidsh Izadish is a truck driver who wants to travel from one city to another. There is a direct straight road between every pair of cities in the country. The amount of fuel consumed for a trip equals the distance between two cities, computed by their coordinates. Each city has a gas station, so Umidsh can refuel his truck at any city. Your task is to determine the minimum required fuel tank capacity for Umidsh’s truck.
The first line contains one integer: the number of test cases. The following lines describe each test case. Each test case starts with a line containing one integer (2 \leq C \leq 200) — the number of cities. Then lines follow, each containing two integers and (0 \leq x, y \leq 1000), representing the coordinates of a city. The first city is the starting city, and the second city is the destination.
For each test case, output a single line with one floating-point number — the minimum required fuel tank capacity for Umidsh's truck, printed to three decimal places.
Example 2