Problem 1081. -- Moonmist

1081: Moonmist

Time Limit: 10 Sec  Memory Limit: 128 MB   64bit IO Format: %lld
Submitted: 6  Accepted: 5
[Submit][Status][Web Board]


An Unidentified Flying Object (Commonly abbreviated as UFO) is the popular term for any aerial phenomenon whose cause cannot be easily or immediately identified. We always believe UFO is the vehicle of aliens. But there is an interrogation about why UFO always likes a circular saucer? There must be a reason. Actually our scientists are developing a new traffic system “Moonmist”. It is distinguished from the traditional traffic. We use circular saucers in this new traffic system and the saucers moves extremely fast. When our scientists did their test, they found that traffic accident was too hard to be avoided because of the high speed of the advanced saucer. They need us to develop a system that can tell them the nearest saucer. The distance between two saucers is defined as the shortest distance between any two points in different saucers.


The first line consists of an integer T, indicating the number of test cases.
The first line of each case consists of an integer N, indicating the number of saucers. Each saucer is represented on a single line, consisting of three integers X, Y, R, indicating the coordinate and the radius. You can assume that the distance between any two saucers will never be zero.


For each test case, please output a floating number with six fractional numbers, indicating the shortest distance.
0 < T <= 10
2 <= N <= 50000
0 <= X, Y, R <= 100000

Sample Input

0 0 1
10 10 1

Sample Output



[Submit][Status][Web Board]