|
||||||||||
Decrypt coordinateTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 959 Accepted Submission(s): 428 Problem Description For national security, the coordinate systems of public map service are all in an encryption system. This means that when you got the latitude and longitude coordinates from a GPS device, you cannot finger out the real place at a public map with that coordinates. We know an encryption system, which works as: x1 = x ¨C sqrt(y) y1 = y ¨C sqrt(x) Now, we got some coordinates of POIs (point of interest, http://en.wikipedia.org/wiki/Point_of_interest, which you can just think as some points) But even we have that formulations of how to encrypt coordinates, still we cannot decrypt any POI coordinate. Can you help us to decrypt all the POI coordinates? Input The first line contains a single integer T, indicating the number of test cases. Each test case consists of two float number(x, y) in a single line. Technical Specification 1. 1 <= T <= 10000 2. 0 <= x, y <= 10000 Output For each test case, output the case number first, then the decrypted coordinates with six decimal digits. If multiply answer exists, output the one which has minimal x. Sample Input
Sample Output
Author momodi@WHU Source | ||||||||||
|