UVa 10706 - Number Sequence

Problem B
Number Sequence
Input:
standard input
Output: standard output
Time Limit: 1 second

A single positiveinteger iis given. Write a program to find the digitlocated in the position iin the sequence of number groups S1S2…Sk. Each group Sk consists of a sequence of positive integer numbers ranging from 1to k, written one after another. For example, the first 80 digitsof the sequence are as follows:

11212312341234512345612345671234567812345678912345678910123456789101112345678910

Input

The first line ofthe input file contains a single integer t (1 <=t <=25), thenumber of test cases, followed by one line for each test case. The line for atest case contains the single integer i (1 <=i <=2147483647)

 

Output

There should be one output line per test casecontaining the digit located in the position i.

 

SampleInput                           Outputfor Sample Input

2

8

3

2

2


Problem source: Iranian Contest

Special Thanks: Shahriar Manzoor, EPS.

  注意序列的变化

#include <stdio.h>
#include <string.h>
#include <math.h>
long long int a[100];
int main()
{
    long long int i,j,n,m,s,pre,t,sum;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        pre=s=m=0;
        for(i=1;;i++)
        {
            j=i;
            sum=0;
            while(j!=0)
            {
                j=j/10;
                sum++;
            }
            m+=sum;
            s+=m;
            if(s>=n)
            {
                break;
            }
            pre=s;
        }
        n=n-pre;
        for(i=1,s=0;;i++)
        {
            j=i;
            sum=0;
            while(j!=0)
            {
                a[sum++]=j%10;
                j=j/10;
            }
            if(s+sum>=n)
            {
                break;
            }
            s=s+sum;
        }
        printf("%lld\n",a[sum-n+s]);
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值