A MST Problem

A MST Problem

时间： 1ms        内存：32M

描述：

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

输入：

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.

输出：

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

示例输入：

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

示例输出：

1.41
3.97

提示：

参考答案：

解锁文章

没有看到答案？微信扫描二维码可免费解锁文章

使用微信扫描二维码打开广告页面后可以立即关闭，再刷新此页面即可正常浏览此文章

所跳转广告均由第三方提供，并不代表本站观点！

已经扫描此二维码？点此立即跳转

文章解锁成功，即将自动跳转，点此立即跳转