AtCoder Beginner Contest 161
D
Lunlun Number
AtCoder
⌀ 991
原题
← CE →
翻译中…

Problem Statement

翻译中…

A positive integer $X$ is said to be a lunlun number if and only if the following condition is satisfied:

翻译中…
  • In the base ten representation of $X$ (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most $1$.
翻译中…

For example, $1234$, $1$, and $334$ are lunlun numbers, while none of $31415$, $119$, or $13579$ is.

翻译中…

You are given a positive integer $K$. Find the $K$-th smallest lunlun number.

翻译中…

Constraints

翻译中…
  • $1 \leq K \leq 10^5$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

K

翻译中…

Output

翻译中…

Print the answer.

翻译中…

样例

Input #1
15
Output #1
23
We will list the $15$ smallest lunlun numbers in ascending order: $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $11$, $12$, $21$, $22$, $23$. Thus, the answer is $23$.
Input #2
1
Output #2
1
Input #3
13
Output #3
21
Input #4
100000
Output #4
3234566667
Note that the answer may not fit into the $32$-bit signed integer type.
题目信息
题号
abc161_d
时间限制
2 s
内存限制
1024 MB

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