Submission #22072719

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import sys
sys.setrecursionlimit(10 ** 9) #再帰回数の限界を変更
K = int(input())
MAX = 3234566667 # 100000番目の値
Lun = []
def dfs(n):
    global Lun
    if n > MAX:
        # 100000番目まで調べればよいためreturn
        return
    Lun.append(n)
    ichi = n%10
    dfs(n*10+ichi)
    if ichi>0:
        dfs(n*10+ichi-1)
    if ichi<9:
        dfs(n*10+ichi+1)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import sys
sys.setrecursionlimit(10 ** 9) #再帰回数の限界を変更

K = int(input())
MAX = 3234566667 # 100000番目の値
Lun = []
def dfs(n):
    global Lun
    if n > MAX:
        # 100000番目まで調べればよいためreturn
        return
    Lun.append(n)
    ichi = n%10


    dfs(n*10+ichi)
    if ichi>0:
        dfs(n*10+ichi-1)
    if ichi<9:
        dfs(n*10+ichi+1)


for i in range(1,10):
    dfs(i)
Lun.sort()
print(Lun[K-1])

Submission Info

Judge Result