codeflash-internal/experiments/pie_test_set/p02720.py

36 lines
656 B
Python

def problem_p02720(input_data):
def d_lunlun_number():
import sys
sys.setrecursionlimit(10**6)
K = int(eval(input_data))
ans = []
def dfs(num, current, digit_max):
if current == digit_max:
ans.append(num)
return None
for n in range(10):
if abs((num % 10) - n) >= 2:
continue
dfs(num * 10 + n, current + 1, digit_max)
for leading in range(1, 10):
for d in range(1, 11):
dfs(leading, 1, d)
return sorted(ans)[K - 1]
return d_lunlun_number()