|
||||||||||
TetrahedroidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 159 Accepted Submission(s): 31 Problem Description You are given a tetrahedroid and a point P outside it. How many faces can be seen from P? A face can be seen form P means that if you connect P and any point in this face (exclude the boundary) with a line segment, the line segment does not intersect with other faces of the tetrahedroid. Input The input contains multiple test cases. The first line contains a number T describing the number of test cases. For each test case: The first 4 lines describe the tetrahedroid in the format below: Ax, Ay, Az Bx, By, Bz Cx, Cy, Cz Dx, Dy, Dz After that comes 1 line describing the point P in the format below: Px, Py, Pz Output For each test case, output one line containing a integer representing the number of faces can be seen from P. Sample Input
Sample Output
Source | ||||||||||
|