Light Oj 1008

最新推荐文章于 2022-09-28 20:07:42 发布

原创最新推荐文章于 2022-09-28 20:07:42 发布 · 634 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM----【数论】专栏收录该内容

11 篇文章

订阅专栏

Fibsieve举办了一场充满惊喜的生日派对，派对上有一块N x N格子的玻璃棋盘，每个格子内有一盏灯。当棋盘被开启，灯按照特定顺序点亮。文章通过一个输入输出样例，介绍了如何预测给定时间内点亮的格子坐标。

Fibsieve`s Fantabulous Birthday
Time Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit

Status
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

/**********************************************

     author   :   Grant Yuan
     time     :   2014.8.5
     algorithm:   数论
     explain  :    对n开平方然后向上取整得到m:
                      如果m为奇数：
                             if（m*m-n<m)    y=m;x=m*m-n+1;
                               else  x=m;y=n-(m-1)*(m-1);

                      如果m为偶数：
                             if(m*m-n<m)    x=m;y=m*m-n+1;
                                else   y=m;x=n-(m-1)*(m-1);

**********************************************/

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

long long t,n,x,y;
long long z;
long long m;

int main()
{
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
      scanf("%lld",&n);
      z=sqrt(n*1.0);
      if(z*z==n) m=z;
      else m=z+1;
      if(m%2){
        if(m*m-n<m){
            y=m;x=m*m-n+1;
        }
        else{
            x=m;y=n-(m-1)*(m-1);
        }}
     else{
        if(m*m-n<m){
            x=m;y=m*m-n+1;
        }
        else{
            y=m;x=n-(m-1)*(m-1);
        }
     }
     printf("Case %d: %lld %lld\n",i,x,y);
      }
    return 0;
}