maksyuki 发表于 oj 分类,标签:

1008 - Fibsieve`s Fantabulous Birthday

Among these gifts there was an N x N glass chessboard that had a light in each of its cells. When the board was turned on a distinct cell would light up every second, and then go dark.Fibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.

The cells would light up in the sequence shown in the diagram. Each cell is marked with the second in which it would light up.

In the first second the light at cell (1, 1) would be on. And in the 5th second the cell (3, 1) would be on. Now, Fibsieve is trying to predict which cell will light up at a certain time (given in seconds). Assume that N is large enough.


Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case will contain an integer S (1 ≤ S ≤ 1015) which stands for the time.


For each case you have to print the case number and two numbers (x, y), the column and the row number.

Sample Input

Output for Sample Input

382025 Case 1: 2 3Case 2: 5 4Case 3: 1 5




算法分析:首先得到对角线上数的递推公式,然后求得最接近输入数S的对角线上的数ans,然后判断S是否在[ans – (temp - 1), ans + (temp + 1)]中,其中temp表示对角线元素的坐标(temp,temp),然后再分类讨论即可