

3D Convex HullTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2030 Accepted Submission(s): 1071 Problem Description There are N points in 3Dspace which make up a 3DConvex hull*. How many faces does the 3Dconvexhull have? It is guaranteed that all the points are not in the same plane. In case you don¡¯t know the definition of convex hull, here we give you a clarification from Wikipedia: *Convex hull: In mathematics, the convex hull, for a set of points X in a real vector space V, is the minimal convex set containing X. Input There are several test cases. In each case the first line contains an integer N indicates the number of 3Dpoints (3< N <= 300), and then N lines follow, each line contains three numbers x, y, z (between 10000 and 10000) indicate the 3dposition of a point. Output Output the number of faces of the 3DConvex hull. Sample Input
Sample Output
Source  
