Number Sequence

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

#include<bits/stdc++.h>
using namespace std;
int a[31270];
long long b[31270];
void init(){
    int i;
    a[0] = 0;
    b[0] = 0;
    for(i = 1; i < 31270; i++){
        a[i] = a[i-1] + (int)log10((double)i) + 1;
        b[i] = b[i-1] + a[i];
    }
}
int main(){
    init();
    int K,n,i;
    cin>>K;
    while(K--){
        cin>>n;
        i = 0;
        while(n > b[i])
            i++;
        int pos = n - b[i-1];
        int s = 0;
        for(i = 1; s < pos; i++)
        s += (int)log10((double)i) + 1;
        int k=s-pos;
        printf("%d\n",(i-1)/(int)pow(10.0,k)%10);
    }
    return 0;
}