LIGHTOJ-10081008 - Fibsieve`s Fantabulous Birthday(规律)

最新推荐文章于 2020-11-20 17:35:14 发布

原创最新推荐文章于 2020-11-20 17:35:14 发布 · 583 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LIGHTOJ1008 #- Fibsieves Fantabul #规律

规律同时被 2 个专栏收录

9 篇文章

订阅专栏

LIGHTOJ--ACM

7 篇文章

订阅专栏

Fibsieve收到了一个特殊的生日礼物——一个NxN的玻璃棋盘，每秒会有一个随机单元格亮起。本篇介绍了一种算法，用于预测在特定秒数时哪个单元格会被点亮。

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

Output for Sample Input

Case 1: 2 3

Case 2: 5 4

Case 3: 1 5

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
	long long a,b,i,j,n,l,r,mid,x,y,cot=1,t;
	scanf("%lld",&n);
	while(n--)
	{
		int flag=0;
		scanf("%lld",&a);
		t=sqrt(a);
		if(t*t==a)
		{
			if(t%2)
			{
				x=1;
				y=t;
			}
			else
			{
				y=1;
				x=t;
			}
			printf("Case %lld: %lld %lld\n",cot++,x,y);
			continue;
		}
		
		if(t%2==0)
		{
			j=a-t*t;
			if(j<(t+1))
			{
				x=t+1;
				y=j;
			}
			else
			{
				x=t+1-j%(t+1);
				y=t+1;
			}
		}
		else
		{
			
			j=a-t*t;
			if(j<t+1)
			{
				y=t+1;
				x=j;
			}
			else
			{
				y=t+1-j%(t+1);
				x=t+1;
			}
		}
		printf("Case %lld: %lld %lld\n",cot++,x,y);
	}
	return 0;
 }