OJ系统新功能测试中,如有问题请联系 15864441230 17853533775 15684102985 17853533719 尽量不要在上课时间打电话

Problem 1012. -- A MST Problem

1012: A MST Problem

Time Limit: 1 Sec  Memory Limit: 32 MB
Submit: 14  Solved: 10
[Submit][Status][Web Board]

Description

It is just a mining spanning tree ( 最小生成树 ) problem, what makes you a little difficult is that you are in a 3D space.

Input

The first line of the input contains the number of test cases in the file. And t he first line of each case
contains one integer numbers n(0<n<30) specifying the number of the point . The n next n line s, each line
contain s Three Integer Numbers xi,yi and zi, indicating the position of point i.

Output

For each test case, output a line with the answer, which should accurately rounded to two decimals .

Sample Input

2
2
1 1 0
2 2 0
3
1 2 3
0 0 0
1 1 1

Sample Output

1.41
3.97

HINT

Source

[Submit][Status][Web Board]