Online Programming Server
Contest 1001: BISTU 20110904 In-school contest - Problem 1062: A MST Problem
| Problem ID | 1062 |
|---|---|
| Title | 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 .
|
| 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 | |
| Last Modified | 2012-06-11 17:23:03 |
| Time Limit | 1 seconds |
| Memory Limit | 32 MB |
| Accepted Solutions | 4 |
| Submitted Solutions | 7 |
| Difficulty Factor | 22 |
Facebook