Codeforces Round 695 (Div. 2)
A
Wizard of Orz
Codeforces
900
原题
←B →
翻译中…

There are $n$ digital panels placed in a straight line. Each panel can show any digit from $0$ to $9$. Initially, all panels show $0$.

翻译中…

Every second, the digit shown by each panel increases by $1$. In other words, at the end of every second, a panel that showed $9$ would now show $0$, a panel that showed $0$ would now show $1$, a panel that showed $1$ would now show $2$, and so on.

翻译中…

When a panel is paused, the digit displayed on the panel does not change in the subsequent seconds.

翻译中…

You must pause exactly one of these panels, at any second you wish. Then, the panels adjacent to it get paused one second later, the panels adjacent to those get paused $2$ seconds later, and so on. In other words, if you pause panel $x$, panel $y$ (for all valid $y$) would be paused exactly $|x−y|$ seconds later.

翻译中…

For example, suppose there are $4$ panels, and the $3$-rd panel is paused when the digit $9$ is on it.

翻译中…
  • The panel $1$ pauses $2$ seconds later, so it has the digit $1$;
  • the panel $2$ pauses $1$ second later, so it has the digit $0$;
  • the panel $4$ pauses $1$ second later, so it has the digit $0$.
翻译中…

The resulting $4$-digit number is $1090$. Note that this example is not optimal for $n = 4$.

翻译中…

Once all panels have been paused, you write the digits displayed on them from left to right, to form an $n$ digit number (it can consist of leading zeros). What is the largest possible number you can get? Initially, all panels show $0$.

翻译中…

Input

翻译中…

The first line of the input contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases. Each test case consists of a single line containing a single integer $n$ ($1 \le n \le 2\cdot10^5$).

翻译中…

It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot10^5$.

翻译中…

Output

翻译中…

For each test case, print the largest number you can achieve, if you pause one panel optimally.

翻译中…

Note

翻译中…

In the first test case, it is optimal to pause the first panel when the number $9$ is displayed on it.

翻译中…

In the second test case, it is optimal to pause the second panel when the number $8$ is displayed on it.

翻译中…

样例

Input #1
2
1
2
Output #1
9
98
InputCopy OutputCopy
题目信息
题号
1467A
时间限制
1 s
内存限制
256 MB
标签
构造
贪心
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。