In space coordinate, there are two lines.Now you can choose a point from each line.I want to make the distance of the two points the shortest.Now how do you choose the two points? It is promised that there is only one pair of the two points.How easy it is.Solve the problem first,so you can get a fruit.

The first line contains an integer t ( 1 <= t <= 100 ): the number of test cases. Then for each test case:First line contains six numbers x0,y0,z0,x1,y1,z1,where they are the positions of the two points in the first line.Second line contains six numbers x2,y2,z2,x3,y3,z3,where they are the positions of the two points in the second line.

提交代码