（二）S - S Lightoj 1008 【规律】

S - S
Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

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

#include <cstdio>
#include <cmath>
int main()
{
int t,x,y,k=1;
long long s,n,m;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&s);
n=sqrt(s);//组数
if(s-n*n>0)
n+=1;
m=n*n-(n-1);//对角线数
if(n%2==1)//组数为奇数
{
if(s>m)//大于对角线数
{
x=n-(s-m);
y=n;
}
else//小于等于对角线数
{
y=n-(m-s);
x=n;
}
}
else//组数为偶数
{
if(s>m)
{
y=n-(s-m);
x=n;
}
else
{
x=n-(m-s);
y=n;
}
}
printf("Case %d: %d %d\n",k++,x,y);
}
return 0;
}


• 本文已收录于以下专栏：

LightOJ1008---Fibsieves Fantabulous Birthday (规律)

Fibsieve had a fantabulous (yes, it’s an actual word) birthday party this year. He had so many gifts...

lightoj 1008 - Fibsieves Fantabulous Birthday

Fibsieve had a fantabulous (yes, it's an actual word)birthday party this year. He had so many gifts ...

LightOJ 1008 - Fibsieves Fantabulous Birthday

Fibsieve had a fantabulous (yes, it's an actual word)birthday party this year. He had so many gifts ...

Light oj:1008 - Fibsieves Fantabulous Birthday【规律】

1008 - Fibsieves Fantabulous Birthday PDF (English) Statistics Forum ...

Light OJ 1008 Fibsieves Fantabulous Birthday【规律】

1008 - Fibsieves Fantabulous Birthday PDF (English) Statistics Forum Time Limit: 0.5 s...

LIGHTOJ-10081008 - Fibsieves Fantabulous Birthday(规律)

1008 - Fibsieves Fantabulous Birthday PDF (English) Statistics Forum ...

Light OJ 1008 Fibsieves Fantabulous Birthday(找出数字位置）

Fibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts...

LightOJ - 1429-Assassin`s Creed (II)（tarjan找环缩点+bfs+最小路径覆盖）

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)