[POJ][1019]Number Sequence

最新推荐文章于 2020-08-10 13:56:42 发布

Shawon

最新推荐文章于 2020-08-10 13:56:42 发布

阅读量2.1k

点赞数

分类专栏： OJ Report 文章标签： poj c++ 模拟源代码

本文链接：https://blog.csdn.net/shaw1994/article/details/27863507

版权

博客介绍了POJ 1019题目的解题思路，强调在处理数字序列时使用unsigned int防止溢出，并指出不需要预先创建查找表也能通过测试。内容包括解题步骤的详细解释，以及AC代码展示，提醒读者注意数字序列长度可能超过1的情况。

摘要由CSDN通过智能技术生成

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 sin