本站作为LDUOnlineJudge的测试版本进行演示,官方网站请访问http://icpc.ldu.edu.cn
[Hidden]

1060. A MST Problem


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 .

Samples

Input Copy
2
2
1 1 0
2 2 0
3
1 2 3
0 0 0
1 1 1
Output
1.41
3.97

Source

20100831湖工大校赛
Problem Information

Time Limit: 1000MS (C/C++,Others×2)
Memory Limit: 32MB (C/C++,Others×2)
Special Judge: No
AC/Submit: 1 / 1
Tags:
My history solutions

You didn't submit any solution!
Submit your solution

Login Register