As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
对于正整数 $k$，定义毒假强数 $x$ 满足 $x\times(10^k-1)$ 的十进制表示不包含 $9$ 的正整数，你需要求出第 $n$ 个毒假强数。
一行两个整数 $k, n$。
一行一个整数表示第 $n$ 个毒假强数。
1 8
9
5 84
11235
| 子任务编号 | $k\leq$ | $n\leq$ | 分值 |
|---|---|---|---|
| $1$ | $3$ | $1000$ | $25$ |
| $2$ | $1$ | $10^{18}$ | $35$ |
| $3$ | ${18}$ | $10^{18}$ | $40$ |
对于所有数据，$1\leq k\leq {18}, 1\leq n\leq 10^{18}$。
We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.
You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.
STOP! Before you submit an issue, please READ the following guidelines: