Sample Input

Sample Output

Case :

Case :

Case :  

 #include <iostream>

 #include <string.h>

 #include <stdio.h>

 #include <algorithm>

 #include <math.h>

 #include <vector>

 using namespace std;

 typedef long long LL;

 const int INF = 0xfffffff;

 const int maxn = ;

 #define max(a,b)(a>b?a:b)

 #define min(a,b)(a<b?a:b)

 #define lson rt<<1

 #define rson rt<<1|1

 int main()

 {

     int T,k=;

     long long s,n,a,x,y;

     scanf("%d", &T);

     while(T--)

     {

         scanf("%lld", &s);

         n=ceil(sqrt(double(s)));

         a=n*n-s;

         if(a<n)

         {

             x=n;

             y=a+;

         }

         else

         {

             x=-n*n+*n+s-;

             y=n;

         }

         if(n%!=)swap(x,y);

         printf("Case %d: %lld %lld\n",k++,x,y);

     }

     return ;

 }