CF1811E.Living Sequence

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

In Japan, the number 44 reads like death, so Bob decided to build a live sequence. Living sequence aa contains all natural numbers that do not contain the digit 44 . a=[1,2,3,5,6,7,8,9,10,11,12,13,15,16,]a = [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, \ldots] .

For example, the number 12351235 is part of the sequence aa , but the numbers 43214321 , 443443 are not part of the sequence aa .

Bob realized that he does not know how to quickly search for a particular number by the position kk in the sequence, so he asks for your help.

For example, if Bob wants to find the number at position k=4k = 4 (indexing from 11 ), you need to answer ak=5a_k = 5 .

输入格式

The first line of input data contains a single integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases.

In the only line of each test case, there is a single integer kk ( 1k10121 \le k \le 10^{12} ) — the position Bob is interested in.

输出格式

For each test case, print on a separate line the number aka_k in indexing with 11 .

输入输出样例

  • 输入#1

    7
    3
    5
    22
    10
    100
    12345
    827264634912

    输出#1

    3
    6
    25
    11
    121
    18937
    2932285320890
首页