HDU 1597:find the nth digit

find the nth digit

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8351    Accepted Submission(s): 2381

Problem Description

假设：
S1 = 1
S2 = 12
S3 = 123
S4 = 1234
.........
S9 = 123456789
S10 = 1234567891
S11 = 12345678912
............
S18 = 123456789123456789
..................
现在我们把所有的串连接起来
S = 1121231234.......123456789123456789112345678912.........
那么你能告诉我在S串中的第N个数字是多少吗？

 

Input

输入首先是一个数字K，代表有K次询问。
接下来的K行每行有一个整数N(1 <= N < 2^31)。

 

Output

对于每个N，输出S中第N个对应的数字.

 

Sample Input

  
  

   
   6
1
2
3
4
5
10
  
  

 

Sample Output

  
  

   
   1
1
2
1
2
4
  
  

#include<cstdio>
#include<string>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<algorithm>
#include<iostream>
#include<sstream>

using namespace std;

int main()
{
    int cas;
    int n;
    int sum;
    scanf("%d", &cas);
    while( cas-- )
    {
        scanf("%d", &n);
        sum = 0;
        for(int i=1; ; i++)
        {
            sum += i;
            if( sum >= n )
            {
                sum -= i;
                break;
            }
        }
        int ans = n - sum;
        if( ans % 9 == 0 ) printf("9\n");
        else printf("%d\n", ans%9);
    }

    return 0;
}