zoukankan      html  css  js  c++  java
  • Fibsieve`s Fantabulous Birthday

    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

    //  注意 :这个题我在 light oj上用__int64 提交是错误的   用long long 能过  下面是AC代码</span>
    <pre name="code" class="cpp">#include<cstdio>                
    #include<cmath>
    long long cha(long long q)
    {
    	long long z=sqrt(q);
    	 if(z*z==q)
          return  z	;
          else
           return  z+1;
    }
    int main()
    {
    	int t;
    	long long  cut=0;
    	scanf("%d",&t);
    	while(t--)
    	{
    		cut++;
    		long long s,x,y;
    		scanf("%lld",&s);
    		long long jiao=cha(s)*cha(s)-cha(s)+1;  
    		if(cha(s)%2==1)
    		{
    			if(s<=jiao)
    		    {
    		     	x=cha(s);
    			  y=cha(s)-(jiao-s);
    		    }
    		    else
    		    {
    		    	y=cha(s);
    		    	x=cha(s)-(s-jiao); 
    			}
    		}
    		else
    		{
    			if(s>=jiao)
    		    {
    		     	x=cha(s);
    			  y=cha(s)-(s-jiao);
    		    }
    		    else
    		    {
    		    	y=cha(s);
    		    	x=cha(s)-(jiao-s); 
    			}
    		}
    	     printf("Case %lld: %lld %lld
    ",cut,x,y);	
    	}
    	return 0;
     } 
    


    
    

  • 相关阅读:
    如何用Django建立一个后台CRM系统02
    如何用Django建立一个后台CRM系统01
    多线程的UDP聊天器
    文件被导入时,能够直接执行的代码不需要被执行
    主动抛出异常
    python异常
    初始化动作只执行一次
    单例设计模式代码实现
    类的继承
    多态的案例演示
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027133.html
Copyright © 2011-2022 走看看