Light OJ 1008

找规律。

　　首先令n=sqrt(s)，上取整。讨论当n为偶数时，若n*n-s<n则x=n，y=n*n-s+1否则x=-n*n+2*n+s-1，y=n;如果n为奇数，交换x，y即可，对称的。

Sample Input
3
8
20
25
Sample Output
Case 1: 2 3
Case 2: 5 4
Case 3: 1 5

 

*****************************************************

#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 = 42000;
#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=1;
    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+1;
        }
        else
        {
            x=-n*n+2*n+s-1;
            y=n;
        }

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

        printf("Case %d: %lld %lld
",k++,x,y);
    }
    return 0;
}