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}$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: