HDU_2446_打表

http://acm.hdu.edu.cn/showproblem.php?pid=2446

打表，二分查找，注意查找最后的判断。

#include<cstdio>
#define N 2000017
using namespace std;
__int64 x[N] = {},y[N] = {};

__int64 fun1(__int64 a)
{
    __int64 l = ,r = N,mid;
    while(l < r)
    {
        mid = (l+r)/;
        if(y[mid] < a)
        {
            l = mid+;
        }
        else if(y[mid] > a)
        {
            r = mid-;
        }
        else
        {
            return mid;
        }
    }
    if(y[l] < a)
    {
        return l+;
    }
    return l;
}

__int64 fun2(__int64 a)
{
    __int64 l = ,r = N;
    while(l < r)
    {
        __int64 mid = (l+r)/;
        if(x[mid] < a)
        {
            l = mid+;
        }
        else if(x[mid] > a)
        {
            r = mid-;
        }
        else
        {
            return mid;
        }
    }
    if(x[l] < a)
    {
        return l+;
    }
    return l;
}
int main()
{

    for(int i = ;i <= N;i++)
    {
        x[i] = x[i-]+i;
        y[i] = y[i-]+x[i];
    }
    int n;
    scanf("%d",&n);
    while(n--)
    {
        __int64 a,b,c;
        __int64 temp1;
        scanf("%I64d",&temp1);
        a = fun1(temp1);
        __int64 temp2 = temp1-y[a-];
        b = fun2(temp2);
        c = temp2-x[b-];
        printf("%I64d %I64d %I64d\n",a,b,c);
    }
    return ;
}