LightOJ1008 Fibsieve`s Fantabulous Birthday

题目链接：

http://lightoj.com/volume_showproblem.php?problem=1008

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 ≤ 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
3 8 20 25	Case 1: 2 3 Case 2: 5 4 Case 3: 1 5

 

---

PROBLEM SETTER: MUNTASIR MUZAHID CHOWDHURY

SPECIAL THANKS: JANE ALAM JAN (DATASET)

 题意：

给你一个数，符合上述的规则，输出这个数的位置

思路：

给这个数开方，然后就能过寻找出是几列或者是第几行，，，，，数的大小和奇偶性都会导致不同的位置，

注意：本题先输出列后输出行

This is the code

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define MOD 1e9+7
#define LL long long
#define ULL unsigned long long     //1844674407370955161
#define INT_INF 0x7f7f7f7f      //2139062143
#define LL_INF 0x7f7f7f7f7f7f7f7f //9187201950435737471
const int dr[]= {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[]= {-1, 1, 0, 0, -1, 1, -1, 1};
// ios::sync_with_stdio(false);
// 那么cin, 就不能跟C的 scanf，sscanf, getchar, fgets之类的一起使用了。
int main()
{
    int T;
    scanf("%d",&T);
    for(int t=1;t<=T;++t)
    {
        LL n;
        scanf("%lld",&n);
        LL tem=(LL)ceil(sqrt(n));//表示第几行或者第几列
        LL x,y;
        if(tem&1)//表示大的首先在行
        {
            LL ans=tem*tem;
            if(n>ans-tem)
            {
                y=tem;
                x=ans-n+1ll;
            }
            else
            {
                LL ans=(tem-1ll)*(tem-1ll)+1ll;
                x=tem;
                y=n-ans+1ll;
            }
        }
        else//表示大的数首先在列
        {
            LL ans=tem*tem;
            if(n>ans-tem)
            {
                x=tem;
                y=ans-n+1;
            }
            else
            {
                LL ans=(tem-1)*(tem-1)+1ll;
                y=tem;
                x=n-ans+1;
            }
        }
        printf("Case %d: %lld %lld\n",t,x,y);
    }
}