10706 - Number Sequence UVA

Number Sequence
Input: standard input
Output: standard output
Time Limit: 1 second

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 S₁S₂…S_k. Each group S_k 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 <=25), 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                           Output for Sample Input

2 8 3

2 2

#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
using namespace std;
const int maxn = 10;
long long s[1000000];
long long ans[1000000];
int digit(int n)
{
    int count = 0;
    while(n)
    {
        n/=10;
        count++;
    }
    return count;
}
int main()
{
    int t;
    scanf("%d",&t);
    int i ;
    for(i = 0;i<t;++i)
    {
         long long n;
         scanf("%lld",&n);
         long long sum = 0;
         int j;
         s[0] = 0;
         int b;
         for(j = 1;j<=1000000;++j)
         {
             s[j] = s[j-1]+digit(j);
         }
         for(j = 1;j<=1000000;++j)
         {
             sum += s[j];
             if(sum>=n)
             {
             b = j;
             break;
             }
         }
         sum -= s[b];
         long long temp = n-sum;
         long long k = 0;
         for(j = b;j>=1;j--)
         {
             int p=j;//一定要定义一个变量不能直接破坏j
             while(p)
             {
                 ++k;
                 ans[k] = p%10;
                 p/=10;
             }
         }
         printf("%lld\n",ans[k+1-temp]);
    }
    return 0;
}