Living Sequence
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
Description
In Japan, the number $4$ reads like death, so Bob decided to build a live sequence. Living sequence $a$ contains all natural numbers that do not contain the digit $4$. $a = [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, \ldots]$.
For example, the number $1235$ is part of the sequence $a$, but the numbers $4321$, $443$ are not part of the sequence $a$.
Bob realized that he does not know how to quickly search for a particular number by the position $k$ in the sequence, so he asks for your help.
For example, if Bob wants to find the number at position $k = 4$ (indexing from $1$), you need to answer $a_k = 5$.
The first line of input data contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.
In the only line of each test case, there is a single integer $k$ ($1 \le k \le 10^{12}$) — the position Bob is interested in.
For each test case, print on a separate line the number $a_k$ in indexing with $1$.
Input
The first line of input data contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.
In the only line of each test case, there is a single integer $k$ ($1 \le k \le 10^{12}$) — the position Bob is interested in.
Output
For each test case, print on a separate line the number $a_k$ in indexing with $1$.
7
3
5
22
10
100
12345
827264634912
3
6
25
11
121
18937
2932285320890
20240122 CF div3.1811
- Status
- Done
- Rule
- IOI
- Problem
- 8
- Start at
- 2024-1-22 10:00
- End at
- 2024-1-22 12:30
- Duration
- 2.5 hour(s)
- Host
-
梁泽贤 (liangzexian)
- Partic.
- 6