HDOJ  1597    find the nth digit

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1597

#include <iostream>
#include <math.h>
using namespace std;
int s[]={1,1,2,1,2,3,1,2,3,4,1,2,3,4,5,1,2,3,4,5,6,1,2,3,4,5,6,7,
        1,2,3,4,5,6,7,8};
int main()
{
    unsigned long n;
    int k;
    while(cin>>k)
    {
        while(k--)
        {
            cin>>n;
            if(n<=36)
                cout<<s[n-1]<<endl;
            else
            {
                double i=ceil(sqrt(2*n*1.0+0.25)-0.5);   //ceil()函数为向上取整
                //i等于n所处的第几个S；
                unsigned long j=(unsigned long)i-1;
                n=n-j*(j+1)/2;
                if(n%9)cout<<n%9<<endl;
                else cout<<9<<endl;
            }
        }
    }
    return 0;
}