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.

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


题意:给你一个n*n的表格,按照一定顺序填数1 - n*n。现在任意给你一个数s,问你s所在的行与列。


找到规律 1 + 3 + 5 + 7 + ... (2*n-1) 先求出n,再根据奇偶判断填数的顺序,最后由剩余的数yu = s - n*n判断行或列。


AC代码:


#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN 500000+10
#define MAXM 50000000
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 9901
#define LL long long
using namespace std;
int main()
{
    int t, kcase = 1;
    Ri(t);
    W(t)
    {
        LL ans; Rl(ans);
        int l = sqrt(ans);
        int yu = ans - l * l;
        if(yu == 0)
        {
            if(l & 1)
                printf("Case %d: %d %d\n", kcase++, 1, l);
            else
                printf("Case %d: %d %d\n", kcase++, l, 1);
            continue;
        }
        l++;
        if(yu > l)
        {
            yu -= l;
            if(l & 1)
                printf("Case %d: %d %d\n", kcase++, l-yu, l);
            else
                printf("Case %d: %d %d\n", kcase++, l, l-yu);
        }
        else
        {
            if(l & 1)
                printf("Case %d: %d %d\n", kcase++, l, yu);
            else
                printf("Case %d: %d %d\n", kcase++, yu, l);
        }
    }
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值