LightOJ - 1008

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.
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.
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.

(The numbers in the grids stand for the time when the corresponding cell lights 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

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.

Output

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

Sample Input

3
8
20
25

Sample Output

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

题意

有一个N*N的格子，每一个格子都有一个灯泡，每一个灯泡在特定的时间会亮起来，表中的数字即为所在灯泡的亮起来的时间，根据表中的数字来找规律，判断第多少秒的时候是哪一个格子的灯泡亮了。

思路

根据表中的数据找规律

斜线：n*(n-1)+1
偶数在偶数列/行，奇数在奇数列/行
判断所在数是在偶数列还是奇数列（根据蓝色或绿色的数字开方来确定该数所在的行/列），然后再进一步判断所在数是在红色数字的左边还是下面。

AC代码

#include<stdio.h>
#include<math.h>

int main ()
{
	long long t, s;
	int c = 1;
	double temp;
	scanf("%lld",&t);
	while(t--)
	{
		scanf("%lld",&s);
		printf("Case %d:",c++);
		temp = sqrt(s);//求出这个数的开方
		long long k = (long long)temp;//取temp的整数部分
		if(temp > k)//若开方的结果有小数部分，说明他所在的行/列应该在其整数的下一行/列
			k++;
		long long m = k * (k - 1) + 1;//求出斜线上所在列/行的数字
		if(k % 2 == 0)
		{
			if(s > m)
				printf(" %lld %lld\n",k, k - (s - m));
			else
				printf(" %lld %lld\n",k - (m - s), k);
		}
		else
		{
			if(s > m)
				printf(" %lld %lld\n",k - (s - m), k);
			else
				printf(" %lld %lld\n",k, k - (m - s));
		}
	}
}

//总结：这题主要的难点就是在找规律，根据表格来确定一个数的具体位置，这里需要从奇偶数，斜线上的数上寻求突破。