(二)S - S Lightoj 1008 【规律】

原创 2016年06月01日 19:07:38
S - S
Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

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


题意:找所给数的x y 坐标

题解:可以发现(n-1)^2+1--n^2的数可以看成一组,可以将已知数与对角线的数比较,然后求解


代码:

#include <cstdio>
#include <cmath>
int main()
{
    int t,x,y,k=1;
    long long s,n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld",&s);
        n=sqrt(s);//组数
        if(s-n*n>0)
            n+=1;
        m=n*n-(n-1);//对角线数
        if(n%2==1)//组数为奇数
        {
            if(s>m)//大于对角线数
            {
                x=n-(s-m);
                y=n;
            }
            else//小于等于对角线数
            {
                y=n-(m-s);
                x=n;
            }
        }
        else//组数为偶数
        {
            if(s>m)
            {
                y=n-(s-m);
                x=n;
            }
            else
            {
                x=n-(m-s);
                y=n;
            }
        }
        printf("Case %d: %d %d\n",k++,x,y);
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【lightoj1008】数学找规律

C - C 使用long long Time Limit:500MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit...

数学_LightOJ_1008

#include #include #include #include using namespace std; int main() { int t; long long int s...
  • whj_lim
  • whj_lim
  • 2015年07月27日 08:55
  • 286

lightoj-1008 - Fibsieve`s Fantabulous Birthday【思维】【找规律】

题目链接:点击打开链接 1008 - Fibsieve`s Fantabulous Birthday     PDF (English) Statistics Forum...

Lightoj 1008 生日宴会

Description 某只同学在生日宴上得到了一个N×N玻璃棋盘,每个单元格都有灯。每一秒钟棋盘会有一个单元格被点亮然后熄灭。棋盘中的单元格将以图中所示的顺序点亮。每个单元格上标记的是它在第几...

Lightoj 1008【规律】

25 24 23 22 21 10 11 12 13 20 9 8 7 14 19 2 3 6 15 18 ...

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

Fibsieve had a fantabulous (yes, it’s an actual word) birthday party this year. He had so many gifts...

lightoj 1008 - Fibsieve`s Fantabulous Birthday

Fibsieve had a fantabulous (yes, it's an actual word)birthday party this year. He had so many gifts ...

LightOJ 1008 - Fibsieve`s Fantabulous Birthday

Fibsieve had a fantabulous (yes, it's an actual word)birthday party this year. He had so many gifts ...

Light OJ 1008 Fibsieve`s Fantabulous Birthday【规律】

1008 - Fibsieve`s Fantabulous Birthday PDF (English) Statistics Forum Time Limit: 0.5 s...
  • wyjwyl
  • wyjwyl
  • 2015年12月01日 19:44
  • 147

Light oj:1008 - Fibsieve`s Fantabulous Birthday【规律】

1008 - Fibsieve`s Fantabulous Birthday PDF (English) Statistics Forum ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:(二)S - S Lightoj 1008 【规律】
举报原因:
原因补充:

(最多只允许输入30个字)