| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 128 MB | 36 | 24 | 24 | 66.667% |
Consider all positive integers written in the following manner (you can imagine an infinite spiral).
21 22 23 24 25 26 20 7 8 9 10 ... 19 6 1 2 11 ... 18 5 4 3 12 ... 17 16 15 14 13 ...
Your task is to determine the position (row,column) of a given number N, assuming that the center (number 1) has position (0,0). Rows are numbered from top to bottom, columns are numbered from left to right (for example, number 3 is at (1,1). Your program should output a string containing the position of N in the form (R,C) where R is the row and C is the column. R and C must not contain any leading zeroes.
The first line of the input gives an integer T, which is the number of test cases. Each test case contains an integer N (1 ≤ N<231).
For each test case, output the position as described above. See sample output for further clarification.
7 2 3 7 17 24 830 765409
(0,1) (1,1) (-1,-1) (2,-2) (-2,1) (-14,3) (-437,221)