poj 1019 Number Sequence

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#define RR freopen("in.txt","r",stdin)
#define WW freopen("out.txt","w",stdin)
#define LL long long
#define INF 0x3f3f3f3f
#define MAX 33000
using namespace std;

unsigned int a[MAX],s[MAX];

void Init()
{
    a[1] = s[1] = 1;
    for(int i=2;i<MAX;i++)
    {
        a[i] = a[i-1] + (int)log10((double)i)+1;
        s[i] = s[i-1] + a[i];
    }
}

int compute(int n)
{
    int i=1;
    while(s[i]<n)
        i++;
    int pos = n - s[i-1];   // 找出n在低i组的位置

    int len = 0;
    for(i=1;len<pos;i++)     //找出n所在组的长度
        len += (int)log10((double)i)+1;
    return (i-1)/(int)pow((double)10,len-pos)%10;//i-1是i位置上的数,pow()是求出第n后面的位数
}

int main()
{
    Init();
    int T;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        cout<<compute(n)<<endl;
    }
    return 0;
}

Description

A single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groups S1S2...Sk. Each group Sk consists of a sequence of positive integer numbers ranging from 1 to k, written one after another.
For example, the first 80 digits of the sequence are as follows:
11212312341234512345612345671234567812345678912345678910123456789101112345678910

Input

The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by one line for each test case. The line for a test case contains the single integer i (1 ≤ i ≤ 2147483647)

Output

There should be one output line per test case containing the digit located in the position i.

Sample Input

2
8
3

Sample Output

2
2