http://poj.org/problem?id=1019
Number Sequence
Time Limit: 1000MS | | Memory Limit: 10000K |
Total Submissions: 28452 | | Accepted: 7873 |
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:
112123123412345123456123
456712345678123456789123
456789101234567891011123
45678910
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
Source
Tehran 2002, First Iran Nationwide Internet Programming Contest
题目大意
1121231234123451234561234567123456781234567891234567891012345678910111234......在这样的圈里,找出第n位的数字
思路
需要知道给出的数字num是在哪一段上,然后找出num是该段上哪个数字,再找出是在该数字的哪一位。
一个公式:计算出一个数的位数,(int)(log10((double)n))+1;
#include
#include
#include
#include
using namespace std;
#define maxn 31270
unsigned int a[maxn],s[maxn];
//a[i]为第i段总的数字的位数
//s[i]为前i段总的数字的位数
//log10(i) + 1表示i的位数
//初始化打表
void play_table()
{
a[1]=1;
s[1]=1;
for(int i=2;i<31270;i++)
{
//a[i]总的位数为a[i-1]+i的位数
a[i]=a[i-1]+(int)(log10((double)i))+1;
s[i]=s[i-1]+a[i];
}
}
int work(int num)
{
int i=1,location;
int length;
//找出num处于那个阶段
for(i=1;s[i]
//找出该位数的数字,length:num指向的数字的最后一位的下标
location=num-s[i-1];
length=0;
for(i=1;location>length;i++)
{
length+=(int)(log10((double)i))+1;
}
//找出num在该数字上哪个位,去除所求后面的数字然后取余
return (i-1)/(int)(pow((double)10,length-location));
//之所以i-1,是因为前面寻找第i组长度时,i++多执行了一次
//i=i-1 此时i刚好等于第n位个置上的数 (数是整体,例如123一百二十三,i刚好等于123,但n指向的可能是1,2或3)
//pos为n指向的数字在第i组中的下标值
//len为第i组的长度
//那么len-pos就是第i组中pos位置后多余的数字位数
//则若要取出pos位上的数字,就要利用(i-1)/pow(10,len-pos)先删除pos后多余的数字
//再对剩下的数字取模,就可以得到pos
//例如要取出1234的2,那么多余的位数有2位:34。那么用1234 / 10^2,得到12,再对12取模10,就得到2
}
int main()
{
int t;
unsigned int m;
play_table();
scanf("%d",&t);
while(t--)
{
scanf("%u",&m);
printf("%u\n",work(m));
}
return 0;
}