poj-1019

  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: 

  11212312341234512345612345671234567812345678912345678

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<math.h>
#include<iostream>
#include <cstdio>
using namespace std;
unsigned int a[31270],s[31270],b[100];
void reset()
{
    int i;
    a[1]=1;
    s[1]=1;
    for(i=2;i<31270;i++)
    {
        a[i]=a[i-1]+(int)log10((double)i)+1;
        s[i]=s[i-1]+a[i];
    }    
}    

int main()
{
    int T;
    int n;
    int i;
    scanf("%d",&T);
    reset();
    while(T--)
    {
        scanf("%d",&n);
        i=1;
        int v=1;
        while(s[i]<n) i++;
      
        int pos=n-s[i-1]; 
        int tmp=0;
        int y;
        for(int i=1;tmp<pos;i++)
        {
        	tmp+=(int)log10((double)i)+1;
        	y=i;
		}
		tmp=tmp-(int)log10((double)y)-1;
		int x=pos-tmp;
		while(y)
		{
			b[v]=y%10;
			y=y/10;
			v++;	
		}
		cout<<b[v-x]<<endl;
    }  
    return 0; 
     
}