LightOJ-1008 Fibsieve`s Fantabulous Birthday

1008 - Fibsieve`s Fantabulous Birthday

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.

Center

(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

Case 1: 2 3

Case 2: 5 4

Case 3: 1 5

解题思路

通过数的分布我们不难看出可以通过数的开方找到他在第几层，这里的第几层意思是从右下角开始的第几层，然后通过分类讨论找到第几行或第几列。

主要是注意超时，不能使用for循环。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
    int t;
    scanf("%d",&t);
    int aa=0;
    while(t--)
    {
        long long n;
        scanf("%lld",&n);
        printf("Case %d: ",++aa);
        if(n==1)
        {
            printf("1 1\n");
            continue;
        }
        double map;
        map=sqrt(n);
        long long ans;
            long long i,j;
        ans=map;//ceng
        if(ans<map)
        {
            ans++;
        }
        if(ans%2==0)
        {long long cnm=pow(ans,2);
        long long kai;
        long long end;
        kai=cnm;
        end=kai-(2*ans-1)+1;
        long long zz;
        zz=(kai+end)/2;
        if(zz==n)
        printf("%d %d\n",ans,ans);
        else
        {
            if(n<zz)
            {
                printf("%d %d\n",n-end+1,ans);
            }
            else
            {
                printf("%d %d\n",ans,kai-n+1);
            }
        }
        }
        else
        {long long cnm=pow(ans,2);
        long long kai;
        long long end;
        kai=cnm;
        end=kai-(2*ans-1)+1;
        long long zz;
        zz=(kai+end)/2;
        if(zz==n)
        printf("%d %d\n",ans,ans);
        else
        {
            if(n<zz)
            {
                printf("%d %d\n",ans,n-end+1);
            }
            else
            {
                printf("%d %d\n",kai-n+1,ans);
            }
        }
        }
    }
    return 0;
}