Lightoj 1008

Description

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

3

8

20

25

Sample Output

Case 1: 2 3

Case 2: 5 4

Case 3: 1 5

#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
long long cha(long long d)//判断属于“哪一层” 
{
	long long x=sqrt(d);
	if(x*x==d)
	return x;
	return x+1;
}
int main()
{
	int t;
	int ans=0;
	scanf("%d",&t);
	while(t--)
	{
		ans++;
		long long n;
	  scanf("%lld",&n);
		long long x,y;
        long long q=cha(n);
        long long dui=q*q-q+1;//以右上角的数为分界 
        if(q%2==1)
        {
           if(n>=dui)
		   {
		   	x=q-(n-dui);
		   	y=q;
		   }	
		   else
		   {
		   	x=q;
		   	y=q-(dui-n);
		   }
		}
		else
		{
			if(n>dui)
			{
				x=q;
				y=q-(n-dui);
			}
			else
			{
				y=q;
				x=q-(dui-n);
			}
		}
		printf("Case %d: %lld %lld
",ans,x,y);
	}
	return 0;
}