LightOJ1008---Fibsieve`s Fantabulous Birthday (规律)

关注

原创最新推荐文章于 2020-12-15 22:13:23 发布 1.4k 阅读 AI 写同款· GEO 优化 ›

Light OJ 1008- Fibsieve`s Fantabulous Birthday 直接模拟： #include #include using namespace std; int main() { int t; scanf("%d",&t); for(int ca=1;ca<=t;ca++) { long long n,x,r,c; scanf("%lld",&n); printf("Case %d: ",ca); x=sqrt(n); 阅读详情

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

Case 1: 2 3

Case 2: 5 4

Case 3: 1 5

Problem Setter: Muntasir Muzahid Chowdhury
Special Thanks: Jane Alam Jan (Dataset)

分别找到第一个>=s的和<=s的完全平方数,然后处理下细节即可

/*************************************************************************
        > File Name: LightOJ1008.cpp
        > Author: ALex
        > Mail: zchao1995@gmail.com
        > Created Time: 2015年06月04日 星期四 18时50分14秒
     ************************************************************************/

    #include <functional>
    #include <algorithm>
    #include <iostream>
    #include <fstream>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    #include <cstdlib>
    #include <queue>
    #include <stack>
    #include <map>
    #include <bitset>
    #include <set>
    #include <vector>

    using namespace std;

    const double pi = acos(-1.0);
    const int inf = 0x3f3f3f3f;
    const double eps = 1e-15;
    typedef long long LL;
    typedef pair <int, int> PLL;

    int main() {
        int t, icase = 1;
        scanf("%d", &t);
        while (t--) {
            LL s;
            scanf("%lld", &s);
            int x = sqrt(s * 1.0);
            if ((LL)x * x == s) {
                if (x & 1) {
                    printf("Case %d: 1 %d\n", icase++, x);
                }
                else {
                    printf("Case %d: %d 1\n", icase++, x);
                }
                continue;
            }
            int i, j;
            if (x & 1) {
                if ((LL)x * x + x + 1 >= s) {
                    j = x + 1;
                    i = s - (LL)x * x;
                }
                else {
                    i = x + 1;
                    j =  x + 1 - (s - (LL)x * x - x - 1);
                }
            }
            else {
                if ((LL)x * x + x + 1 >= s) {
                    i = x + 1;
                    j = x + 1 - ((LL)x * x + x + 1 - s);
                }
                else {
                    j = x + 1;
                    i = x + 1 - (s - (LL)x * x - x - 1);
                }
            }
            printf("Case %d: %d %d\n", icase++, i, j);
        }
        return 0;
    }