OpenJudge

1019:Number Sequence

总时间限制:
1000ms
内存限制:
65536kB
描述
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
输入
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)
输出
There should be one output line per test case containing the digit located in the position i.
样例输入
2
8
3
样例输出
2
2
来源
Tehran 2002, First Iran Nationwide Internet Programming Contest
全局题号
21
添加于
2009-10-29
提交次数
1073
尝试人数
349
通过人数
218
您的评价 很水 简单 一般 较难 变态
  • 标签(多个标签用空格分隔):
  • 常用标签:
    递归   动态规划   贪心   搜索   枚举   模拟   数学   字符串处理   几何   高精度计算   图论  

共有5人评分

0.0%
0.0%
60.0%
40.0%
0.0%

已有的标签

数学(4) 模拟(2) 递归(1)