LightOJ 1008 - Fibsieve`s Fantabulous Birthday (规律)



1008 - Fibsieve`s Fantabulous Birthday

PDF (English)

Statistics

Forum

Time Limit: 0.5 second(s)

Memory Limit: 32 MB

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 thatN 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 ≤ 10¹⁵) 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	Output for Sample Input
3 8 20 25	Case 1: 2 3 Case 2: 5 4 Case 3: 1 5

 

题意：在如上图所示的图中，例如1的坐标为(1,1)， 5的坐标为(3,1)。给出任意n，问n的坐标。

题解：规律题。观察图中填数的走向（即不同的颜色标示），发现每个走向的数的个数为1  3  5   7   9.........

而每次走向中每个数n开平方取整的值cnt相同。而奇数次走向和偶数次走向完全相反。归纳寻找，cnt为偶数时，当cnt*cnt-n<cnt时，x=cnt，y=cnt*cnt-n+1。否则y=cnt，x=n-cnt*cnt+2*cnt-1。 当cnt为奇数时，则交换x，y的值。（对称）。

代码如下：

#include<cstdio>
#include<cstring>
#include<cmath>
int main()
{
	long long n; 
	long long cnt,x,y;
	int t,k=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld",&n);
		cnt=ceil(sqrt(n*1.0));
		if(cnt*cnt-n<cnt)
		{
			x=cnt;
			y=cnt*cnt-n+1;
		}
		else
		{
			y=cnt;
			x=n-cnt*cnt+2*cnt-1;
		}
		if(cnt&1)
		{
			int num;
			num=x;
			x=y;
			y=num;
		}
		printf("Case %d: %lld %lld\n",k++,x,y);
	}
	return 0;
}