Lightoj1008——Fibsieve`s Fantabulous Birthday（找规律）

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	Output for Sample Input
3 8 20 25	Case 1: 2 3 Case 2: 5 4 Case 3: 1 5

可以确定的坐标是，如果输入的数正好是某个数的平方，那么它的坐标一定是在边缘，可以依靠这个信息确定其他数的位置

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<cmath>
#define MAXN 10000
using namespace std;
int main()
{
long long t,cnt=1,n,m,i,j,s;
scanf("%lld",&t);
while(t--)
{
scanf("%lld",&s);
n=(long long)sqrt(s);
if(n*n==s)
{
if(n%2==0)
printf("Case %lld: %lld 1\n",cnt++,n);
else
printf("Case %lld: 1 %lld\n",cnt++,n);
}
else
{
if(n%2==1)
{
m=n*n;
if(s-(m+1)<=n)
{
i=s-m;
j=n+1;
}
else
{
i=n+1;
j=(n+1)*(n+1)-s+1;
}
}
else
{
m=n*n;
if(s-(m+1)<=n)
{
i=n+1;
j=s-m;
}
else
{
i=(n+1)*(n+1)-s+1;
j=n+1;
}
}
printf("Case %lld: %lld %lld\n",cnt++,i,j);
}
}
return 0;
}