两个吃奶一个添下面视频_人妻第一页香蕉网_欧美xxxx少妇_妺妺窝人体色www婷婷

Dotcpp  >  編程題庫  >  A MST Problem
題目 1376:

A MST Problem

時間限制: 2s 內(nèi)存限制: 96MB 提交: 113 解決: 5

題目描述

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

提示

零基礎(chǔ)同學(xué)可以先學(xué)習(xí)視頻課程,包含C/C++、Python、百練、藍(lán)橋杯輔導(dǎo)、算法數(shù)據(jù)結(jié)構(gòu)等課程,提供視頻講解以及配套習(xí)題,還有老師答疑,點擊這里了解課程詳情
標(biāo)簽