Number Sequence (P1019)

这个题还比较麻烦。其中要注意的是：一个数中有多少个数字就占多少位。

作法：　用go[i ]存从数字i的数的位数。

            用num[i]=num[i-1]+go[i]；　存1到i　之间的数的所有位数和。

　　　用sum[i]=sum[i-1] +num[i] ；存1 gc i 之间的重复的数序列之和。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<set>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<string>

using namespace std;

#define N 31280
#define s 31268

int go[N];
int num[N];
int sum[N];
int getnum(int k)
{
	int j=10;
	int ans=1;
	while ( k/j)
	{
		j*=10;
		ans++;
	}
	return ans;
}

int main()
{
	int i,j,k;
	go[0]=0;
	for (i=1;i<N;i++)
	{
		go[i]=getnum(i);
	}
	num[0]=0;
	for (i=1;i<N;i++)
	{
		num[i]=num[i-1]+go[i];
	}
	sum[0]=0;
	for (i=1;i<N;i++)
	{
		sum[i]=sum[i-1]+num[i];
	}

	int n;
	int cas;
	cin>>cas;
	while (cas--)
	{
		cin>>n;
		for (i=s-1;i>=0;i--)
		{
			if ( n>sum[i])
			{
				n-=sum[i];
				break;
			}
		}
		//cout<<n<<' ';
		
		for (i=N-1;i>=0;i--)
		{
			if (n>num[i])
			{
				n-=num[i];
				break;
			}
		}
		//cout<<n<<' ';
		i++;
		k=1;
		//cout<<i<<' ';
		//cout<<go[i]<<' ';
		n=go[i]-n+1;
		while (--n)
		{
			i/=10;
		}
		cout<<i%10<<endl;
	}
}

Number Sequence

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 27852		Accepted: 7680

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