# Light OJ - 1008 - Fibsieves Fantabulous Birthday

70人阅读 评论(0)

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<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int l;
scanf("%d",&l);
int ant=1;
while(l--)
{
long long n;
long long x,y,t;
scanf("%lld",&n);
__int64 m=ceil(sqrt(n));
if(m%2==0)
{
if(m*m-n<m)
{
x=m;
y=m*m-n+1;
}
else
{
y=m;
x=2*m-1-(m*m-n);
}

}
if(m%2!=0)
{
if(m*m-n<m)
{
y=m;
x=m*m-n+1;
}
else
{
x=m;
y=2*m-1-(m*m-n);
}
}
printf("Case %d: %lld %lld\n",ant++,x,y);
}
} `

0
0

【套餐】嵌入式Linux C编程基础
【套餐】2017软考系统集成项目——任铄
【套餐】Android 5.x顶级视频课程——李宁
【套餐】深度学习入门视频课程——唐宇迪
【直播】广义线性模型及其应用——李科
【直播】从0到1 区块链的概念到实践
【直播】计算机视觉原理及实战——屈教授
【直播】机器学习之凸优化——马博士
【直播】机器学习&数据挖掘7周实训--韦玮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：15744次
• 积分：1863
• 等级：
• 排名：千里之外
• 原创：181篇
• 转载：0篇
• 译文：0篇
• 评论：3条
最新评论