Number Sequence

题解（写得很详细）：

点击打开链接http://blog.csdn.net/lyy289065406/article/details/6648504

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<stdio.h>
#include<math.h>
#define maxn 31269
unsigned an[maxn],sn[maxn];
void table()
{
	for(int i=1;i<maxn;i++)
	{
		an[i]=an[i-1]+log10((double)i)+1;
		sn[i]=sn[i-1]+an[i];
	}
} 
int main()
{
	int t;
	scanf("%d",&t);
	table();
	while(t--)
	{
		int ans,pos,len=0,i,j;
		scanf("%d",&pos);
		for(i=1;sn[i]<pos;i++)
			; 
		pos=pos-sn[i-1];
		for(j=1;pos>len;j++)
		{
			len+=log10((double)j)+1;
		}
		ans=(j-1)/(int)pow(10,len-pos)%10;
		printf("%d\n",ans);
	}
	return 0;
}