2009 World Finals hosted by KTH CPC 2009 以acm International Collegiate Programming Contest 工EMmm Problem c The return of carl Input file: carl. in Carl the ant is back! When we last left him(Problem A, 2004 World Finals), Carl was a little mixed-up, always taking strange, zigzag paths when traveling. But now, Carl has straightened out his life- literally. He now al ways takes the straightest, shortest path between any pair of points. This sounds simple, except for one small thing: Carl now spends most of his time on a paperweight in the shape of a regular octahedron. You may recall that an octahedron is one of the five Platonic solids and consists of eight equilateral triangles, as shown in Figure 3: Regular octahedron Carl has an innate(some say in-ant)ability to always take the shortest path when going from any starting point to any destination point on the paperweight. Your job is to verify this by determining the length of the shortest path when given two such points, not necessarily distinct. Input The input contains multiple test cases. Each test case consists of four integers 01, 91, 02 and o2, where 0 s0i<360 and0 soi s 180. The first two are the spherical coordinates of the start point, and the last two the spherical coordinates of the destination point. As shown in Figure 3, 0, is the azimuth and i is the zenith angle, both of them given in degrees The input is terminated by a line containing four negative ones The paperweight is fixed for all test cases as follows: the octahedron is centered on the origin and each vertex any supporting mechanisms that may be necessary to hold the paperweight in the correct posie ero and ignore lies on one of the axes. Every edge is exactly 10 cm long. You should suppose that Carls size is zeProblem C The Return of Carl Input file: carl.in Carl the ant is back! When we last left him (Problem A, 2004 World Finals), Carl was a little mixed-up, always taking strange, zigzag paths when traveling. But now, Carl has straightened out his life – literally. He now always takes the straightest, shortest path between any pair of points. This sounds simple, except for one small thing: Carl now spends most of his time on a paperweight in the shape of a regular octahedron. You may recall that an octahedron is one of the five Platonic solids and consists of eight equilateral triangles, as shown in Figure 3. Figure 3: Regular octahedron Carl has an innate (some say in-ant) ability to always take the shortest path when going from any starting point to any destination point on the paperweight. Your job is to verify this by determining the length of the shortest path when given two such points, not necessarily distinct. Input The input contains multiple test cases. Each test case consists of four integers θ1, φ1, θ2 and φ2, where 0 ≤ θi < 360 and 0 ≤ φi ≤ 180. The first two are the spherical coordinates of the start point, and the last two are the spherical coordinates of the destination point. As shown in Figure 3, θi is the azimuth and φi is the zenith angle, both of them given in degrees. The input is terminated by a line containing four negative ones. The paperweight is fixed for all test cases as follows: the octahedron is centered on the origin and each vertex lies on one of the axes. Every edge is exactly 10 cm long. You should suppose that Carl’s size is zero and ignore any supporting mechanisms that may be necessary to hold the paperweight in the correct position