uva10706 Number Sequence

题目：前n个数字组成串s，利用s的前k个串构成t，求t串的第i个位置的字符。

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;

string sk;
vector<unsigned> index;
void pushdigit(int k)
{
    stack<int> digit;
    while(k > 0)
    {
        digit.push(k%10);
        k /= 10;
    }
    while(!digit.empty())
    {
        sk.push_back(char(digit.top()+ '0'));
        digit.pop();
    }
}
void preprocess()
{
    sk.push_back('0');
    index.push_back(0);
    for(int k = 1; index.back() < 2147483647; k++)
    {
        pushdigit(k);
        index.push_back(index.back() + sk.length() - 1);
    }
}

int main()
{
    preprocess();

    vector<unsigned>::iterator it;
    int t, i;
    cin >> t;
    while(t--)
    {
        cin >> i;
        it = lower_bound(index.begin(), index.end(), i);
        it--;
        cout << sk[i - (*it)] << endl;
    }
    return 0;
}