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: |
伤心啊,wa了那么多次,表示我开始计算都是对的呀!为什么要用long long不可以用__int64!!!,伤心!lightoj就是坑,两道题都错好多次,好吧,还是我的问题,呜呜
#include<cstdio>
#include<cmath>
int main()
{
int n;
int num=1;
scanf("%d",&n);
while(n--)
{
long long m,z;
scanf("%lld",&m);
z=sqrt((double)m);
if(m==(z*z))
{
if(z%2==1)
printf("Case %d: 1 %lld\n",num,z);
else
printf("Case %d: %lld 1\n",num,z);
}
else
{
if(z%2==1)
{
if((m-z*z)>(z+1))
printf("Case %d: %lld %lld\n",num,z+1,(1+(z+1)*(z+1)-m));
else
printf("Case %d: %lld %lld\n",num,(m-z*z),z+1);
}
else
{
if((m-z*z)>(z+1))
printf("Case %d: %lld %lld\n",num,(1+(z+1)*(z+1)-m),z+1);
else
printf("Case %d: %lld %lld\n",num,z+1,m-z*z);
}
}
num++;
}
return 0;
}