Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Box walking
Description You are given a three-dimensional box of integral dimensions l × _{y}l The edges of the box are axis-aligned, and one corner of the box is located at position (0, 0, 0). Given the coordinates (_{z}x, y, z) of some arbitrary position on the surface of the box, your goal is to return the square of the length of the shortest path along the box’s surface from (0, 0, 0) to (x, y, z).If l = 2, and _{y}l = 1, then the shortest path from (0, 0, 0) to (1, 2, 1) is found by walking from (0, 0, 0) to (1, 1, 0), followed by walking from (1, 1, 0) to (1, 2, 1). The total path length is √8._{z}Input The input test file will contain multiple test cases, each of which consists of six integers l, _{y}l, _{z}x, y, z where 1 ≤ l, _{x}l, _{y}l ≤ 1000. Note that the box may have zero volume, but the point (_{z}x, y, z) is always guaranteed to be on one of the six sides of the box. The end-of-file is marked by a test case with l = _{x}l = _{y}l = _{z}x = y = z = 0 and should not be processed.Output For each test case, write a single line with a positive integer indicating the square of the shortest path length. (Note: The square of the path length is Sample Input 1 1 2 1 1 2 1 1 1 1 1 1 0 0 0 0 0 0 Sample Output 8 5 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator