input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
import heapq
def input(): return sys.stdin.readline().rstrip()
def main():
K = int(eval(input()))
q = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapq.heapify(q)
while len(q) < K:
K -= len(q)
new_q = []
for i in q:
d1 = int(str(i)[-1])
if d1 > 0:
new_q.append(i * 10 + d1 - 1)
new_q.append(i * 10 + d1)
if d1 < 9:
new_q.append(i * 10 + d1 + 1)
q = new_q
heapq.heapify(q)
print((q[K-1]))
if __name__ == '__main__':
main()
| import sys
import heapq
def input(): return sys.stdin.readline().rstrip()
def main():
K = int(eval(input()))
q = [1, 2, 3, 4, 5, 6, 7, 8, 9]
heapq.heapify(q)
while len(q) < K:
K -= len(q)
new_q = []
for i in q:
d1 = i % 10
if d1 > 0:
new_q.append(i * 10 + d1 - 1)
new_q.append(i * 10 + d1)
if d1 < 9:
new_q.append(i * 10 + d1 + 1)
q = new_q
heapq.heapify(q)
print((q[K-1]))
if __name__ == '__main__':
main()
| p02720 |
from collections import deque
k = int(eval(input()))
L = [1,2,3,4,5,6,7,8,9]
L = deque(L)
i = 0
while i < k:
if int(str(L[i])[-1]) == 0:
n2 = L[i]*10 + L[i]%10
n3 = L[i]*10 + L[i]%10 +1
L.append(n2)
L.append(n3)
elif 1 <= int(str(L[i])[-1]) <= 8:
n1 = L[i]*10 + L[i]%10 -1
n2 = L[i]*10 + L[i]%10
n3 = L[i]*10 + L[i]%10 +1
L.append(n1)
L.append(n2)
L.append(n3)
elif int(str(L[i])[-1]) == 9:
n1 = L[i]*10 + L[i]%10 -1
n2 = L[i]*10 + L[i]%10
L.append(n1)
L.append(n2)
i +=1
print((L[k-1]))
| k = int(eval(input()))
L = []
def lunlun(d,v,L):
L.append(v)
if d == 10:
return
for i in range(-1,2):
t = v%10 + i
#print(v)
if 0 <= t <=9:
lunlun(d+1,v*10+t,L)
#lunlun(1,1,L)
for v in range(1,10):
lunlun(1,v,L)
print((sorted(L)[k-1])) | p02720 |
k = int(eval(input()))
L = []
def lunlun(d,v,L):
L.append(v)
if d == 10:
return
for i in range(-1,2):
t = v%10 + i
#print(v)
if 0 <= t <=9:
lunlun(d+1,v*10+t,L)
#lunlun(1,1,L)
for v in range(1,10):
lunlun(1,v,L)
print((sorted(L)[k-1])) | from collections import deque
K = int(eval(input()))
q = [1, 2, 3, 4, 5, 6, 7, 8, 9]
q = deque(q)
def next_n(n):
if n == 0:
return [0, 1]
elif n == 9:
return [8, 9]
else:
return [n-1, n, n+1]
for _ in range(K-1):
now = q.popleft()
for next_ in next_n(now%10):
q.append(now*10 + next_)
print((q[0])) | p02720 |
import sys
from string import digits
k = int(sys.stdin.readline().rstrip())
def main():
if k <= 9:
print(k)
return
res = list(digits[1:])
r = k - 9
nex = []
while True:
for n in res:
o = ord(n[-1])
for i in range(-1, 2):
d = chr(o + i)
if d < '0' or d > '9': continue
nex.append(n + d)
r -= 1
if not r:
print((nex[-1]))
return
res = nex.copy()
nex.clear()
if __name__ == '__main__':
main() | import sys
k = int(sys.stdin.readline().rstrip())
def main(k):
if k <= 9:
print(k)
return
res = list(range(1, 10))
k -= 9
while True:
nex = []
for n in res:
r = n % 10
n *= 10
for i in range(-1, 2):
if 0 <= r + i <= 9:
nex.append(n + r + i)
k -= 1
if not k:
print((nex[-1]))
return
res = nex.copy()
if __name__ == '__main__':
main(k) | p02720 |
import heapq
K =int(eval(input()))
pque = []
for i in range(1, 10):
heapq.heappush(pque, i)
for i in range(K):
tmp = heapq.heappop(pque)
if tmp % 10 == 0:
heapq.heappush(pque, tmp * 10)
heapq.heappush(pque, tmp * 10 + 1)
elif tmp % 10 == 9:
heapq.heappush(pque, tmp * 10 + 9)
heapq.heappush(pque, tmp * 10 + 8)
else:
next_ = tmp % 10
heapq.heappush(pque, tmp * 10 + next_ - 1)
heapq.heappush(pque, tmp * 10 + next_)
heapq.heappush(pque, tmp * 10 + next_ + 1)
print (tmp)
| K = int(eval(input()))
if K <= 9:
print (K)
exit()
lst = [[1] * 11 for _ in range(2)]
lst_append = lst.append
lst[0][10] = 0
lst[1][0] = 0
lst[1][10] = 0
now = 9
p = 0
flag = 0
while True:
if p == 0:
lst[flag + 1][0] = lst[flag][0] + lst[flag][1]
p += 1
continue
tmp = lst[flag][p - 1] + lst[flag][p] + lst[flag][p + 1]
lst[flag + 1][p] = tmp
if now + tmp >= K:
break
now += tmp
p += 1
if p == 10:
p = 0
flag += 1
lst_append([0] * 11)
# print ('now', now)
# print ('p', p)
# print ('flag', flag)
# print (lst[0])
# print (lst[1])
#先頭がpでかつ現在地がnow
ans = str(p)
flag += 1
while True:
if flag == 0:
break
# print (p)
if p >= 1 and K <= now + lst[flag - 1][p - 1]:
flag -= 1
ans += str(p - 1)
p -= 1
elif K <= now + lst[flag - 1][p - 1] + lst[flag - 1][p]:
now += lst[flag - 1][p - 1]
flag -= 1
ans += str(p)
else:
now += lst[flag - 1][p - 1] + lst[flag - 1][p]
flag -= 1
ans += str(p + 1)
p += 1
print (ans)
# for tmp in lst:
# print (tmp)
| p02720 |
import queue
K = int(eval(input()))
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(K):
x = q.get()
a = x%10
if a !=0:
q.put(10*x +a -1)
q.put(10*x +a )
if a != 9:
q.put(10*x +a +1)
print(x) | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
k = int(eval(input()))
from collections import deque
que = deque(list(range(1, 10)))
for i in range(k):
now = que.popleft()
r = now%10
nx = now*10
if r == 0:
for j in [0, 1]:
que.append(nx+r+j)
elif r == 9:
for j in [-1, 0]:
que.append(nx+r+j)
else:
for j in [-1, 0, 1]:
que.append(nx+r+j)
print(now)
if __name__ == '__main__':
main() | p02720 |
k = int(eval(input()))
lunlun = []
def dfs(A):
if len(A) > 10:
return
else:
num = A[-1]
lunlun.append(int("".join(A)))
if num == "0":
for i in range(0, 2):
A.append(str(i))
dfs(A)
A.pop()
elif num == "9":
for i in range(8, 10):
A.append(str(i))
dfs(A)
A.pop()
else:
for i in range(int(num)-1, int(num)+2):
A.append(str(i))
dfs(A)
A.pop()
for i in range(1, 10):
dfs([str(i)])
lunlun.sort()
print((lunlun[k-1])) | k = int(eval(input()))
lunlun = []
def dfs(A):
if len(A) > 10:
return
else:
num = int(A[-1])
lunlun.append(int("".join(A)))
if num == 0:
for i in range(0, 2):
A.append(str(i))
dfs(A)
A.pop()
elif num == 9:
for i in range(8, 10):
A.append(str(i))
dfs(A)
A.pop()
else:
for i in range(num-1, num+2):
A.append(str(i))
dfs(A)
A.pop()
for i in range(1, 10):
dfs([str(i)])
lunlun.sort()
print((lunlun[k-1])) | p02720 |
k = int(eval(input()))
def hantei(n):
string = str(n)
length = len(string)
ret = True
for i in range(length-1):
if abs(int(string[i]) - int(string[i+1])) > 1:
ret = False
break
return ret
lst = [i for i in range(10)]
dic = {}
dic[1] = lst.copy()
keta = 2
while len(lst) < k+1:
new = []
for i in range(1, 10):
tasu = i*(10**(keta-1))
for j in sorted(dic.keys()):
temp_lst = dic[j]
bit = 0
for youso in temp_lst:
num = tasu + youso
if hantei(num):
new.append(num)
bit = 1
elif bit == 1:
break
dic[keta] = new.copy()
lst.extend(new)
keta += 1
print((lst[k])) | from collections import deque
k = int(eval(input()))
if 1 <= k and k <= 9:
print(k)
exit()
d = deque([i for i in range(1, 10)])
k -= 9
while k > 0:
num = d.popleft()
if num % 10 != 0:
new = 10*num + (num%10) - 1
d.append(new)
k -= 1
if k == 0: break
new = 10*num + (num%10)
d.append(new)
k -= 1
if k == 0: break
if num % 10 != 9:
new = 10*num + (num%10) + 1
d.append(new)
k -= 1
if k == 0: break
print(new) | p02720 |
from collections import deque
k = int(eval(input()))
if 1 <= k and k <= 9:
print(k)
exit()
d = deque([i for i in range(1, 10)])
k -= 9
while k > 0:
num = d.popleft()
if num % 10 != 0:
new = 10*num + (num%10) - 1
d.append(new)
k -= 1
if k == 0: break
new = 10*num + (num%10)
d.append(new)
k -= 1
if k == 0: break
if num % 10 != 9:
new = 10*num + (num%10) + 1
d.append(new)
k -= 1
if k == 0: break
print(new) | k = int(eval(input()))
if k <= 9:
print(k)
k -= 9
lst = list(range(1, 10))
while k > 0:
new = []
for num in lst:
amari = num % 10
if amari == 0:
new.append(num*10)
new.append(num*10+1)
elif amari == 9:
new.append(num*10+8)
new.append(num*10+9)
else:
new.append(num*10+(amari-1))
new.append(num*10+amari)
new.append(num*10+(amari+1))
if len(new) >= k:
print((new[k-1]))
exit()
else:
k -= len(new)
lst = new | p02720 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [eval(input()) for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(eval(input())) for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def isOK(A):
A.sort()
for i in range(len(A) - 1):
if A[i] + 1 != A[i + 1]:
return False
return True
def func(x):
return 1
def solve():
K = Scanner.int()
q = queue.deque()
for i in range(1, 9 + 1):
q.append(i)
for _ in range(K - 1):
x = q.popleft()
if x % 10 != 0:
q.append(x * 10 + x % 10 - 1)
q.append(x * 10 + x % 10)
if x % 10 != 9:
q.append(x * 10 + x % 10 + 1)
print((q.popleft()))
def main():
# sys.stdin = open("sample.txt")
solve()
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def divisor(n):
res = []
i = 1
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
@staticmethod
def round_up(a, b):
return -(-a // b)
@staticmethod
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
@staticmethod
def fact(N):
res = {}
tmp = N
for i in range(2, int(N ** 0.5 + 1) + 1):
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
if cnt > 0:
res[i] = cnt
if tmp != 1:
res[tmp] = 1
if res == {}:
res[N] = 1
return res
def pop_count(x):
x = x - ((x >> 1) & 0x5555555555555555)
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
x = x + (x >> 32)
return x & 0x0000007f
MOD = int(1e09) + 7
INF = int(1e15)
def solve():
K = Scanner.int()
d = deque()
for i in range(1, 10):
d.append(i)
MAX = 10 ** 5 + 100
for i in range(MAX):
n = d[i]
a = int(str(n)[-1])
if a != 0:
d.append(n * 10 + (a - 1))
d.append(n * 10 + a)
if a != 9:
d.append(n * 10 + (a + 1))
if len(d) >= K:
print((d[K - 1]))
return
def main():
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| p02720 |
from queue import Queue
k = int(eval(input()))
q = Queue()
Lunlun = []
for i in range(1, 10):
q.put(i)
while True:
if len(Lunlun) >= 10**5:
break
now = q.get()
Lunlun.append(now)
for i in range(-1, 2):
if (now % 10) + i < 0 or 9 < (now % 10) + i:
continue
q.put(now*10 + (now % 10) + i)
print((Lunlun[k-1])) | import collections
# from queue import Queue
k = int(eval(input()))
q = collections.deque()
Lunlun = []
for i in range(1, 10):
q.append(i)
while True:
if len(Lunlun) >= 10**5:
break
now = q.popleft()
Lunlun.append(now)
for i in range(-1, 2):
if (now % 10) + i < 0 or 9 < (now % 10) + i:
continue
q.append(now*10 + (now % 10) + i)
print((Lunlun[k-1]))
| p02720 |
import queue
N = int(eval(input()))
q = queue.Queue()
for i in range(1, 10):
q.put(i)
ans = 0
for i in range(N):
ans = q.get()
m = ans % 10
if ans % 10 != 0:
q.put(ans * 10 + m - 1)
q.put(ans * 10 + m)
if ans % 10 != 9:
q.put(ans * 10 + m + 1)
print(ans) | import sys
sys.setrecursionlimit(10**6)
def dfs(n):
if n > 3234566667:
return
ans.append(n)
if n % 10 != 0:
dfs(n * 10 + (n % 10) - 1)
dfs(n * 10 + (n % 10))
if n % 10 != 9:
dfs(n * 10 + (n % 10) + 1)
N = int(eval(input()))
ans = []
for i in range(1, 10):
dfs(i)
ans.sort()
print((ans[N - 1])) | p02720 |
def main():
K = int(eval(input()))
ans = set()
def rec(S):
if 3234566667 < int(S):
return
c = S[-1]
d = int(c)
for plus in range(d-1, d+2):
if plus < 0:
continue
ans.add(int(S+str(plus)))
rec(S+str(plus))
for i in range(1, 10):
ans.add(i)
rec(str(i))
ansc = ans.copy()
for a in ansc:
S = str(a)
pre = ""
for i, s in enumerate(S):
if i == 0:
pre = s
continue
if abs(int(pre) - int(s)) > 1:
ans.discard(a)
break
pre = s
answer = sorted(ans)
print((answer[K-1]))
if __name__ == '__main__':
main()
| def main():
K = int(eval(input()))
LL = set()
def dfs(s):
if 3234566667 < int(s):
return
c = int(s[-1])
for p in range(-1, 2):
if c+p < 0 or 9 < c+p:
continue
LL.add(int(s+str(c+p)))
dfs(s+str(c+p))
for s in "123456789":
LL.add(int(s))
dfs(s)
ans = sorted(LL)
print((ans[K-1]))
if __name__ == '__main__':
main()
| p02720 |
import sys
k = int(eval(input()))
if k <= 9:
print(k)
sys.exit()
def judge(s):
for i in range(1,len(s)):
if abs(int(s[i-1]) - int(s[i])) > 1:
return 0
return 1
q = ['1','2','3','4','5','6','7','8','9']
cnt = 9
cond = False
while True:
cp = q.pop(0)
digit = int(cp[-1])
for d in range(-1,2):
if 0 <= digit + d <= 9:
cnt += 1
if cnt == k:
ans = cp+str(digit+d)
cond = True
break
q.append(cp+str(digit+d))
if cond:
break
print(ans)
| import sys
from collections import deque
K = int(eval(input()))
if K <= 9:
print(K)
sys.exit()
q = deque(['1', '2','3','4','5','6','7','8','9'])
cnt = 0
while True:
cp = q.popleft()
cnt += 1
if cnt == K:
ans = int(cp)
break
r = int(cp[-1])
for d in [-1,0,1]:
dd = r + d
if 0 <= dd < 10:
q.append(cp + str(dd))
print(ans) | p02720 |
from collections import deque
K = int(eval(input()))
Queue = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
x = Queue[0]
Queue.popleft()
oneplace = x % 10
#(1の位の数)-1を付け加えた数を入れる
if oneplace == 0: #xの1の位が0
pass
else: #xの1の位が0でない
enqueue = x * 10 + (oneplace - 1)
Queue.append(enqueue)
#1の位の数を付け加えた数を入れる
enqueue = x * 10 + oneplace
Queue.append(enqueue)
#(1の位の数)+1を付け加えた数を入れる
if oneplace == 9: #xの1の位の数が9
pass
else:
enqueue = x * 10 + (oneplace + 1)
Queue.append(enqueue)
print(x) | k = int(eval(input()))
B = [1, 2, 3, 4, 5, 6, 7, 8, 9] #Before list
while len(B) < k:
k -= len(B)
#次の桁に更新
def update_next_digit(B:list)->list:
N = [] #New list
for i in range(len(B)):
op = B[i] % 10 #one place
for j in [-1, 0, 1]:
if 0 <= op+j and op+j <= 9:
N.append(B[i]*10+(op+j))
else:
pass
return N
N = update_next_digit(B)
B = N
ans = B[k-1]
print(ans)
| p02720 |
def main():
K = int(eval(input()))
lunlun = ["1", "2", "3", "4", "5", "6", "7", "8", "9"]
start1 = ["1"]
start2 = ["2"]
start3 = ["3"]
start4 = ["4"]
start5 = ["5"]
start6 = ["6"]
start7 = ["7"]
start8 = ["8"]
start9 = ["9"]
while len(lunlun) < 10 ** 5:
next_starts = []
for i in range(1, 10):
news = []
if i == 1:
for n in start1:
if len(n) == 1:
new_n = n + "0"
else:
if abs(int(n[0])) > 1 or abs(int(n[1])) > 1:
break
new_n = n[0] + "0" + n[1:]
lunlun.append(new_n)
news.append(new_n)
for n in start1:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start2:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 2:
for n in start1:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start2:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start3:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 3:
for n in start2:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start3:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start4:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 4:
for n in start3:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start4:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start5:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 5:
for n in start4:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start5:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start6:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 6:
for n in start5:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start6:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start7:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 7:
for n in start6:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start7:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start8:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 8:
for n in start7:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start8:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start9:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
elif i == 9:
for n in start8:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
for n in start9:
new_n = str(i) + n
lunlun.append(new_n)
news.append(new_n)
next_starts.append(news)
start1 = next_starts[0]
start2 = next_starts[1]
start3 = next_starts[2]
start4 = next_starts[3]
start5 = next_starts[4]
start6 = next_starts[5]
start7 = next_starts[6]
start8 = next_starts[7]
start9 = next_starts[8]
print((lunlun[K-1]))
main()
| from collections import deque
K = int(eval(input()))
queue = deque(["1", "2", "3", "4", "5", "6", "7", "8", "9"])
lunlun = ["1", "2", "3", "4", "5", "6", "7", "8", "9"]
while len(queue) < 10 ** 5:
n_str = queue.popleft()
last_c = n_str[len(n_str) - 1]
if last_c == "0":
queue.append(n_str + "0")
queue.append(n_str + "1")
lunlun.append(n_str + "0")
lunlun.append(n_str + "1")
elif last_c == "1":
queue.append(n_str + "0")
queue.append(n_str + "1")
queue.append(n_str + "2")
lunlun.append(n_str + "0")
lunlun.append(n_str + "1")
lunlun.append(n_str + "2")
elif last_c == "2":
queue.append(n_str + "1")
queue.append(n_str + "2")
queue.append(n_str + "3")
lunlun.append(n_str + "1")
lunlun.append(n_str + "2")
lunlun.append(n_str + "3")
elif last_c == "3":
queue.append(n_str + "2")
queue.append(n_str + "3")
queue.append(n_str + "4")
lunlun.append(n_str + "2")
lunlun.append(n_str + "3")
lunlun.append(n_str + "4")
elif last_c == "4":
queue.append(n_str + "3")
queue.append(n_str + "4")
queue.append(n_str + "5")
lunlun.append(n_str + "3")
lunlun.append(n_str + "4")
lunlun.append(n_str + "5")
elif last_c == "5":
queue.append(n_str + "4")
queue.append(n_str + "5")
queue.append(n_str + "6")
lunlun.append(n_str + "4")
lunlun.append(n_str + "5")
lunlun.append(n_str + "6")
elif last_c == "6":
queue.append(n_str + "5")
queue.append(n_str + "6")
queue.append(n_str + "7")
lunlun.append(n_str + "5")
lunlun.append(n_str + "6")
lunlun.append(n_str + "7")
elif last_c == "7":
queue.append(n_str + "6")
queue.append(n_str + "7")
queue.append(n_str + "8")
lunlun.append(n_str + "6")
lunlun.append(n_str + "7")
lunlun.append(n_str + "8")
elif last_c == "8":
queue.append(n_str + "7")
queue.append(n_str + "8")
queue.append(n_str + "9")
lunlun.append(n_str + "7")
lunlun.append(n_str + "8")
lunlun.append(n_str + "9")
elif last_c == "9":
queue.append(n_str + "8")
queue.append(n_str + "9")
lunlun.append(n_str + "8")
lunlun.append(n_str + "9")
print((lunlun[K-1]))
| p02720 |
K = int(input())
N = [0]
for _ in range(K):
i = 0
while i < len(N) and N[i] == 9:
i += 1
while i+1 < len(N) and N[i] == N[i+1]+1:
i += 1
if i == len(N):
N = [0]*len(N) + [1]
else:
N[i] += 1
i -= 1
while i >= 0:
N[i] = max(N[i+1]-1,0)
i -= 1
print(*reversed(N),sep='')
| from collections import deque
K = int(eval(input()))
q = deque(list(range(1,10)))
for _ in range(K):
x = q.popleft()
r = x%10
if r == 0:
q.append(x*10)
q.append(x*10+1)
elif r == 9:
q.append(x*10+8)
q.append(x*10+9)
else:
q.append(x*10+r-1)
q.append(x*10+r)
q.append(x*10+r+1)
print(x) | p02720 |
import copy
K = int(eval(input()))
ans, nex = [i for i in range(1, 10)], [i for i in range(1, 10)]
for i in range(10):
pre, nex = copy.deepcopy(nex), []
for p in pre:
if p % 10 != 0:
ans.append(p * 10 + p % 10 - 1)
nex.append(p * 10 + p % 10 - 1)
ans.append(p * 10 + p % 10)
nex.append(p * 10 + p % 10)
if p % 10 != 9:
ans.append(p * 10 + p % 10 + 1)
nex.append(p * 10 + p % 10 + 1)
ans.sort()
print((ans[K - 1]))
| from collections import deque
d = deque([9, 8, 7, 6, 5, 4, 3, 2, 1])
K = int(eval(input()))
for _ in range(K - 1):
i = d.pop()
if i % 10 != 0:
d.appendleft(i * 10 + i % 10 - 1)
d.appendleft(i * 10 + i % 10)
if i % 10 != 9:
d.appendleft(i * 10 + i % 10 + 1)
print((d.pop()))
| p02720 |
def pat(K,count,keta,num):
#print(str(num)+":"+str(count)+":"+str(keta))
if count == -1:
return -1
elif keta == 1:
if count == K-1:
print(num)
return count + 1
else:
return (count+1)
else:
if (int(num[-1])) -1 >= 0:
count = pat(K,count,keta-1,num+str(int(num[-1])-1))
count = pat(K,count,keta-1,num+num[-1])
if (int(num[-1])+1) <= 9:
count = pat(K,count,keta-1,num+str(int(num[-1])+1))
if count >=K:
return -1
else:
return count
K = int(eval(input()))
count = 0
ans = list()
keta = 0
while True:
keta += 1
for i in range(1,10):
count = pat(K,count,keta,str(i))
#print(count)
if count == -1:
break
if count == -1:
break
| def pat(K,count,keta,num):
#print(str(num)+":"+str(count)+":"+str(keta))
if count == -1:
return -1
elif keta == 1:
if count == K-1:
print(num)
return -1
else:
return (count+1)
else:
if (int(num[-1])) -1 >= 0:
count = pat(K,count,keta-1,num+str(int(num[-1])-1))
count = pat(K,count,keta-1,num+num[-1])
if (int(num[-1])+1) <= 9:
count = pat(K,count,keta-1,num+str(int(num[-1])+1))
return count
K = int(eval(input()))
count = 0
ans = list()
keta = 0
while True:
keta += 1
for i in range(1,10):
count = pat(K,count,keta,str(i))
#print(count)
if count == -1:
break
if count == -1:
break
| p02720 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
def is_lunlun(n):
s = str(n)
for i in range(len(s)-1):
if abs(int(s[i])-int(s[i+1])) > 1:
return False
return True
def slv(k):
n = 1
for _ in range(k-1):
j = 0
while True:
l = 10**j
t = 0
t += n + l
t -= (n+l) % l
m = (t % (10**(j+1))) // l
# print(t, j, m)
for i in range(j-1, -1, -1):
t += (10 ** i) * max(0, m-(j-i))
# print(t, j)
if is_lunlun(t):
n = t
break
else:
j+=1
# if j > 5:
# break
# print(n)
return n
def main():
K = read_int()
print(slv(K))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
def is_lunlun(n):
s = str(n)
for i in range(len(s)-1):
if abs(int(s[i])-int(s[i+1])) > 1:
return False
return True
def slv(k):
if k <= 9:
return k
lunlun = list(range(1, 10))
q = deque(lunlun)
while True:
n = q.popleft()
for i in (-1, 0, 1):
d = n % 10
if 0 <= d + i <= 9:
l = n * 10 + d+i
q.append(l)
lunlun.append(l)
if len(lunlun) == k:
return lunlun[-1]
def main():
K = read_int()
print(slv(K))
if __name__ == '__main__':
main()
| p02720 |
import sys
def input():
return sys.stdin.readline().strip()
def main():
K = int(eval(input()))
ans = list("123456789")
tmp = ans.copy()
while True:
tmp2 = []
for t in tmp:
for i in range(int(t[-1]) - 1, int(t[-1]) + 2):
if 0 <= i < 10:
tmp2.append(t + str(i))
tmp = tmp2.copy()
ans += tmp
if len(ans) >= K:
break
print((ans[K - 1]))
if __name__ == "__main__":
main()
| import collections
import sys
def input():
return sys.stdin.readline().strip()
def bfs(K):
q = collections.deque(list("123456789"))
ans = list("123456789")
while len(ans) < K:
n = q.popleft()
for i in range(int(n[-1]) - 1, int(n[-1]) + 2):
if 0 <= i < 10:
q.append(n + str(i))
ans.append(n + str(i))
return ans[K - 1]
def main():
K = int(eval(input()))
print((bfs(K)))
if __name__ == "__main__":
main()
| p02720 |
from collections import deque
k = int(eval(input()))
lunlun = deque([i for i in range(9, 0, -1)])
for i in range(k):
x = lunlun.pop()
if i == k - 1:
print(x)
next_lunlun = 10*x + (x % 10)
if x % 10 != 0:
lunlun.appendleft(next_lunlun - 1)
lunlun.appendleft(next_lunlun)
if x % 10 != 9:
lunlun.appendleft(next_lunlun + 1) | from collections import deque
k = int(eval(input()))
lunlun = deque(list(range(1, 10)))
for i in range(k):
x = lunlun.popleft()
next = 10*x + (x % 10)
if x % 10 != 0:
lunlun.append(next - 1)
lunlun.append(next)
if x % 10 != 9:
lunlun.append(next + 1)
print(x) | p02720 |
K = int(eval(input()))
def is_lunlun(i):
result = -1
n = [ord(c) -48 for c in str(i)]
for j in range(len(n) - 1):
if abs(n[j] - n[j + 1]) <= 1:
continue
if n[j] < n[j + 1]:
for k in range(j + 1, len(n)):
n[k] = 0
result = int(''.join(str(k) for k in n))
result += 10 ** (len(n) - (j + 1))
else:
result = int(''.join(str(k) for k in n))
result += 10 ** (len(n) - (j + 2))
break
return result
i = 1
while True:
#print(i)
t = is_lunlun(i)
if t == -1:
K -= 1
if K == 0:
print(i)
exit()
i += 1
else:
i = t
| K = int(eval(input()))
def is_lunlun(i):
result = -1
n = [ord(c) - 48 for c in str(i)]
for j in range(len(n) - 1):
if abs(n[j] - n[j + 1]) <= 1:
continue
if n[j] < n[j + 1]:
for k in range(j + 1, len(n)):
n[k] = max(n[k - 1] - 1, 0)
result = int(''.join(str(k) for k in n))
result += 10 ** (len(n) - (j + 1))
else:
result = int(''.join(str(k) for k in n))
result += 10 ** (len(n) - (j + 2))
break
return result
i = 1
while True:
# print(i)
t = is_lunlun(i)
if t == -1:
K -= 1
if K == 0:
print(i)
exit()
i += 1
else:
i = t
| p02720 |
K = int(eval(input()))
A = [1,2,3,4,5,6,7,8,9]
for i in range(len(A)):
if A[i] != 9:
for j in range(-1,2):
a = int(str(A[i]) + str(A[i]+j))
A.append(a)
else:
A.append(98)
A.append(99)
A.append(100)
A.append(101)
L1 = len(A.copy())
for i in range(10,L1):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L2 = len(A.copy())
for i in range(L1,L2):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B%10) + j))
A.append(a)
L3 = len(A.copy())
for i in range(L2,L3):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L4 = len(A.copy())
for i in range(L3,L4):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L5 = len(A.copy())
for i in range(L4,L5):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L6 = len(A.copy())
for i in range(L5,L6):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L7 = len(A.copy())
for i in range(L6,L7):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L8 = len(A.copy())
for i in range(L7,L8):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
A = sorted(A)
# print(A)
print((A[K-1]))
| K = int(eval(input()))
A = [1,2,3,4,5,6,7,8,9]
for i in range(len(A)):
if A[i] != 9:
for j in range(-1,2):
a = int(str(A[i]) + str(A[i]+j))
A.append(a)
else:
A.append(98)
A.append(99)
A.append(100)
A.append(101)
L1 = len(A.copy())
for i in range(10,L1):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L2 = len(A.copy())
for i in range(L1,L2):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B%10) + j))
A.append(a)
L3 = len(A.copy())
for i in range(L2,L3):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L4 = len(A.copy())
for i in range(L3,L4):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L5 = len(A.copy())
for i in range(L4,L5):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L6 = len(A.copy())
for i in range(L5,L6):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L7 = len(A.copy())
for i in range(L6,L7):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L8 = len(A.copy())
for i in range(L7,L8):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
print((A[K-1])) | p02720 |
K = int(eval(input()))
A = [1,2,3,4,5,6,7,8,9]
for i in range(len(A)):
if A[i] != 9:
for j in range(-1,2):
a = int(str(A[i]) + str(A[i]+j))
A.append(a)
else:
A.append(98)
A.append(99)
A.append(100)
A.append(101)
L1 = len(A.copy())
for i in range(10, L1):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L2 = len(A.copy())
for i in range(8):
for i in range(L1,L2):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L1 = L2
L2 = len(A.copy())
print((A[K-1])) | K = int(eval(input()))
A = [1,2,3,4,5,6,7,8,9]
for i in range(len(A)):
if A[i] != 9:
for j in range(-1,2):
a = int(str(A[i]) + str(A[i]+j))
A.append(a)
else:
A.append(98)
A.append(99)
A.append(100)
A.append(101)
L1 = 10
L2 = len(A.copy())
for i in range(8):
for i in range(L1,L2):
B = A[i]
if B % 10 == 0:
A.append(int(str(B) + '0'))
A.append(int(str(B) + '1'))
elif B % 10 == 9:
A.append(int(str(B) + '8'))
A.append(int(str(B) + '9'))
else:
for j in range(-1, 2):
a = int(str(B) + str((B % 10) + j))
A.append(a)
L1 = L2
L2 = len(A.copy())
print((A[K-1])) | p02720 |
from queue import Queue
k = int(eval(input()))
q = Queue()
for i in range(1, 10):
q.put(i)
for _ in range(k):
x = q.get()
if x % 10 != 0:
q.put(x*10 + x%10 - 1)
q.put(x*10 + x%10)
if x % 10 != 9:
q.put(x*10 + x%10 + 1)
print(x)
| from collections import deque
k = int(eval(input()))
q = deque(list(range(1, 10)))
for _ in range(k):
x = q.popleft()
if x % 10 != 0:
q.append(x*10 + x%10 - 1)
q.append(x*10 + x%10)
if x % 10 != 9:
q.append(x*10 + x%10 + 1)
print(x) | p02720 |
# Problem D - Lunlun Number
# input
K = int(eval(input()))
# initialization
num_queue = []
k = 1
# count
while True:
if k>=1 and k<=9: # 1桁の場合
num_queue.append(k)
k += 1
else: # 2桁以降の場合
min_num = str(num_queue.pop(0))
keta_1 = int(min_num[-1])
if keta_1==0:
for i in range(2):
tmp = int(min_num + str(i))
num_queue.append(tmp)
k += 1
if k>K:
break
elif keta_1==9:
for i in range(keta_1-1, keta_1+1):
tmp = int(min_num + str(i))
num_queue.append(tmp)
k += 1
if k>K:
break
else:
for i in range(keta_1-1, keta_1+2):
tmp = int(min_num + str(i))
num_queue.append(tmp)
k += 1
if k>K:
break
if k>K:
break
# output
print((num_queue[-1]))
| # Problem D - Lunlun Number
from collections import deque
# input
K = int(eval(input()))
# initialization
num_queue = deque()
k = 1
# count
while True:
if k>=1 and k<=9:
num_queue.append(k)
k += 1
else:
num = str(num_queue.popleft())
num_str = int(num[-1])
if num_str==0:
for i in range(2):
tmp = str(i)
num_queue.append(int(num + tmp))
k += 1
if k-1==K:
break
elif num_str==9:
for i in range(8,10):
tmp = str(i)
num_queue.append(int(num + tmp))
k += 1
if k-1==K:
break
else:
for i in range(num_str-1, num_str+2):
tmp = str(i)
num_queue.append(int(num + tmp))
k += 1
if k-1==K:
break
if k-1==K:
break
# output
print((num_queue[-1]))
| p02720 |
def dfs(d, r):
global l
if d == 11:
return
l.append(int(r))
for i in range(-1, 2):
tmp = int(r[-1]) + i
if 0 <= tmp <= 9:
dfs(d + 1, r + str(tmp))
k = int(eval(input()))
l = []
for i in range(1, 10):
dfs(0, str(i))
print((sorted(l)[k - 1])) | def dfs(d, r):
global l
if d == 11:
return
l.append(int(r))
for i in range(-1, 2):
tmp = int(r[-1]) + i
if 0 <= tmp <= 9:
dfs(d + 1, r + str(tmp))
k = int(eval(input()))
l = []
for i in range(1, 10):
dfs(1, str(i))
print((sorted(l)[k - 1])) | p02720 |
K = int(eval(input()))
lunlun_number_list = []
def dfs(N):
lunlun_number_list.append(N)
if len(str(N)) > 10:
return
now_int = int(str(N)[-1])
if now_int == 0:
for i in range(2):
dfs(N*10 + i)
elif now_int == 9:
for i in range(8, 10, 1):
dfs(N*10 + i)
else:
for i in range(now_int-1, now_int+2, 1):
dfs(N*10 + i)
for i in range(1, 10, 1):
dfs(i)
lunlun_number_list.sort()
print((lunlun_number_list[K-1]))
| import collections
K = int(eval(input()))
que = collections.deque()
for i in range(1, 10, 1):
que.append(i)
cnt = 0
for i in range(K):
x = que.popleft()
cnt += 1
if cnt == K:
print(x)
exit()
if x%10 == 0:
que.append(10*x+0)
que.append(10*x+1)
elif x%10 == 9:
que.append(10*x+8)
que.append(10*x+9)
else:
que.append(10*x+(x%10)-1)
que.append(10*x+(x%10)+0)
que.append(10*x+(x%10)+1)
| p02720 |
import os
import sys
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def is_ok(n):
s = str(n)
ok = True
for a, b in zip(s, s[1:]):
if not abs(int(a) - int(b)) <= 1:
return False
return True
@lru_cache(maxsize=None)
def rekkyo(n, d):
if d == 0:
return ['']
ret = []
if n > 0:
for s in rekkyo(n - 1, d - 1):
ret.append(str(n - 1) + s)
for s in rekkyo(n, d - 1):
ret.append(str(n) + s)
if n < 9:
for s in rekkyo(n + 1, d - 1):
ret.append(str(n + 1) + s)
return ret
K = int(sys.stdin.buffer.readline())
s = set()
for i in range(10):
for j in range(1,11):
a = rekkyo(i, j)
s |= set(a)
a = list(sorted(set(list(map(int, s)))))
print((a[K]))
# for aa in a:
# print(aa)
| import os
import sys
from collections import deque
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
# 解説
K = int(sys.stdin.buffer.readline())
que = deque(list(map(str, list(range(1, 10)))))
for _ in range(K - 1):
# print(que)
s = que.popleft()
d = int(s[-1])
if d > 0:
que.append(s + str(d - 1))
que.append(s + str(d))
if d < 9:
que.append(s + str(d + 1))
print((int(que[0])))
| p02720 |
K=int(eval(input()))
A=[1,2,3,4,5,6,7,8,9]+[0]*10*K
i=9
j=0
while i<K:
if A[j]%10!=0 and A[j]%10!=9:
A[i]=10*A[j]+A[j]%10-1;i+=1
A[i]=10*A[j]+A[j]%10;i+=1
A[i]=10*A[j]+A[j]%10+1;i+=1
elif A[j]%10==0:
A[i]=10*A[j]+A[j]%10;i+=1
A[i]=10*A[j]+A[j]%10+1;i+=1
else:
A[i]=10*A[j]+A[j]%10-1;i+=1
A[i]=10*A[j]+A[j]%10;i+=1
j+=1
print((A[K-1]))
| K=int(eval(input()))
A=[1,2,3,4,5,6,7,8,9]+[0]*K
i=9
j=0
while i<K:
if A[j]%10!=0 and A[j]%10!=9:
A[i]=10*A[j]+A[j]%10-1;i+=1
A[i]=10*A[j]+A[j]%10;i+=1
A[i]=10*A[j]+A[j]%10+1;i+=1
elif A[j]%10==0:
A[i]=10*A[j]+A[j]%10;i+=1
A[i]=10*A[j]+A[j]%10+1;i+=1
else:
A[i]=10*A[j]+A[j]%10-1;i+=1
A[i]=10*A[j]+A[j]%10;i+=1
j+=1
print((A[K-1])) | p02720 |
from heapq import heappop, heappush, heapify
K = int(eval(input()))
M = K
que = list(range(1, 10))
V = set()
heapify(que)
while M + 100 >= 0:
top = heappop(que)
if top in V:
continue
V.add(top)
M -= 1
top = str(top)
L = int(top[0])
R = int(top[-1])
for i in (L - 1, L, L + 1):
if 1 <= i <= 9:
heappush(que, int(str(i) + top))
for i in (R - 1, R, R + 1):
if 0 <= i <= 9:
heappush(que, int(top + str(i)))
V = [int(d) for d in V]
V.sort()
print((V[K - 1]))
| from collections import deque
K = int(eval(input()))
que = deque(list(map(str, list(range(1, 10)))))
while K > 1:
n = que.popleft()
K -= 1
R = int(n[-1])
for r in (R - 1, R, R + 1):
if 0 <= r <= 9:
que.append(n + str(r))
print((que[0]))
| p02720 |
from collections import deque
K = int(eval(input()))
que = deque(list(map(str, list(range(1, 10)))))
while K > 1:
n = que.popleft()
K -= 1
R = int(n[-1])
for r in (R - 1, R, R + 1):
if 0 <= r <= 9:
que.append(n + str(r))
print((que[0]))
| from collections import deque
K = int(eval(input()))
que = deque([i for i in range(1, 10)])
ans = []
while len(ans) <= K + 10:
now = que.popleft()
ans.append(now)
b = now % 10
for i in range(max(0, b - 1), min(10, b + 2)):
que.append(now * 10 + i)
ans.sort()
print((ans[K - 1]))
| p02720 |
from collections import deque
k=int(eval(input()))
num=[]
def dfs(lun):
#print(lun)
num.append(lun)
if lun>3234566667:
return
now=lun%10
for i in [-1,0,1]:
if 0<=now+i<=9:
dfs(lun*10+now+i)
for i in range(1,10):
dfs(i)
num.sort()
print((num[k-1]))
#print(num[0:k])
| from collections import deque
k=int(eval(input()))
d=deque([1,2,3,4,5,6,7,8,9])
num=[1,2,3,4,5,6,7,8,9]
while d:
now=d.popleft()
hitoketa=now%10
for i in [-1,0,1]:
if 0<=hitoketa+i<=9:
nxt=now*10+hitoketa+i
if nxt<=3234566667:
#print(nxt)
num.append(nxt)
d.append(nxt)
num.sort()
print((num[k-1]))
| p02720 |
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
K = int(eval(input()))
RUN = {
0:[0, 1],
1:[0, 1, 2],
2:[1, 2, 3],
3:[2, 3, 4],
4:[3, 4, 5],
5:[4, 5, 6],
6:[5, 6, 7],
7:[6, 7, 8],
8:[7, 8, 9],
9:[8, 9]
}
cnt = 0
def dfs(i, s, p, cnt):
if i == 0:
if s == 0:
return cnt
cnt += 1
if cnt == K:
print(s)
exit()
else:
return cnt
if s == 0:
for ii in range(10):
cnt = dfs(i-1, s+ii*10**(i-1), ii, cnt)
else:
for ii in RUN[p]:
cnt = dfs(i-1, s+ii*10**(i-1), ii, cnt)
return cnt
dfs(10, 0, 0, cnt) | import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
K = int(eval(input()))
RUN = {
0:[0, 1],
1:[0, 1, 2],
2:[1, 2, 3],
3:[2, 3, 4],
4:[3, 4, 5],
5:[4, 5, 6],
6:[5, 6, 7],
7:[6, 7, 8],
8:[7, 8, 9],
9:[8, 9]
}
cnt = -1
def dfs(i, s, p, cnt):
if i == 0:
cnt += 1
if cnt == K:
print(s)
exit()
else:
return cnt
if s == 0:
for ii in range(10):
cnt = dfs(i-1, s+ii*10**(i-1), ii, cnt)
else:
for ii in RUN[p]:
cnt = dfs(i-1, s+ii*10**(i-1), ii, cnt)
return cnt
dfs(10, 0, 0, cnt) | p02720 |
n=int(eval(input()))
query = [1, 2, 3, 4, 5, 6, 7, 8, 9]
if n <= 9:
print(n)
else:
count = 9
while count<=n:
i = query.pop(0)
if i%10-1>=0:
query.append(i*10+(i%10-1))
count += 1
if count == n:
print((i*10+(i%10-1)))
break
query.append(i*10+(i%10))
count += 1
if count == n:
print((i*10+(i%10)))
break
if i%10+1<=9:
query.append(i*10+(i%10+1))
count += 1
if count == n:
print((i*10+(i%10+1)))
break | from collections import deque
n=int(eval(input()))
if n < 10:
print(n)
else:
check_box = deque([1,2,3,4,5,6,7,8,9])
check_num = 9
while True:
add_num = check_box.popleft()
add_num = str(add_num)
if int(add_num[-1]) - 1 >= 0:
check_box.append(int(add_num + str(int(add_num[-1]) - 1)))
check_num += 1
if check_num == n:
print((add_num + str(int(add_num[-1]) - 1)))
exit()
check_num += 1
check_box.append(int(add_num + add_num[-1]))
if check_num == n:
print((add_num + add_num[-1]))
exit()
if int(add_num[-1]) + 1 <= 9:
check_box.append(int(add_num + str(int(add_num[-1]) + 1)))
check_num += 1
if check_num == n:
print((add_num + str(int(add_num[-1]) + 1)))
exit()
| p02720 |
from collections import deque
def main():
k = int(eval(input()))
if k <= 9:
print(k)
else:
queue = deque()
for i in range(1, 10):
queue.append(i)
flag = 1
cnt_lunlun = 9
while flag:
first_element = queue.popleft()
lunlun_nums = extend_lunlun(first_element)
for n in lunlun_nums:
queue.append(n)
cnt_lunlun += 1
if cnt_lunlun == k:
flag -= 1
break
print((queue.pop()))
def extend_lunlun(num):
last_digit = int(str(num)[-1])
if last_digit == 0:
return int(str(num)+"0"), int(str(num)+"1")
elif last_digit == 9:
return int(str(num) + "8"), int(str(num) + "9")
else:
return (
int(str(num) + str(last_digit - 1)),
int(str(num) + str(last_digit)),
int(str(num) + str(last_digit + 1))
)
if __name__ == "__main__":
main() | from collections import deque
def main():
k = int(eval(input()))
if k <= 9:
print(k)
else:
queue = deque()
for i in range(1, 10):
queue.append(i)
flag = 1
cnt_lunlun = 9
while flag:
first_element = queue.popleft()
lunlun_nums = extend_lunlun(first_element)
for n in lunlun_nums:
queue.append(n)
cnt_lunlun += 1
if cnt_lunlun == k:
flag -= 1
break
print((queue.pop()))
def extend_lunlun(num):
lunlun_nums = []
last_digit = num % 10
for i in range(-1, 2):
d = last_digit + i
if d >= 0 and d <= 9:
lunlun_nums.append(num*10+d)
return lunlun_nums
if __name__ == "__main__":
main() | p02720 |
# -*- coding: utf-8 -*-
# D - Lunlun Number
# 標準入力の取得
K = int(eval(input()))
# 求解
def get_lunlun_number_list(ln_list:list) -> list:
lunlun_number_list = []
for ln in ln_list:
one_place_value = ln % 10
lunlun_number_list.append(int(str(ln) + str(one_place_value)))
if one_place_value != 0:
lunlun_number_list.append(int(str(ln) + str(one_place_value-1)))
if one_place_value != 9:
lunlun_number_list.append(int(str(ln) + str(one_place_value+1)))
return lunlun_number_list
lunlun_number_list = []
lunlun_number_list1 = list(range(1, 10))
lunlun_number_list.extend(lunlun_number_list1)
lunlun_number_list2 = get_lunlun_number_list(lunlun_number_list1)
lunlun_number_list.extend(lunlun_number_list2)
lunlun_number_list3 = get_lunlun_number_list(lunlun_number_list2)
lunlun_number_list.extend(lunlun_number_list3)
lunlun_number_list4 = get_lunlun_number_list(lunlun_number_list3)
lunlun_number_list.extend(lunlun_number_list4)
lunlun_number_list5 = get_lunlun_number_list(lunlun_number_list4)
lunlun_number_list.extend(lunlun_number_list5)
lunlun_number_list6 = get_lunlun_number_list(lunlun_number_list5)
lunlun_number_list.extend(lunlun_number_list6)
lunlun_number_list7 = get_lunlun_number_list(lunlun_number_list6)
lunlun_number_list.extend(lunlun_number_list7)
lunlun_number_list8 = get_lunlun_number_list(lunlun_number_list7)
lunlun_number_list.extend(lunlun_number_list8)
lunlun_number_list9 = get_lunlun_number_list(lunlun_number_list8)
lunlun_number_list.extend(lunlun_number_list9)
lunlun_number_list10 = get_lunlun_number_list(lunlun_number_list9)
lunlun_number_list.extend(lunlun_number_list10)
lunlun_number_list = sorted(lunlun_number_list)
# 結果出力
print((lunlun_number_list[K-1])) | # -*- coding: utf-8 -*-
# D - Lunlun Number
# モジュールのインポート
from collections import deque
# 標準入力の取得
K = int(eval(input()))
# 求解処理
# 空のQueueを一つ用意し、1, 2, ・・・, 9を順にEnqueue
que = deque(list(range(1, 10)))
lunlun_number = 0
for k in range(K):
# Queueに対して、Dequeueを行う
x = que.popleft()
# x mod 10 ≠ 0なら、10x + (x mod 10) - 1をEnqueue
if x % 10 != 0:
que.append(10*x + (x%10) - 1)
# 10x + (x mod 10)をEnqueue
que.append(10*x + (x%10))
# x mod 10 ≠ 9なら、10x + (x mod 10) + 1をEnqueue
if x % 10 != 9:
que.append(10*x + (x%10) + 1)
# 上の操作をK回実施したときの値がLunlun Number
lunlun_number = x
print(lunlun_number) | p02720 |
import heapq
k = int(eval(input()))
num_list = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
mae = 0
if k <= 9:
print(k)
else:
k -= 9
q = []
heapq.heapify(q)
for i in range(1, 10):
heapq.heappush(q, i)
temp = 0
while temp < 9:
temp += 1
num = heapq.heappop(q)
if temp == 9:
heapq.heappush(q, num*10 + num_list[(num%10)-1])
heapq.heappush(q, num*10 + num_list[(num%10)])
else:
heapq.heappush(q, num*10 + num_list[(num%10)-1])
heapq.heappush(q, num*10 + num_list[(num%10)])
heapq.heappush(q, num*10 + num_list[(num%10)+1])
while k > 0:
k -= 1
num = heapq.heappop(q)
if num == mae:
k += 1
continue
elif num%10 == 0:
heapq.heappush(q, num*10 + num_list[(num%10)])
heapq.heappush(q, num*10 + num_list[(num%10)+1])
elif num%10 == 9:
heapq.heappush(q, num*10 + num_list[(num%10)-1])
heapq.heappush(q, num*10 + num_list[(num%10)])
else:
heapq.heappush(q, num*10 + num_list[(num%10)-1])
heapq.heappush(q, num*10 + num_list[(num%10)])
heapq.heappush(q, num*10 + num_list[(num%10)+1])
mae = num
print(num)
| from collections import deque
k = int(eval(input()))
cnt = 9
q = deque([])
for i in range(1,10):
q.append(i)
ans = 0
if k < 10:
print(k)
else:
while cnt != k:
n = q.popleft()
if n%10 == 0:
tmp = n*10
q.append(n*10)
cnt += 1
if cnt == k:
print(tmp)
break
q.append(1+tmp)
cnt += 1
if cnt == k:
print((tmp+1))
break
elif n%10 == 9:
tmp = n*10
q.append(tmp+8)
cnt+=1
if cnt == k:
print((tmp+8))
break
q.append(tmp+9)
cnt += 1
if cnt == k:
print((tmp+9))
break
else:
tmp = n%10
q.append(tmp-1+(n*10))
cnt += 1
if cnt ==k:
print((tmp-1+(n*10)))
break
q.append(tmp+(n*10))
cnt +=1
if cnt == k:
print((tmp+(n*10)))
break
q.append(tmp+1+(n*10))
cnt += 1
if cnt == k:
print((tmp+1+(n*10)))
break
| p02720 |
# ABC161D
def f(k):
if 1 <= k <= 9:
print(k)
else:
nxt = [[0,1], [0,1,2], [1,2,3], [2,3,4], [3,4,5], [4,5,6], [5,6,7], [6,7,8], [7,8,9], [8,9]]
cum_npi = [0, 9, 35, 110, 327, 956, 2782, 8089, 23527, 68468, 199368]
for length, begin in enumerate(cum_npi):
if k < begin:
found = cum_npi[length - 1]
break
begin = 10 ** (length - 1)
length, begin, found
k -= found
x = [[]] * (length + 1)
x[1] = list(range(1, 10))
x
terminate = False
i = 1
while True:
#print(f"a) i = {i} x = {x}")
if len(x[i]): # len(x[i])
digit = x[i][0]
if i < length: # i, length
i += 1
x[i] = nxt[digit].copy()
#print(f"x) digit = {digit} nxt[digit] = {nxt[digit]} i = {i} x[i] = {x[i]}")
#print(f"b) i = {i} x = {x}")
if i == length: # i, length
while len(x[i]): # i, x[i]
k -= 1
#print(f"c) i = {i} x = {x}, k = {k}")
if k == 0:
x.pop(0)
#print("answer =", x)
ans = "".join([str(j.pop(0)) for j in x])
print(ans)
terminate = True
break
else:
x[i].pop(0)
#print(f"d) i = {i} x = {x}")
else:
#print(f"e) i = {i} x = {x}")
while len(x[i]) == 0:
i -= 1
x[i].pop(0)
if terminate:
break
f(int(eval(input())))
| # ABC161D
def f(k):
if 1 <= k <= 9:
print(k)
else:
nxt = [[0,1], [0,1,2], [1,2,3], [2,3,4], [3,4,5], [4,5,6], [5,6,7], [6,7,8], [7,8,9], [8,9]]
cum_npi = [0, 9, 35, 110, 327, 956, 2782, 8089, 23527, 68468, 199368]
for length, begin in enumerate(cum_npi):
if k < begin:
found = cum_npi[length - 1]
break
begin = 10 ** (length - 1)
# length, begin, found
k -= found
x = [[]] * (length + 1)
x[1] = list(range(1, 10))
# x
terminate = False
i = 1
while True:
#print(f"a) i = {i} x = {x}")
if len(x[i]): # len(x[i])
digit = x[i][0]
if i < length: # i, length
i += 1
x[i] = nxt[digit].copy()
#print(f"x) digit = {digit} nxt[digit] = {nxt[digit]} i = {i} x[i] = {x[i]}")
#print(f"b) i = {i} x = {x}")
if i == length: # i, length
while len(x[i]): # i, x[i]
k -= 1
#print(f"c) i = {i} x = {x}, k = {k}")
if k == 0:
x.pop(0)
#print("answer =", x)
ans = "".join([str(j.pop(0)) for j in x])
print(ans)
terminate = True
break
else:
x[i].pop(0)
#print(f"d) i = {i} x = {x}")
else:
#print(f"e) i = {i} x = {x}")
while len(x[i]) == 0:
i -= 1
x[i].pop(0)
if terminate:
break
f(int(eval(input())))
| p02720 |
from collections import deque
a=int(eval(input()))
q=deque([1,2,3,4,5,6,7,8,9])
def dfs(k):
while k<=a:
s=q.popleft()
if s%10-1>=0:
q.append(s*10+s%10-1)
k=k+1
if k==a:
print((q.pop()))
q.append(s*10+s%10)
k=k+1
if k==a:
print((q.pop()))
if s%10+1<=9:
q.append(s*10+s%10+1)
k=k+1
if k==a:
print((q.pop()))
if a<=9:
print(a)
else:
dfs(9)
| from collections import deque
q=deque([1,2,3,4,5,6,7,8,9])
n=int(eval(input()))
def check(k):
while k<=n:
a=q.popleft()
if a%10-1>=0:
q.append(a*10+a%10-1)
k=k+1
if k==n:
return a*10+a%10-1
k=k+1
q.append(a*10+a%10)
if k==n:
return a*10+a%10
if a%10+1<=9:
q.append(a*10+a%10+1)
k=k+1
if k==n:
return a*10+a%10+1
if n<=9:
print(n)
else:
print((check(9)))
| p02720 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
from itertools import product
def bisection(l,r,f,left=True,discrete=True):
eps=1 if(discrete) else 10**-8
if((not left)^f(r)): return r if(left) else r+1
elif(left^f(l)): return l-1 if(left) else l
while(r-l>eps):
h=(l+r)//2 if(discrete) else (l+r)/2
if((not left)^f(h)): l=h
else: r=h
return (l+r)/2 if(not discrete) else l if(left) else r
def resolve():
k = int(eval(input()))
def check(x):
if 1 <= x <= 9:
return x >= k
x = str(x)
dp = [[0] * 2 for _ in range(10)]
s = int(x[0])
for i in range(1, s):
dp[i][1] = 1
dp[s][0] = 1
x = x[1:]
for s in x:
s = int(s)
ndp = [[0] * 2 for _ in range(10)]
for d, lt in product(list(range(10)), list(range(2))):
for nd in [d-1, d, d+1]:
if not (0 <= nd <= 9):
continue
if lt == 0 and s < nd:
continue
nlt = max(lt, s > nd)
ndp[nd][nlt] += dp[d][lt]
for d in range(1, 10):
ndp[d][1] += 1
dp = ndp
return sum(dp[d][lt] for d, lt in product(list(range(10)), list(range(2)))) >= k
print((bisection(1, 10**18+1, check, left=False)))
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
from itertools import product
def bisection(l,r,f,left=True,discrete=True):
eps=1 if(discrete) else 10**-8
if((not left)^f(r)): return r if(left) else r+1
elif(left^f(l)): return l-1 if(left) else l
while(r-l>eps):
h=(l+r)//2 if(discrete) else (l+r)/2
if((not left)^f(h)): l=h
else: r=h
return (l+r)/2 if(not discrete) else l if(left) else r
def resolve():
k = int(eval(input()))
def check(x):
x = str(x)
dp = [[0] * 2 for _ in range(10)]
s = int(x[0])
for i in range(1, s):
dp[i][1] = 1
dp[s][0] = 1
x = x[1:]
for s in x:
s = int(s)
ndp = [[0] * 2 for _ in range(10)]
for d, lt in product(list(range(10)), list(range(2))):
for nd in [d-1, d, d+1]:
if not (0 <= nd <= 9):
continue
if lt == 0 and s < nd:
continue
nlt = max(lt, s > nd)
ndp[nd][nlt] += dp[d][lt]
for d in range(1, 10):
ndp[d][1] += 1
dp = ndp
return sum(dp[d][lt] for d, lt in product(list(range(10)), list(range(2)))) >= k
print((bisection(1, 10**18+1, check, left=False)))
resolve() | p02720 |
from collections import deque
K = int(eval(input()))
Q = deque([i for i in range(1,10)])
for _ in range(K-1):
q = Q.popleft()
if q%10 != 0:
Q.append(10*q+(q%10)-1)
Q.append(10*q+(q%10))
if q%10 != 9:
Q.append(10*q+(q%10)+1)
print((Q.popleft())) | from collections import deque
K = int(eval(input()))
Q = deque([i for i in range(1,10)])
for _ in range(K-1):
q = Q.popleft()
if q%10 != 0:
Q.append(q*10+q%10-1)
Q.append(q*10+q%10)
if q%10 != 9:
Q.append(q*10+q%10+1)
print((Q.popleft())) | p02720 |
from collections import deque
K = int(eval(input()))
Q = deque([i for i in range(1,10)])
for _ in range(K-1):
q = Q.popleft()
if q%10 != 0:
Q.append(q*10+q%10-1)
Q.append(q*10+q%10)
if q%10 != 9:
Q.append(q*10+q%10+1)
print((Q.popleft())) | from collections import deque
K = int(eval(input()))
q = deque([1,2,3,4,5,6,7,8,9])
for i in range(K):
num = q.popleft()
if num%10 != 0:
q.append(num*10+num%10-1)
q.append(num*10+num%10)
if num%10 != 9:
q.append(num*10+num%10+1)
print(num) | p02720 |
c = 0
K = int(eval(input()))
for i in range(1,10):
c += 1
if c == K:
print(i)
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
c += 1
if c == K:
print((10*i+j))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
c += 1
if c == K:
print((100*i+10*j+k))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
c += 1
if c == K:
print((1000*i+100*j+10*k+l))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
for m in range(max(l-1,0),min(l+2,10)):
c += 1
if c == K:
print((10000*i+1000*j+100*k+10*l+m))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
for m in range(max(l-1,0),min(l+2,10)):
for n in range(max(m-1,0),min(m+2,10)):
c += 1
if c == K:
print((100000*i+10000*j+1000*k+100*l+10*m+n))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
for m in range(max(l-1,0),min(l+2,10)):
for n in range(max(m-1,0),min(m+2,10)):
for o in range(max(n-1,0),min(n+2,10)):
c += 1
if c == K:
print((1000000*i+100000*j+10000*k+1000*l+100*m+10*n+o))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
for m in range(max(l-1,0),min(l+2,10)):
for n in range(max(m-1,0),min(m+2,10)):
for o in range(max(n-1,0),min(n+2,10)):
for q in range(max(o-1,0),min(o+2,10)):
c += 1
if c == K:
print((10000000*i+1000000*j+100000*k+10000*l+1000*m+100*n+10*o+q))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
for m in range(max(l-1,0),min(l+2,10)):
for n in range(max(m-1,0),min(m+2,10)):
for o in range(max(n-1,0),min(n+2,10)):
for q in range(max(o-1,0),min(o+2,10)):
for t in range(max(q-1,0),min(q+2,10)):
c += 1
if c == K:
print((100000000*i+10000000*j+1000000*k+100000*l+10000*m+1000*n+100*o+10*q+t))
for i in range(1,10):
for j in range(i-1,min(i+2,10)):
for k in range(max(j-1,0),min(j+2,10)):
for l in range(max(k-1,0),min(k+2,10)):
for m in range(max(l-1,0),min(l+2,10)):
for n in range(max(m-1,0),min(m+2,10)):
for o in range(max(n-1,0),min(n+2,10)):
for q in range(max(o-1,0),min(o+2,10)):
for t in range(max(q-1,0),min(q+2,10)):
for y in range(max(t-1,0),min(t+2,10)):
c += 1
if c == K:
print((1000000000*i+100000000*j+10000000*k+1000000*l+100000*m+10000*n+1000*o+100*q+10*t+y)) | import sys
from _collections import deque
K = int(eval(input()))
c = 9
A = [1,2,3,4,5,6,7,8,9]
q = deque(A)
if K <= 9:
print(K)
else:
while(True):
a = q.popleft()
if a % 10 == 0:
c += 1
if c == K:
print((a*10))
sys.exit()
q.append(a*10)
c += 1
if c == K:
print((a*10+1))
sys.exit()
q.append(a*10+1)
elif a % 10 == 9:
c += 1
if c == K:
print((a*10+9-1))
sys.exit()
q.append(a*10+9-1)
c += 1
if c == K:
print((a*10+9))
sys.exit()
q.append(a*10+9)
else:
c += 1
if c == K:
print((a*10+a%10-1))
sys.exit()
q.append(a*10+a%10-1)
c += 1
if c == K:
print((a*10+a%10))
sys.exit()
q.append(a*10+a%10)
c += 1
if c == K:
print((a*10+a%10+1))
sys.exit()
q.append(a*10+a%10+1) | p02720 |
# import numpy as np
# import math
# import copy
from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
K = int(eval(input()))
queue = deque()
for i in range(1,10):
queue.append(i)
for i in range(K):
x = queue.popleft()
d = x % 10
temp = 10 * x + d
if d != 0:
queue.append(temp - 1)
queue.append(temp)
if d != 9:
queue.append(temp + 1)
print(x)
main()
| # import numpy as np
# import math
# import copy
from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
K = int(eval(input()))
pre = [i for i in range(1,10)]
now = []
if K <= 10:
print(K)
sys.exit()
count = 9
for i in range(2,11):
for j in pre:
for k in range(-1,2):
d = j % 10 + k
if (d < 0) | (d > 9):
continue
temp = j * 10 + d
now.append(temp)
count += 1
if count == K:
print(temp)
sys.exit()
pre = now
main()
| p02720 |
import sys
def is_lunlun(x):
x_str = str(x)
for i in range(len(x_str)-1):
if abs(int(x_str[i]) - int(x_str[i+1])) > 1:
return False
return True
def main():
k = int(eval(input()))
lunlun_map = {
0: [0, 1],
1: [0, 1, 2],
2: [1, 2, 3],
3: [2, 3, 4],
4: [3, 4, 5],
5: [4, 5, 6],
6: [5, 6, 7],
7: [6, 7, 8],
8: [7, 8, 9],
9: [8, 9]
}
if k < 10:
print(k)
sys.exit()
count = 9
all_lunluns = [list(range(1, 10))]
i = 0
while True:
for lunlun in all_lunluns[i]:
least = int(str(lunlun)[-1])
lunluns = []
for j in lunlun_map[least]:
new_lunlun = int(str(lunlun) + str(j))
lunluns.append(new_lunlun)
count += 1
if count == k:
print(new_lunlun)
sys.exit(0)
all_lunluns.append(lunluns)
i += 1
if __name__ == "__main__":
main() | # Assumed solution
from collections import deque
def main():
k = int(eval(input()))
queue = deque()
for i in range(1, 10):
queue.append(i)
l = 0
for _ in range(k):
l = queue.popleft()
r = l % 10
if r != 0:
queue.append(l * 10 + r - 1)
queue.append(l * 10 + r)
if r != 9:
queue.append(l * 10 + r + 1)
print(l)
if __name__ == "__main__":
main()
| p02720 |
K=int(eval(input()))
u12 = [i for i in range(1,10)]
ans = 0
for i in range(K):
if ans <=11:
ans += 1
continue
flg = True
l = len(str(ans))
for j in range(l-1,-1,-1):
if 0<j<l-1:
x,y,z = list(map(int,str(ans)[j-1:j+2]))
if y!=9 and abs(x-(y+1))<=1 and abs((y+1)-z)<=1:
ans = int(str(ans)[:j]+''.join([str(max(0,y+1-i)) for i in range(l-j)]))
flg = False
break
elif j==0:
x,y = list(map(int,str(ans)[:2]))
if x != 9 and abs(x+1-y) <=1:
ans = int(''.join([str(max(0,x+1-i))for i in range(l)]))
flg = False
break
else:
x,y = list(map(int,str(ans)[-2:]))
if y != 9 and abs(x-(y+1))<=1:
ans += 1
flg = False
break
if flg:
ans = 10**l
print(ans) | from collections import deque
K=int(eval(input()))
ans =deque([i for i in range(1,10)])
for i in range(K):
x = ans.popleft()
mod_x=x%10
if mod_x != 0:
ans.append(x*10+mod_x-1)
ans.append(x*10+mod_x)
if x%10!=9:
ans.append(x*10+mod_x+1)
print(x) | p02720 |
k=int(eval(input()))
if k<=9:
print(k)
exit(0)
ans=[1,2,3,4,5,6,7,8,9]
i=0
while len(ans)<k:
v=str(ans[i])
n=len(v)
#最後の桁
v_last=int(v[-1])
if v_last==0:
ans.append(int(v+'0'))
ans.append(int(v+'1'))
elif v_last==9:
ans.append(int(v+'8'))
ans.append(int(v+'9'))
else:
ans.append(int(v+str(v_last-1)))
ans.append(int(v+str(v_last)))
ans.append(int(v+str(v_last+1)))
i+=1
print((ans[k-1]))
| k=int(eval(input()))
if k<=9:
print(k)
exit(0)
ans=[1,2,3,4,5,6,7,8,9]
i=0
while len(ans)<k:
v=ans[i]
mod=v%10
if mod==0:
ans.append(10*v+mod)
ans.append(10*v+mod+1)
elif mod==9:
ans.append(10*v+mod-1)
ans.append(10*v+mod)
else:
ans.append(10*v+mod-1)
ans.append(10*v+mod)
ans.append(10*v+mod+1)
i+=1
print((ans[k-1]))
| p02720 |
from collections import deque
K = int(eval(input()))
d = deque([1,2,3,4,5,6,7,8,9])
ansq = deque([1,2,3,4,5,6,7,8,9])
while len(ansq)<=K:
num = d.popleft()
if str(num)[-1] == "0":
d.append(num*10)
d.append(num*10+1)
ansq.append(num*10)
ansq.append(num*10+1)
continue
if str(num)[-1] == "9":
d.append(num*10+8)
d.append(num*10+9)
ansq.append(num*10+8)
ansq.append(num*10+9)
continue
d.append(num*10+int(str(num)[-1])-1)
d.append(num*10+int(str(num)[-1]))
d.append(num*10+int(str(num)[-1])+1)
ansq.append(num*10+int(str(num)[-1])-1)
ansq.append(num*10+int(str(num)[-1]))
ansq.append(num*10+int(str(num)[-1])+1)
print((ansq[K-1])) | from collections import deque
K = int(eval(input()))
d = deque([1,2,3,4,5,6,7,8,9])
ansq = deque([1,2,3,4,5,6,7,8,9])
while len(ansq)<=K:
num = d.popleft()
if str(num)[-1] == "0":
da = num*10
db = num*10+1
d.append(da)
d.append(db)
ansq.append(da)
ansq.append(db)
continue
if str(num)[-1] == "9":
da = num*10+8
db = num*10+9
d.append(da)
d.append(db)
ansq.append(da)
ansq.append(db)
continue
da = num*10+int(str(num)[-1])-1
db = num*10+int(str(num)[-1])
dc = num*10+int(str(num)[-1])+1
d.append(da)
d.append(db)
d.append(dc)
ansq.append(da)
ansq.append(db)
ansq.append(dc)
print((ansq[K-1])) | p02720 |
k = int(eval(input()))
a = []
def dfs(x):
a.append(x)
if x > 3234566667:
return
for i in range(10):
if abs(x % 10 - i) <= 1:
dfs(x * 10 + i)
for i in range(1, 10):
dfs(i)
a = sorted(a)
print((a[k - 1]))
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
k = int(eval(input()))
res = []
def dfs(x):
res.append(x)
if len(str(x)) == 10:
return
for i in range(10):
if abs(x % 10 - i) <= 1:
dfs(x * 10 + i)
return
for i in range(1, 10):
dfs(i)
res.sort()
print((res[k - 1]))
if __name__ == '__main__':
resolve()
| p02720 |
k = int(eval(input()))
# キュー
from collections import deque
d = deque()
for i in range(1,10):
d.append(i)
for i in range(k):
tmp = d.popleft()
right = tmp%10
if(right!=0):
d.append(tmp*10+right-1)
d.append(tmp*10+right)
if(right!=9):
d.append(tmp*10+right+1)
print(tmp) | k = int(eval(input()))
def calc_dp(n):
if(n==0):
return 0
s = str(n)
slen = len(s)
dp = [[0] * 12 for _ in range(slen)]
dp_o = [[0] * 12 for _ in range(slen)]
#initial
for i in range(1,int(s[0])):
dp[0][i+1] = 1
dp_o[0][int(s[0])+1] = 1
#update
for i in range(slen-1):
for j in range(1,11):
dp[i+1][j] = dp[i][j-1] + dp[i][j] + dp[i][j+1] +1
dp[i+1][1] -= 1
s_b = int(s[i])
s_n = int(s[i+1])
for j in range( max(0,s_b-1), min(10, s_b+2) ):
if(j < s_n ):
dp[i+1][j+1] += dp_o[i][s_b+1]
elif(j == s_n):
dp_o[i+1][j+1] += dp_o[i][s_b+1]
ans = 0
for i in range(1,11):
ans += dp[-1][i] + dp_o[-1][i]
return ans
min_ = 0
max_ = 3234566676
for i in range(100):
tmp = (min_+max_)//2
tmp_c = calc_dp(tmp)
if(k > tmp_c):
min_ = tmp
else:
max_ = tmp
if(max_ - min_ == 1 ):
break
print(max_) | p02720 |
ln_l = [1,2,3,4,5,6,7,8,9]
def dps(curr_num):
end_num = curr_num[-1]
for i in [-1,0,1]:
added_num = int(end_num) + i
if added_num == -1 or added_num == 10:
continue
curr_num_plus = curr_num + str(added_num)
ln_l.append(int(curr_num_plus))
if len(curr_num_plus) < 10:
dps(curr_num_plus)
def main():
k = int(eval(input()))
for i in range(1,9+1):
dps(str(i))
ln_l.sort()
print((ln_l[k-1]))
if __name__ == "__main__":
main() | def dfs(lls, curr_num, lim):
if curr_num > lim: return
lls.append(curr_num)
last_num = int(str(curr_num)[-1])
if last_num > 0:
dfs(lls, curr_num*10+last_num-1, lim)
if last_num < 9:
dfs(lls, curr_num*10+last_num+1, lim)
dfs(lls, curr_num*10+last_num, lim)
def main():
k = int(eval(input()))
lls = []
for i in range(1,10):
dfs(lls, i, 3234566668)
lls.sort()
print((lls[k-1]))
if __name__ == "__main__":
main() | p02720 |
def runrun(K,S):
if K <= len(S):
S.sort()
##print(S)
print((S[K-1]))
return
else:
for i in range(len(S)):
tmp = S[i]%10
if tmp == 9:
S.append(S[i]*10+8)
S.append(S[i]*10+9)
elif tmp == 0:
S.append(S[i]*10+1)
S.append(S[i]*10)
else:
S.append(S[i]*10+tmp-1)
S.append(S[i]*10+tmp)
S.append(S[i]*10+tmp+1)
S = list(set(S))
runrun(K,S)
if __name__ == "__main__":
K = int(eval(input()))
S = []
for i in range(1,10):
S.append(i)
runrun(K,S) | def lunlun(K,S):
if len(S) >= K:
S.sort()
print((S[K-1]))
return
for a in range(len(S)):
i = S[a]
rem = i%10
n = 10*i + rem
if rem == 9:
S.append(n)
S.append(n-1)
elif rem == 0:
S.append(n)
S.append(n+1)
else:
S.append(n)
S.append(n+1)
S.append(n-1)
lunlun(K,list(set(S)))
K = int(eval(input()))
S = [i for i in range(1,10)]
lunlun(K,S) | p02720 |
from collections import deque
K = int(eval(input()))
cnt = 0
q = deque()
for i in range(1, 10):
q.append(i)
while cnt < K:
num = q.popleft()
cnt += 1
if num%10 > 0:
q.append(10*num+(num%10)-1)
q.append(10*num+(num%10))
if num%10 < 9:
q.append(10*num+(num%10)+1)
print(num) | K = int(eval(input()))
def f(n, k, a):
if k == n:
return 1
res = 0
res += f(n, k+1, a)
if a > 0:
res += f(n, k+1, a-1)
if a < 9:
res += f(n, k+1, a+1)
return res
cnt = 0
for n in range(1, 12):
c2 = 0
for a in range(1, 10):
c2 += f(n, 1, a)
if cnt+c2 >= K:
num = n
ini = a
cnt += c2-f(n, 1, a)
c2 = -1
break
if c2 < 0:
break
cnt += c2
ans = [ini]
for k in range(2, num+1):
for a in range(max(0, ans[-1]-1), min(10, ans[-1]+2)):
cnt += f(num, k, a)
if cnt >= K:
ans.append(a)
cnt -= f(num, k, a)
break
for i in range(len(ans)):
ans[i] = str(ans[i])
print(("".join(ans))) | p02720 |
import sys
from collections import deque
input = sys.stdin.readline
n=int(eval(input()))
L=deque(list(range(1,10)))
if n<=9:
ans = L[n-1]
else:
cnt = 9
for i in range(1,n):
c=L.popleft()
if c%10!=0:
L.append(c*10+(c%10)-1)
cnt+=1
if cnt>=n:
break
L.append(c*10+(c%10))
cnt+=1
if cnt>=n:
break
if c%10!=9:
L.append(c*10+(c%10)+1)
cnt+=1
if cnt>=n:
break
ans = L[-1]
print(ans)
| import sys
from collections import deque
input = sys.stdin.readline
n=int(eval(input()))
L=deque([i for i in range(1,10)])
if n<=9:
ans = L[n-1]
else:
cnt = 9
for i in range(1,n):
c=L.popleft()
if c%10!=0:
L.append(c*10+(c%10)-1)
cnt+=1
if cnt>=n:
break
L.append(c*10+(c%10))
cnt+=1
if cnt>=n:
break
if c%10!=9:
L.append(c*10+(c%10)+1)
cnt+=1
if cnt>=n:
break
ans = L[-1]
print(ans)
| p02720 |
import heapq
K = int(eval(input()))
Q = [1,2,3,4,5,6,7,8,9]
heapq.heapify(Q)
for i in range(K-1):
x = heapq.heappop(Q)
if x % 10 != 0:
heapq.heappush(Q,10*x+x%10-1)
heapq.heappush(Q,10*x+x%10)
if x % 10 != 9:
heapq.heappush(Q,10*x+x%10+1)
print((heapq.heappop(Q))) | from collections import deque
K = int(eval(input()))
Q = deque([1,2,3,4,5,6,7,8,9])
for i in range(K-1):
x = Q.popleft()
if x % 10 != 0:
Q.append(10*x+x%10-1)
Q.append(10*x+x%10)
if x % 10 != 9:
Q.append(10*x+x%10+1)
print((Q.popleft())) | p02720 |
from collections import deque
K = int(eval(input()))
d = deque()
for i in range(1, 10):
d.append(i)
cnt = 0
while d:
tmp = d.popleft()
cnt += 1
if cnt == K:
print(tmp)
break
r = tmp % 10
if r != 0:
d.append(tmp * 10 + r - 1)
d.append(tmp * 10 + r)
if r != 9:
d.append(tmp * 10 + r + 1) | K = int(eval(input()))
import copy
present = [1,2,3,4,5,6,7,8,9]
while K >= len(present):
K -= len(present)
next = []
for i in range(len(present)):
tmp = present[i]
r = tmp % 10
if r != 0:
next.append(tmp * 10 + r -1)
next.append(tmp * 10 + r)
if r != 9:
next.append(tmp * 10 + r +1)
present = next
print((present[K-1])) | p02720 |
K = int(eval(input()))
import copy
present = [1,2,3,4,5,6,7,8,9]
while K >= len(present):
K -= len(present)
next = []
for i in range(len(present)):
tmp = present[i]
r = tmp % 10
if r != 0:
next.append(tmp * 10 + r -1)
next.append(tmp * 10 + r)
if r != 9:
next.append(tmp * 10 + r +1)
present = next
print((present[K-1])) | K = int(eval(input()))
old = []
old = [i for i in range(1, 10)]
while K > len(old):
new = []
K -= len(old)
for i in range(len(old)):
tmp = old[i]
l = tmp % 10
if l != 0:
new.append(tmp*10+l-1)
new.append(tmp*10+l)
if l != 9:
new.append(tmp*10+l+1)
old = new[:]
print((old[K-1])) | p02720 |
def function(n):
string = str(n)
for i in range(len(string) - 1):
if int(string[i]) - int(string[i + 1]) > 1:
return i + 1
elif int(string[i + 1]) - int(string[i]) > 1:
return i
return -1
k = int(eval(input()))
ans = []
n = 1
while len(ans) < k:
m = function(n)
if m == -1:
ans.append(n)
n += 1
else:
n = n + 10 ** (len(str(n)) - m - 1) - n % (10 ** (len(str(n)) - m - 1))
print((ans[-1])) | def function(n):
string = str(n)
for i in range(len(string) - 1):
error = int(string[i]) - int(string[i + 1])
if error > 1:
return i + 1, error
elif error < -1:
return i, abs(error)
return -1, 0
k = int(eval(input()))
ans = []
n = 1
while len(ans) < k:
m, error = function(n)
if m == -1:
ans.append(n)
n += 1
else:
n = n + (error - 1) * (10 ** (len(str(n)) - m - 1)) - n % (10 ** (len(str(n)) - m - 1))
print((ans[-1])) | p02720 |
def d():
k = int(eval(input()))
val = 0
hits = 0
hit_tails = {}
while hits < k:
val += 1
if len(str(val)) == 1:
hits += 1
hit_tails[val] = int(str(val)[-1])
# print('====', hits, val)
pass
else:
lst = list(map(int, str(val)))
# print('before:', lst)
for i in range(len(lst) - 1):
if lst[i] > lst[i+1] + 1:
lst[i+1] = lst[i] - 2
if(i < len(lst) - 2):
lst[i+2:] = [9] * len(lst[i+2:])
val = int(''.join(map(str, lst)))
# print('after1:', lst)
break
elif lst[i] < lst[i+1] - 1:
lst[i+1:] = [9] * len(lst[i+1:])
val = int(''.join(map(str, lst)))
# print('after2:', lst)
break
elif i == len(lst) - 2:
hits += 1
hit_tails[val] = int(str(val)[-1])
# print('====', hits, val)
pass
print(val)
##########
if __name__ == "__main__":
d()
| from collections import deque
def lunlun():
k = int(eval(input()))
q = deque(list(range(1, 10)))
while k > 0:
k -= 1
n = q.popleft()
# print('====== popleft:', n)
if n % 10 != 0:
n0 = int(str(n) + str(n % 10 - 1))
q.append(n0)
# print('=== append:', n0)
n1 = int(str(n) + str(n % 10))
q.append(n1)
# print('=== append:', n1)
if n % 10 != 9:
n2 = int(str(n) + str(n % 10 + 1))
q.append(n2)
# print('=== append:', n2)
print(n)
##########
if __name__ == "__main__":
lunlun()
| p02720 |
from collections import deque
def main():
k = int(eval(input()))
# 前後をチェックする再帰関数( 要素として深さも必要そう / DPのメモ化とか使えそう )
#
# 生データ
# 1桁
# [1, 2, 3, 4, 5, 6, 7, 8, 9]
# 2桁
# [10, 11, 12, 21, 22, 23,..., 98, 99]
#
# 1
# 10 11 12
#
# 2
# .. .. .. 21 22 23
#
# Point.
# 1の木, 2の木と小さい順に自然となってる
# 重複していない
#
# キューを使った方法の解説
#
# 初期状態
# 1 2 3 4 5 6 7 8 9
#
# 遷移1
# . 2 3 4 5 6 7 8 9 10 11 12
#
# 遷移2
# . . 3 4 5 6 7 8 9 10 11 12 21 22 23
#
# 遷移3
# . . . 4 5 6 7 8 9 10 11 12 21 22 23 32 33 34
# 最初の1桁データの用意
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for _ in range(k-1):
p = q.popleft()
l = p % 10
# print("l:", l)
if l - 1 >= 0:
new_data1 = int(str(p) + str(l - 1))
# print("new_data1:", new_data1)
q.append(new_data1)
# print("q:", q)
new_data2 = int(str(p) + str(l))
# print("new_data2:", new_data2)
q.append(new_data2)
# print("q:", q)
if l + 1 <= 9:
new_data3 = int(str(p) + str(l + 1))
# print("new_data3:", new_data3)
q.append(new_data3)
# print("q:", q)
# print("===============")
print((q[0]))
# print("===============")
if __name__ == "__main__":
main()
| from collections import deque
def main():
k = int(eval(input()))
# 前後をチェックする再帰関数( 要素として深さも必要そう / DPのメモ化とか使えそう )
#
# 生データ
# 1桁
# [1, 2, 3, 4, 5, 6, 7, 8, 9]
# 2桁
# [10, 11, 12, 21, 22, 23,..., 98, 99]
#
# 1
# 10 11 12
#
# 2
# .. .. .. 21 22 23
#
# Point.
# 1の木, 2の木と小さい順に自然となってる
# 重複していない
#
# キューを使った方法の解説
#
# 初期状態
# 1 2 3 4 5 6 7 8 9
#
# 遷移1
# . 2 3 4 5 6 7 8 9 10 11 12
#
# 遷移2
# . . 3 4 5 6 7 8 9 10 11 12 21 22 23
#
# 遷移3
# . . . 4 5 6 7 8 9 10 11 12 21 22 23 32 33 34
# 最初の1桁データの用意
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for _ in range(k-1):
p = q.popleft()
l = p % 10
# print("l:", l)
if l - 1 >= 0:
new_data1 = p*10 + (l - 1)
# print("new_data1:", new_data1)
q.append(new_data1)
# print("q:", q)
new_data2 = p*10 + l
# print("new_data2:", new_data2)
q.append(new_data2)
# print("q:", q)
if l + 1 <= 9:
new_data3 = p*10 + (l + 1)
# print("new_data3:", new_data3)
q.append(new_data3)
# print("q:", q)
print((q[0]))
if __name__ == "__main__":
main()
| p02720 |
# D - Lunlun Number
K = int(eval(input()))
stack = [1, 2, 3, 4, 5, 6, 7, 8, 9]
i = 0
while len(stack) < K:
first = int(str(stack[i])[-1:])
if first == 0:
stack.append(int(str(stack[i]) + str(first)))
stack.append(int(str(stack[i]) + str(first + 1)))
elif first == 9:
stack.append(int(str(stack[i]) + str(first - 1)))
stack.append(int(str(stack[i]) + str(first)))
else:
stack.append(int(str(stack[i]) + str(first - 1)))
stack.append(int(str(stack[i]) + str(first)))
stack.append(int(str(stack[i]) + str(first + 1)))
i += 1
print((stack[K - 1])) | # D - Lunlun Number
K = int(eval(input()))
N = [1, 2, 3, 4, 5, 6, 7, 8, 9]
i = 0
while len(N) < K:
n = int(str(N[i]) + str(N[i])[-1:])
if str(n)[-1:] == '0':
N += [n, n + 1]
elif str(n)[-1:] == '9':
N += [n - 1, n]
else:
N += [n - 1, n, n + 1]
i += 1
print((N[K - 1])) | p02720 |
import sys
input = sys.stdin.readline
from collections import deque
INF = float('inf')
if __name__ == '__main__':
K = int(eval(input()))
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
if K < 10:
print(K)
exit()
counter = 0
while True:
counter += 1
x = q.popleft()
if counter != K:
if x % 10 == 0:
q.append(x * 10)
q.append(x * 10 + 1)
elif x % 10 == 9:
q.append(x * 10 + 8)
q.append(x * 10 + 9)
else:
q.append(x * 10 + (x % 10 - 1))
q.append(x * 10 + (x % 10))
q.append(x * 10 + (x % 10 + 1))
else:
print(x)
exit()
| import sys
input = sys.stdin.readline
from collections import deque
INF = float('inf')
if __name__ == '__main__':
K = int(eval(input()))
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
if K < 10:
print(K)
exit()
counter = 0
while True:
counter += 1
x = q.popleft()
amari = x % 10
if counter != K:
if amari == 0:
q.append(x * 10 + amari)
q.append(x * 10 + (amari + 1))
elif amari == 9:
q.append(x * 10 + (amari - 1))
q.append(x * 10 + amari)
else:
q.append(x * 10 + (amari - 1))
q.append(x * 10 + amari)
q.append(x * 10 + (amari + 1))
else:
print(x)
exit()
| p02720 |
import sys
input = sys.stdin.readline
from collections import deque
INF = float('inf')
if __name__ == '__main__':
K = int(eval(input()))
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
if K < 10:
print(K)
exit()
counter = 0
while True:
counter += 1
x = q.popleft()
amari = x % 10
if counter != K:
if amari == 0:
q.append(x * 10 + amari)
q.append(x * 10 + (amari + 1))
elif amari == 9:
q.append(x * 10 + (amari - 1))
q.append(x * 10 + amari)
else:
q.append(x * 10 + (amari - 1))
q.append(x * 10 + amari)
q.append(x * 10 + (amari + 1))
else:
print(x)
exit()
| import sys
input = sys.stdin.readline
from collections import deque
INF = float('inf')
if __name__ == '__main__':
K = int(eval(input()))
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
if K < 10:
print(K)
exit()
counter = 0
while True:
counter += 1
x = q.popleft()
amari = x % 10
if counter != K:
if amari > 0:
q.append(x * 10 + (amari - 1))
q.append(x * 10 + amari)
if amari < 9:
q.append(x * 10 + (amari + 1))
else:
print(x)
exit()
| p02720 |
k = int(eval(input()))
n = 0
def ff(s, i):
for j in range(i+1, len(s)):
#print(s[j-1])
if s[j-1] > 0:
s[j] = s[j-1] - 1
else:
s[j] = 0
return s
def next(s):
ls = len(s)
for i in range(ls-1, 0, -1):
if s[i-1] >= s[i] and s[i] != 9:
s[i] += 1
#print(s[i-1],s[i])
return ff(s, i)
if s[0] == 9:
return [1] + ([0] * ls)
else:
s[0] += 1
return ff(s, 0)
if k < 10:
print(k)
exit()
ans = [1,0]
for i in range(k - 10):
ans = next(ans)
#print(ans)
print((''.join(map(str, ans))))
| k = int(eval(input()))
r = [[i] for i in range(1,10)]
from collections import deque
que = deque(r)
if k < 10:
print(k)
exit()
while len(r) <= k:
ri = que.popleft()
for j in range(max(0, ri[-1]-1), min(9, ri[-1]+1)+1):
rj = ri.copy()
rj.append(j)
r.append(rj)
que.append(rj)
#print(que)
#print(r[k-1])
print((''.join(map(str, r[k-1]))))
| p02720 |
MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)
K = int(eval(input()))
lunlun = []
def dfs(i,before):
if i == 11:
return
lunlun.append(before)
back = before%10
for j in range(-1,2):
t = back + j
if 0 <= t < 10:
dfs(i + 1,before*10 + t)
for i in range(1,10):
dfs(1,i)
lunlun.sort()
print((lunlun[K - 1]))
| import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
Lunlun = []
K = int(eval(input()))
def dfs(i,before):
if i == 10:
return
Lunlun.append(before)
x = before%10
for d in (-1,0,1):
y = x + d
if y < 0 or y >= 10:
continue
dfs(i + 1,before*10 + y)
for i in range(1,10):
dfs(0,i)
Lunlun.sort()
ans = Lunlun[K - 1]
print(ans) | p02720 |
def main():
from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 7)
@lru_cache(maxsize=None)
def make_number(digit, p=0):
if digit == 0:
memo.append(p)
if len(memo) == k + 1:
print(p)
exit()
return
if p == 0:
# 前の位がない
for x in range(1, 10):
make_number(digit - 1, x)
else:
r = p % 10
# 前の位がある
for x in range(max(0, r - 1), min(9, r + 1) + 1):
make_number(digit - 1, p * 10 + x)
k = int(eval(input()))
memo = []
for digit in range(11):
make_number(digit)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| from collections import deque
K = int(eval(input()))
dq = deque()
for x in range(1, 10):
dq.append(x)
idx = 1
while idx < K:
x = dq.popleft()
idx += 1
r = x % 10
if r > 0:
nx = (x * 10) + (r - 1)
dq.append(nx)
nx = (x * 10) + (r)
dq.append(nx)
if r < 9:
nx = (x * 10) + (r + 1)
dq.append(nx)
ans = dq.popleft()
print(ans)
| p02720 |
from collections import deque
K = int(eval(input()))
dq = deque()
for x in range(1, 10):
dq.append(x)
idx = 1
while idx < K:
x = dq.popleft()
idx += 1
r = x % 10
if r > 0:
nx = (x * 10) + (r - 1)
dq.append(nx)
nx = (x * 10) + (r)
dq.append(nx)
if r < 9:
nx = (x * 10) + (r + 1)
dq.append(nx)
ans = dq.popleft()
print(ans)
| def main():
from collections import deque
K = int(eval(input()))
dq = deque()
for x in range(1, 10):
dq.append(x)
idx = 0
while dq:
x = dq.popleft()
idx += 1
if idx == K:
print(x)
return
r = x % 10
if r > 0:
dq.append(x * 10 + r - 1)
dq.append(x * 10 + r)
if r < 9:
dq.append(x * 10 + r + 1)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
| p02720 |
def is_valid(num):
if 1 <= num < 10:
return True
ns = list(map(int, str(num)))
n = len(ns)
for i in range(n - 1):
if abs(ns[i] - ns[i + 1]) > 1:
return False
return True
lunluns = []
for i in range(1, 100000):
if is_valid(i):
lunluns.append(i)
d = {}
def dfs2(rem, pre):
if rem == 0:
return 1
key = (rem, pre)
if key in d:
return d[key]
res = 0
if pre == -1:
for i in range(10):
res += dfs2(rem - 1, -1 if i == 0 else i)
else:
for i in range(10):
if abs(i - pre) <= 1:
res += dfs2(rem - 1, i)
d[key] = res
return res
assert dfs2(1, -1) == 10
assert dfs2(1, 1) == 3
def dfs(cur, n, k, pre, buf):
if cur == n:
return k == 1
for i in range(10):
if pre == -1 or abs(i - pre) <= 1:
u = dfs2(n - cur - 1, -1 if pre == -1 and i == 0 else i)
if u < k:
k -= u
else:
buf.append(i)
assert dfs(cur + 1, n, k, -1 if pre == -1 and i == 0 else i, buf)
break
return True
def solve(k):
N = 500
res = []
assert dfs(0, N, k, -1, res)
res = res[::-1]
while res and res[-1] == 0:
res.pop()
if not res:
res = [0]
return ''.join(map(str, res[::-1]))
assert solve(3) == '2'
assert solve(1) == '0'
assert solve(2) == '1'
assert solve(4) == '3'
for i, num in enumerate(lunluns):
assert solve(i + 2) == str(num)
if __name__ == '__main__':
k = int(input())
k += 1
print(solve(k))
| # 20/05/10 cost:20min
def is_valid(num):
if 1 <= num < 10:
return True
ns = list(map(int, str(num)))
n = len(ns)
for i in range(n - 1):
if abs(ns[i] - ns[i + 1]) > 1:
return False
return True
lunluns = []
for i in range(1, 10):
if is_valid(i):
lunluns.append(i)
d = {}
def dfs2(rem, pre, lt):
if rem == 0:
return 1
key = (rem, pre, lt)
if key in d:
return d[key]
res = 0
if lt:
for i in range(10):
res += dfs2(rem - 1, i, lt and i == 0)
else:
for i in range(10):
if abs(i - pre) <= 1:
res += dfs2(rem - 1, i, False)
d[key] = res
return res
assert dfs2(1, -1, True) == 10
assert dfs2(1, 1, False) == 3
def dfs(cur, n, k, pre, lt, buf):
if cur == n:
return k == 1
for i in range(10):
if lt or abs(i - pre) <= 1:
u = dfs2(n - cur - 1, i, lt and i == 0)
if u < k:
k -= u
else:
buf.append(i)
assert dfs(cur + 1, n, k, i, lt and i == 0, buf)
break
return True
def solve(k):
N = 500
res = []
assert dfs(0, N, k, -1, True, res)
res = res[::-1]
while res and res[-1] == 0:
res.pop()
if not res:
res = [0]
return ''.join(map(str, res[::-1]))
assert solve(3) == '2'
assert solve(1) == '0'
assert solve(2) == '1'
assert solve(4) == '3'
for i, num in enumerate(lunluns):
assert solve(i + 2) == str(num)
if __name__ == '__main__':
k = int(input())
k += 1
print(solve(k))
| p02720 |
def make_tree(G,keta,count):
if keta==1:
num =[]
for i in range(1,10):
count+=1
if count ==k:
print(i)
exit()
else:
num.append(i)
G.append(num)
make_tree(G,2,count)
else:
num_list = G[keta-2]
num_lis =[]
for num in num_list:
num_str = str(num)
num_e = int(num_str[-1])
if num_e == 0:
count +=1
if count == k :
print((int(num_str + "0")))
exit()
num_lis.append(int((num_str)+"0"))
count+=1
if count == k :
print((int(num_str + "1")))
exit()
num_lis.append(int((num_str)+"1"))
elif num_e == 9:
count +=1
if count == k :
print((int(num_str + "8")))
exit()
num_lis.append(int((num_str)+"8"))
count+=1
if count == k :
print((int(num_str + "9")))
exit()
num_lis.append(int((num_str)+"9"))
else:
count +=1
if count == k :
print((int(num_str + str(num_e-1))))
exit()
num_lis.append(int(num_str + str(num_e-1)))
count+=1
if count == k :
print((int(num_str + str(num_e))))
exit()
num_lis.append(int(num_str + str(num_e)))
count+=1
if count == k :
print((int(num_str + str(num_e+1))))
exit()
num_lis.append(int(num_str + str(num_e+1)))
G.append(num_lis)
make_tree(G,keta+1,count)
k = int(eval(input()))
G=[]
make_tree(G,1,0)
| def is_count_k(count,n):
count +=1
if count == k :
print(n)
exit()
return count
def make_tree(G,keta,count):
num_list = G[keta-2]
new_list =[]
for num in num_list:
r = num%10
if r != 0 :
count = is_count_k(count,num*10 + (r-1))
new_list.append(num*10 + r-1)
count = is_count_k(count,num*10+r)
new_list.append(num*10 + r)
if r != 9:
count = is_count_k(count,num*10+(r +1))
new_list.append(num*10+(r +1))
G.append(new_list)
make_tree(G,keta+1,count)
k = int(eval(input()))
G=[]
if k < 10:
print(k)
exit()
G.append([1,2,3,4,5,6,7,8,9])
make_tree(G,2,9)
| p02720 |
import sys
sys.setrecursionlimit(3000)
k = int(eval(input()))
ans = []
def solve(x, l):
if int(x) > 3234566667:
return l
l.append(int(x))
if x[-1] == '0':
solve(x + '0', l)
solve(x + '1', l)
elif x[-1] == '9':
solve(x + '9', l)
solve(x + '8', l)
else:
last_digit = int(x[-1])
for i in range(-1, 2):
new_digit = last_digit + i
solve(x + str(new_digit), l)
for i in range(1, 10):
solve(str(i), ans)
ans.sort()
print((ans[k - 1])) | from collections import deque
k = int(eval(input()))
#初めに、1~9まではキューに入れておく
q = deque([i for i in range(1, 10)])
ans = 0
while True:
v = q.popleft()
ans += 1
if ans == k:
print(v)
break
#末尾の1桁を求める
last_digit = v % 10
#求めた末尾の1桁との差が1になる数字を最後の1桁にする
#つまり、末尾の1桁に対して-1,+0,+1とする計算を行う
for i in range(-1, 2):
new_digit = last_digit + i
if new_digit < 0 or new_digit > 9:
continue
q.append(v * 10 + new_digit)
| p02720 |
def add():
for i in ans[cnt-1]:
i=str(i)
last=i[-1]
last=int(last)
for j in range(last-1,last+2):
if j==10 or j==-1:
continue
tmp=i
tmp+=str(j)
ans[cnt].append(int(tmp))
n=int(eval(input()))
ans=[[]for i in range(10)]
cnt=1
for i in range(1,10):
ans[0].append(i)
for i in range(9):
add()
cnt+=1
merged=[]
for i in ans:
merged+=i
merged=sorted(merged)
print((merged[n-1])) | def dfs(x):
ans.append(x)
if len(str(x))==10:
return
last=x%10
for i in [last-1,last,last+1]:
if 0<=i<=9:
dfs(10*x+i)
k=int(eval(input()))
ans=[]
for i in range(1,10):
dfs(i)
ans=sorted(ans)
print((ans[k-1]))
| p02720 |
k = int(eval(input()))
a = list(map(str, list(range(1, 10))))
ans = a + []
illist = []
for i in range(10):
if i == 0:
illist.append(["0","1"])
elif i == 9:
illist.append(["8","9"])
else:
illist.append([str(i-1),str(i),str(i+1)])
while len(ans) < k:
b = []
for i in a:
if i == "323456667":
break
intil = int(i[-1])
c = [i + j for j in illist[intil]]
b = b + c
a = b
ans = ans + b
print((ans[k-1])) | k = int(eval(input()))
from collections import deque
q = deque()
a = list(map(str, list(range(1, 10))))
ans = a + []
illist = []
for i in range(10):
if i == 0:
illist.append(["0","1"])
elif i == 9:
illist.append(["8","9"])
else:
illist.append([str(i-1),str(i),str(i+1)])
for i in range(1,10):
q.append(str(i))
node = "0"
while node != "323456667":
node = q.popleft()
for j in illist[int(node[-1])]:
nodej = node+j
q.append(nodej)
a.append(nodej)
print((a[k - 1])) | p02720 |
K=int(eval(input()))
N=0 #現在のルンルン数の数
lun=list(range(1,10))
while 1:
N+=1
x=lun[N-1]
if x%10 != 0:
lun.append(10*x+x%10-1)
lun.append(10*x+x%10)
if x%10 != 9:
lun.append(10*x+x%10+1)
if N==K:
break
print((lun[N-1]))
| K=int(eval(input()))
# K=15
lun=list(range(1,10))
i=0
while 1:
ichi=lun[i]%10
if ichi!=0:
lun.append(lun[i]*10+ichi-1)
lun.append(lun[i]*10+ichi)
if ichi!=9:
lun.append(lun[i]*10+ichi+1)
i+=1
if i==K:
break
print((lun[i-1]))
| p02720 |
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
MAX = 3234566667
ans = []
def rec(x):
if int(x) > MAX:
return
ans.append(int(x))
last = int(x[-1])
rec(x+str(last))
if last != 0:
rec(x+str(last-1))
if last != 9:
rec(x+str(last+1))
return
K = INT()
for i in range(1, 10):
rec(str(i))
ans.sort()
print((ans[K-1]))
| # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def bisearch_min(mn, mx, func):
ok = mx
ng = mn
while ng+1 < ok:
mid = (ok+ng) // 2
if func(mid):
ok = mid
else:
ng = mid
return ok
def check(x):
x = str(x)
N = len(x)
dp0 = list2d(N+1, 10, 0)
dp1 = list2d(N+1, 10, 0)
a = int(x[0])
dp0[1][a] = 1
for j in range(1, a):
dp1[1][j] = 1
for i in range(2, N+1):
for j in range(1, 10):
dp1[i][j] = 1
for i, a in enumerate(x):
a = int(a)
for j in range(10):
for k in range(10):
if abs(j - k) >= 2:
continue
if k > a:
dp1[i+1][k] += dp1[i][j]
elif k == a:
dp0[i+1][k] += dp0[i][j]
dp1[i+1][k] += dp1[i][j]
else:
dp1[i+1][k] += dp0[i][j]
dp1[i+1][k] += dp1[i][j]
ans = sum(dp0[N]) + sum(dp1[N])
return ans >= K
K = INT()
res = bisearch_min(0, 10**10, check)
print(res)
| p02720 |
#n桁のるんるん数のrisutoを求める
import sys
sys.setrecursionlimit(10**9)
def runrun(n):
if n == 1:
return [['1','2','3','4','5','6','7','8','9']]
else:
li = runrun(n-1)
li2 = []
for i in range(len(li[n-2])):
p = int(li[n-2][i][-1])
if p == 0:
li2.append(li[n-2][i]+'0')
li2.append(li[n-2][i]+'1')
elif p == 9:
li2.append(li[n-2][i]+str(8))
li2.append(li[n-2][i]+'9')
else:
li2.append(li[n-2][i]+str(p-1))
li2.append(li[n-2][i]+str(p))
li2.append(li[n-2][i]+str(p+1))
li2 =[li2]
li.extend(li2)
return li
x = int(eval(input()))
t = True
k=1
b = 0
while t:
a = runrun(k)
b = 0
#k桁までに何個るんるん数があるか数えるもの
for i in range(len(a)):
b+=(len(a[i]))
#k桁ということが確定したあと以下の処理を行う
if x <= b:
t = False
if k == 1:
print(x)
else:
tmp = runrun(k-1)
c = 0
#まずk-1桁までのるんるん数の数を数える
for i in range(len(tmp)):
c += (len(tmp[i]))
s = a[k-1][x-c-1]
print((int(s)))
else:
k += 1 | #n桁のるんるん数のrisutoを求める
import sys
sys.setrecursionlimit(10**9)
from functools import lru_cache
@lru_cache(maxsize=None)
def runrun(n):
if n == 1:
return [['1','2','3','4','5','6','7','8','9']]
else:
li = runrun(n-1)
li2 = []
for i in range(len(li[n-2])):
p = int(li[n-2][i][-1])
if p == 0:
li2.append(li[n-2][i]+'0')
li2.append(li[n-2][i]+'1')
elif p == 9:
li2.append(li[n-2][i]+str(8))
li2.append(li[n-2][i]+'9')
else:
li2.append(li[n-2][i]+str(p-1))
li2.append(li[n-2][i]+str(p))
li2.append(li[n-2][i]+str(p+1))
li2 =[li2]
li.extend(li2)
return li
x = int(eval(input()))
t = True
k=1
b = 0
while t:
a = runrun(k)
b = 0
#k桁までに何個るんるん数があるか数えるもの
for i in range(len(a)):
b+=(len(a[i]))
#k桁ということが確定したあと以下の処理を行う
if x <= b:
t = False
if k == 1:
print(x)
else:
tmp = runrun(k-1)
c = 0
#まずk-1桁までのるんるん数の数を数える
for i in range(len(tmp)):
c += (len(tmp[i]))
s = a[k-1][x-c-1]
print((int(s)))
else:
k += 1
| p02720 |
import collections
k = int(eval(input()))
Q = collections.deque([int(i) for i in range(1, 10)])
for _ in range(k):
x = Q.popleft()
if x%10:
Q.append(10*x + x%10 - 1)
Q.append(10*x + x%10)
if x%10 != 9:
Q.append(10*x + x%10 + 1)
print(x)
| import collections
k = int(eval(input()))
Q = collections.deque([int(i) for i in range(1, 10)])
chk = False
for i in range(k):
x = Q.popleft()
if i + len(Q) > k:
chk = True
if chk:
continue
else:
if x%10:
Q.append(10*x + x%10 - 1)
Q.append(10*x + x%10)
if x%10 != 9:
Q.append(10*x + x%10 + 1)
print(x)
| p02720 |
import collections
k = int(eval(input()))
Q = collections.deque([int(i) for i in range(1, 10)])
chk = False
for i in range(k):
x = Q.popleft()
if i + len(Q) > k:
chk = True
if chk:
continue
else:
if x%10:
Q.append(10*x + x%10 - 1)
Q.append(10*x + x%10)
if x%10 != 9:
Q.append(10*x + x%10 + 1)
print(x)
| import collections
def main():
k = int(eval(input()))
Q = collections.deque([int(i) for i in range(1, 10)])
chk = False
for i in range(k):
x = Q.popleft()
if i + len(Q) > k:
chk = True
if chk:
continue
else:
if x%10:
Q.append(10*x + x%10 - 1)
Q.append(10*x + x%10)
if x%10 != 9:
Q.append(10*x + x%10 + 1)
print(x)
if __name__ == "__main__":
main() | p02720 |
import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
K = ir()
A = deque([x for x in range(1, 10)])
count = 0
while True:
cur = A.popleft()
count += 1
if count == K:
answer = cur
break
next = 10 * cur + (cur % 10)
if cur % 10 != 0:
A.append(next-1)
A.append(next)
if cur % 10 != 9:
A.append(next+1)
print(answer)
| # coding: utf-8
import sys
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
K = ir()
num = -1
def dfs(A, i, bl):
global num
if i == 11:
num += 1
if num == K:
ans = ''.join(map(str, A))
ans = int(ans)
print(ans)
exit()
return
last = A[-1]
if bl:
dfs([0], i+1, True)
for j in range(1, 10):
dfs([j], i+1, False)
else:
if last > 0:
dfs(A+[last-1], i+1, False)
dfs(A+[last], i+1, False)
if last < 9:
dfs(A+[last+1], i+1, False)
dfs([0], 0, True)
| p02720 |
K = int(eval(input()))
k = K - 1
numbers = {
0: 1
}
while k > 0:
k -= 1
for i in range(len(numbers)):
n = numbers[i]
if n == 9:
continue
if abs(numbers.get(i - 1, n) - (n + 1)) <= 1 and abs(numbers.get(i + 1, n) - (n + 1)) <= 1:
numbers[i] += 1
j = i - 1
while j >= 0:
numbers[j] = max(numbers[j + 1] - 1, 0)
j -= 1
break
else:
for key in list(numbers.keys()):
numbers[key] = 0
numbers[len(numbers)] = 1
print((''.join([str(numbers[i]) for i in range(len(numbers))])[::-1]))
| from collections import deque
K = int(eval(input()))
queue = deque(list(range(1, 10)))
for _ in range(K):
x = queue.popleft()
if x % 10 != 0:
queue.append(10 * x + x % 10 - 1)
queue.append(10 * x + x % 10)
if x % 10 != 9:
queue.append(10 * x + x % 10 + 1)
print(x)
| p02720 |
import sys
from collections import deque
def solve():
input = sys.stdin.readline
K = int(eval(input()))
low, high = 0, 3234566668
while high - low > 1:
mid = (low + high) // 2
midS = str(mid)
lenS = len(midS)
q = deque()
for j in range(lenS):
for i in range(1, 10): q.append((i, i, j + 1))
count = 0
isRunrun = False
while q:
ns, last, length = q.pop()
if length == lenS:
if ns <= mid: count += 1
if ns == mid: isRunrun = True
else:
if last == 0:
q.append((ns*10 + 1, 1, length + 1))
q.append((ns*10 + 0, 0, length + 1))
elif last == 9:
q.append((ns*10 + 8, 8, length + 1))
q.append((ns*10 + 9, 9, length + 1))
else:
q.append((ns*10 + last+1, last + 1, length + 1))
q.append((ns*10 + last-1, last - 1, length + 1))
q.append((ns*10 + last, last, length + 1))
if count > K: high = mid
elif count == K:
if isRunrun: low = mid
else: high = mid
else: low = mid
#print(mid, count)
print(low)
return 0
if __name__ == "__main__":
solve() | import sys
from collections import deque
def solve():
input = sys.stdin.readline
K = int(eval(input()))
q = deque()
for i in range(9): q.append((i + 1, i + 1))
lunlun = 1
while lunlun < K:
nowNum, lastNum = q.popleft()
if lastNum > 0: q.append((nowNum * 10 + lastNum - 1, lastNum - 1))
q.append((nowNum * 10 + lastNum, lastNum))
if lastNum < 9: q.append((nowNum * 10 + lastNum + 1, lastNum + 1))
lunlun += 1
ans, lastNum = q.popleft()
print(ans)
return 0
if __name__ == "__main__":
solve() | p02720 |
K = int(eval(input()))
a = set([1,2,3,4,5,6,7,8,9])
prev = set([1,2,3,4,5,6,7,8,9])
while len(a) < K:
temp = set()
for now in prev:
c = now%10
if c == 0:
temp.add(now*10)
temp.add(now*10+1)
elif c == 9:
temp.add(now*10+9)
temp.add(now*10+8)
else:
temp.add(now*10+c-1)
temp.add(now*10+c)
temp.add(now*10+c+1)
prev = temp
a = a|temp
print((sorted(list(a))[K-1]))
| K = int(eval(input()))
S = set([1,2,3,4,5,6,7,8,9])
prev = set([1,2,3,4,5,6,7,8,9])
while len(S) < K:
temp = set([])
for e in prev:
if e%10 == 0:
temp.add(e*10)
temp.add(e*10+1)
elif e%10 == 9:
temp.add(e*10+8)
temp.add(e*10+9)
else:
temp.add(e*10+e%10-1)
temp.add(e*10+e%10)
temp.add(e*10+e%10+1)
prev = temp
S = S|temp
print((sorted(list(S))[K-1]))
| p02720 |
k = int(eval(input()))
def dfs(d, val, A):
A.append(val)
if d == 10:
return
for i in range(-1, 2):
add = (val % 10) + i
if add >= 0 and add <= 9:
dfs(d + 1, val * 10 + add, A)
A = []
for v in range(1, 10): # 呼び出し
dfs(1, v, A)
A.sort()
print((A[k - 1])) |
def calc_next(arr):
res = []
for val in arr:
for j in range(-1, 2):
add = (val % 10) + j
if add >= 0 and add <= 9:
res.append(val * 10 + add)
return res
k = int(eval(input()))
cur = []
A = []
for v in range(1, 10):
cur.append(v)
A.append(v)
for d in range(1, 10):
cur = calc_next(cur)
for val in cur:
A.append(val)
print((A[k - 1])) | p02720 |
from collections import deque
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
K = int(readline())
queue = deque([])
for i in range(1,10):
queue.append(i)
for i in range(K):
x = queue.popleft()
r = x % 10
if r != 0:
queue.append(10*x + r - 1)
queue.append(10*x + r)
if x % 10 != 9:
queue.append(10*x + r + 1)
print(x)
if __name__ == "__main__":
main()
| # 桁dp + 二分探索
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def lunlun_num(N):
N = str(N)
L = len(N)
dp = [[0]*10 for j in range(L)]
for j in range(1,int(N[0])):
dp[0][j] = 1
flag = True
for i in range(L-1):
d = int(N[i+1])
b = int(N[i])
dp[i+1][0] += dp[i][0] + dp[i][1]
dp[i+1][9] += dp[i][8] + dp[i][9]
for j in range(1,9):
dp[i+1][j] += dp[i][j-1] + dp[i][j] + dp[i][j+1]
for j in range(1,10):
dp[i+1][j] += 1
if flag:
if d < b - 1:
flag = False
elif d <= b + 1:
for j in range(max(0, b-1),d):
dp[i+1][j] += 1
else:
for j in range(max(0, b-1),b+2):
dp[i+1][j] += 1
flag = False
return sum(dp[L-1]) + 1 if flag else sum(dp[L-1])
def main():
K = int(readline())
# xを決め打って二分探索
left = 0
right = 10**10
while left + 1 < right:
x = (left + right) // 2
if lunlun_num(x) >= K:
right = x
else:
left = x
print(right)
if __name__ == "__main__":
main()
| p02720 |
def solve():
K = int(eval(input()))
cnt = 0
n_digit = 1
numbers = []
while cnt < K:
numbers = []
dfs("", numbers, n_digit)
cnt += len(numbers)
n_digit += 1
print((numbers[-(cnt - K + 1)]))
def dfs(now, numbers, n_digit):
if len(now) == n_digit:
numbers.append(now)
return
if now == "":
for i in range(1,10):
dfs(now+str(i), numbers, n_digit)
else:
last_num = int(now[-1])
if last_num - 1 >= 0:
dfs(now+str(last_num-1), numbers, n_digit)
dfs(now+str(last_num), numbers, n_digit)
if last_num + 1 <= 9:
dfs(now+str(last_num+1), numbers, n_digit)
if __name__ == '__main__':
solve() | from collections import deque
def solve():
K = int(eval(input()))
q = deque(list(range(1,10)))
cnt = 0
tmp = 0
while cnt < K:
tmp = q.popleft()
cnt += 1
ones_place = tmp % 10
if ones_place != 0:
q.append(tmp*10+ones_place-1)
q.append(tmp*10+ones_place)
if ones_place != 9:
q.append(tmp*10+ones_place+1)
print(tmp)
if __name__ == '__main__':
solve() | p02720 |
def solve():
K = int(eval(input()))
all = []
for i in range(1,10):
dfs(1,i,all)
all.sort()
print((all[K-1]))
def dfs(d, val, all):
all.append(val)
if d == 10:
return
for j in [-1,0,1]:
add = val % 10 + j
if 0 <= add <= 9:
dfs(d+1, val*10+add, all)
if __name__ == '__main__':
solve() | def solve():
K = int(eval(input()))
lunluns = []
for i in range(1,10):
dfs(1,i,lunluns)
lunluns.sort()
print((lunluns[K-1]))
def dfs(d,now,lunluns):
lunluns.append(now)
if d == 10:
return
for i in [-1,0,1]:
add = now % 10 + i
if 0 <= add <= 9:
dfs(d+1,now*10+add, lunluns)
if __name__ == '__main__':
solve()
| p02720 |
import sys
sys.setrecursionlimit(20000000)
k = int(eval(input()))
def dfs(l, lim):
if lim == 10:
return l
new_l = []
for num in l:
last = num % 10
base = num * 10
if 1 <= last <= 8:
for i in [last-1, last, last+1]:
if base + i <= 3234566667:
new_l.append(base + i)
elif last == 0:
for i in [0, 1]:
if base + i <= 3234566667:
new_l.append(base + i)
else:
for i in [8, 9]:
if base + i <= 3234566667:
new_l.append(base + i)
return l + new_l + dfs(new_l, lim+1)
ans = list(set(dfs([1, 2, 3, 4, 5, 6, 7, 8, 9], 0)))
ans.sort()
print((ans[k-1]))
| from collections import deque
k = int(eval(input()))
que = deque([i for i in range(1, 10)])
i = 0
while True:
i += 1
num = que.popleft()
if i == k:
print(num)
exit()
if num % 10 > 0:
que.append(num * 10 + ((num % 10) - 1))
que.append(num * 10 + (num % 10))
if num % 10 < 9:
que.append(num * 10 + ((num % 10) + 1))
| p02720 |
# -*- coding: utf-8 -*-
from collections import deque
k = int(eval(input()))
dq = deque(list(range(1, 10)))
rep = 0
while rep < k:
now = dq.popleft()
rep+=1
for i in (-1, 0, 1):
if 0<=now%10+i<10:
dq.append(now*10+now%10+i)
print(now)
| def main():
k = int(eval(input()))
a = [i for i in range(1,10)]
x = 0
while(1):
if k <= len(a):
print((a[k-1]))
return
for i in range(-1,2):
d = a[x]%10 +i
if 0 <= d and d < 10:
a.append(a[x]*10 + d)
x+=1
if __name__ == "__main__":
main() | p02720 |
n = int(eval(input()))
l = [_ for _ in range(1,10)]
for i in range(10**5):
if str(l[i])[-1] == '0':
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
elif str(l[i])[-1] == '9':
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
else:
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
print((l[n-1])) | n = int(eval(input()))
l = [_ for _ in range(1,10)]
cnt = 9
for i in range(10**5):
if cnt >= n:
break
if str(l[i])[-1] == '0':
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
cnt += 2
elif str(l[i])[-1] == '9':
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
cnt += 2
else:
l.append(l[i]*10 + int(str(l[i])[-1]) - 1)
l.append(l[i]*10 + int(str(l[i])[-1]))
l.append(l[i]*10 + int(str(l[i])[-1]) + 1)
cnt += 3
print((l[n-1])) | p02720 |
from collections import deque
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 0
l = []
used = set()
while cnt<100000:
p = q.popleft()
if p in used:continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p%10)-1,0), min((p%10)+1, 9)+1):
q.append(10*p+i)
N = int(eval(input()))
print((l[N-1])) | from collections import deque
def solve():
N = int(eval(input()))
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 0
l = []
used = set()
while cnt<N:
p = q.popleft()
if p in used:continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p%10)-1,0), min((p%10)+1, 9)+1):
q.append(10*p+i)
print((l[N-1]))
if __name__ == "__main__":
solve()
| p02720 |
from collections import deque
def solve():
N = int(eval(input()))
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 0
l = []
used = set()
while cnt<N:
p = q.popleft()
if p in used:continue
used.add(p)
l.append(p)
cnt += 1
for i in range(max((p%10)-1,0), min((p%10)+1, 9)+1):
q.append(10*p+i)
print((l[N-1]))
if __name__ == "__main__":
solve()
| from collections import deque
def solve():
N = int(eval(input()))
q = deque([1,2,3,4,5,6,7,8,9])
cnt = 0
l = []
while cnt<N:
p = q.popleft()
l.append(p)
cnt += 1
for i in range(max((p%10)-1,0), min((p%10)+1, 9)+1):
q.append(10*p+i)
print((l[N-1]))
if __name__ == "__main__":
solve()
| p02720 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
k = int(readline())
q = [(i + 1) for i in range(9)]
if k < 10:
print(k)
exit()
cnt = 9
while q:
x = q.pop(0)
y = int(str(x)[-1])
if y != 0:
cnt += 1
if cnt == k:
print((10 * x + y - 1))
exit()
q.append(10 * x + y - 1)
cnt += 1
if cnt == k:
print((10 * x + y))
exit()
q.append(10 * x + y)
if y != 9:
cnt += 1
if cnt == k:
print((10 * x + y + 1))
exit()
q.append(10 * x + y + 1)
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from collections import deque
k = int(readline())
q = deque(list(map(str, list(range(1, 10)))))
for i in range(k - 1):
x = q.popleft()
y = int(x[-1])
if y != 0:
q.append(x + str(y - 1))
q.append(x + x[-1])
if y != 9:
q.append(x + str(y + 1))
print((q[0]))
| p02720 |
import sys
from collections import deque
sys.setrecursionlimit(10**7)
k = int(eval(input()))
ans = []
def bfs(que):
finished = set()
while que and len(ans) <= 10**6:
x = que.popleft()
ans.append(int(x))
if x not in finished:
finished.add(x)
p = int(x[-1])
que.append(x + str(p))
if 1 <= p <= 8:
que.append(x + str(p+1))
que.append(x + str(p-1))
elif p == 0:
que.append(x + str(p+1))
else:
que.append(x + str(p-1))
que = deque([])
for i in range(1,10):
que.append(str(i))
bfs(que)
ans.sort()
print((ans[k-1])) | import sys
from collections import deque
sys.setrecursionlimit(10**7)
k = int(eval(input()))
ans = []
def bfs(que):
finished = set()
while que and len(ans) <= 10**5:
x = que.popleft()
ans.append(int(x))
if x not in finished:
finished.add(x)
p = int(x[-1])
if 1 <= p <= 8:
que.append(x + str(p-1))
que.append(x + str(p))
que.append(x + str(p+1))
elif p == 0:
que.append(x + str(p))
que.append(x + str(p+1))
else:
que.append(x + str(p-1))
que.append(x + str(p))
que = deque([])
for i in range(1,10):
que.append(str(i))
bfs(que)
ans.sort()
print((ans[k-1])) | p02720 |
K = int(eval(input()))
L = [i for i in range(1, 10)]
cnt = 9
i = 0
while K > cnt:
x = L[i]
r = x % 10
if r != 0:
L.append(10*x + r - 1)
cnt += 1
L.append(10*x + r)
cnt += 1
if r != 9:
L.append(10*x + r + 1)
cnt += 1
i += 1
print((L[K-1])) | K = int(eval(input()))
C = [[0]*10 for _ in range(10)]
C[0] = [1]*10
D = {0: [0, 1], 1: [0, 1, 2], 2: [1, 2, 3], 3: [2, 3, 4], 4: [3, 4, 5], 5: [4, 5, 6], 6: [5, 6, 7], 7: [6, 7, 8], 8: [7, 8, 9], 9: [8, 9]}
for i in range(1, 10):
for j in range(10):
if j == 0:
C[i][j] = C[i-1][j] + C[i-1][j+1]
elif j == 9:
C[i][j] = C[i-1][j-1] + C[i-1][j]
else:
C[i][j] = C[i-1][j-1] + C[i-1][j] + C[i-1][j+1]
ans = []
temp = K
Flag = True
for i in range(10):
if Flag:
for j in range(1, 10):
temp -= C[i][j]
if temp <= 0:
temp += C[i][j]
r = i
ans.append(j)
Flag = False
break
else:
break
def f(x, r):
temp = x
r -= 1
for j in D[ans[-1]]:
temp -= C[r][j]
if temp <= 0:
temp += C[r][j]
ans.append(j)
break
return temp, r
while r >= 1:
temp, r = f(temp, r)
print(("".join([str(i) for i in ans]))) | p02720 |
N=int(eval(input()))
list = []
def standard(n, cur):
if n == 0:
##print(''.join(cur))
add = ''.join(cur)
if str(add).isnumeric() and add != "0":
list.append(int(add))
else:
newC = chr(ord(cur[-1]) + 1)
standard(n - 1, cur + [newC])
newC2 = chr(ord(cur[-1]) - 1)
standard(n - 1, cur + [newC2])
newC3 = chr(ord(cur[-1]))
standard(n - 1, cur + [newC3])
for i in range(10):
for j in range(9):
standard(i, [str(j+1)])
list = sorted(list)
print((list[N-1])) | N=int(eval(input()))
list = []
def standard(n, cur):
if n == 0:
add = ''.join(cur)
if str(add).isnumeric():
list.append(int(add))
else:
newC = chr(ord(cur[-1]) - 1)
standard(n - 1, cur + [newC])
newC2 = chr(ord(cur[-1]))
standard(n - 1, cur + [newC2])
newC3 = chr(ord(cur[-1]) + 1)
standard(n - 1, cur + [newC3])
for i in range(10):
for j in range(9):
standard(i, [str(j+1)])
print((list[N-1]))
| p02720 |
K = int(eval(input()))
def cal():
count = 9
d = [[1,2,3,4,5,6,7,8,9]]
for i in range(10**9):
d_ = []
for j in range(len(d[i])):
a = str(d[i][j])
if a[-1]=="0":
for k in [0, 1]:
d_.append(int(a)*10+k)
count += 1
if K == count:
print((d_[-1]))
return
elif a[-1]=="9":
for k in [8, 9]:
d_.append(int(a)*10+k)
count += 1
if K == count:
print((d_[-1]))
return
else:
for k in [-1, 0, 1]:
d_.append(int(a)*10+int(a[-1])+k)
count += 1
if K == count:
print((d_[-1]))
return
d.append(d_)
if K <= 9:
print(K)
else:
cal() | from collections import deque
k = int(eval(input()))
if k <= 9: print(k)
que = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
count = 9
while count <= k:
X = que.popleft()
if X%10==0: check=[0, 1]
elif X%10==9: check=[8, 9]
else: check = [X%10-1, X%10, X%10+1]
for i in check:
que.append(X*10+i)
count += 1
if count == k:
print((que[-1]))
exit() | p02720 |
from collections import deque
def main():
K = int(eval(input()))
num_list = list(range(0, 10))
def bfs():
q = deque(list(map(str, num_list)))
while len(num_list) < 2 * 10**6:
now_str = q.popleft()
now = int(now_str[0])
for j in [now-1, now, now+1]:
if j not in [-1, 10]:
new = str(j) + now_str
q.append(new)
if j != 0:
num_list.append(int(new))
bfs()
print((sorted(set(num_list))[K]))
if __name__ == "__main__":
main() | from collections import deque
def main():
K = int(eval(input()))
# bfs
count = 0
q = deque(list(range(1, 10)))
while count < K-1:
now = q.popleft()
count += 1
d1 = now % 10
base = 10 * now
for suffix in [d1 - 1, d1, d1 + 1]:
if suffix not in [-1, 10]:
new = base + suffix
q.append(new)
ans = q.popleft()
print(ans)
if __name__ == "__main__":
main() | p02720 |
from collections import deque
def main():
K = int(eval(input()))
# bfs
count = 0
q = deque(list(range(1, 10)))
while count < K-1:
now = q.popleft()
count += 1
d1 = now % 10
base = 10 * now
for suffix in [d1 - 1, d1, d1 + 1]:
if suffix not in [-1, 10]:
new = base + suffix
q.append(new)
ans = q.popleft()
print(ans)
if __name__ == "__main__":
main() | from collections import deque
def main():
K = int(eval(input()))
# bfs
q = deque(list(range(1, 10)))
for _ in range(K-1):
now = q.popleft()
d1 = now % 10
base = 10 * now
for suffix in [d1 - 1, d1, d1 + 1]:
if suffix not in [-1, 10]:
new = base + suffix
q.append(new)
ans = q.popleft()
print(ans)
if __name__ == "__main__":
main() | p02720 |
import queue
K = int(eval(input()))
q = queue.Queue()
for i in range(1, 10):
q.put(i)
for _ in range(K):
x = q.get()
d = x%10
t = x*10
if d != 0:
q.put(t-1+d)
q.put(t+d)
if d != 9:
q.put(t+1+d)
print(x) | # coding: utf-8
# d 現在の桁
# val 現在の値
# all 格納
def rec(d, val, all):
# 格納
all.append(val)
# 10桁なら終了
if d == 10:
return
# 再帰
for i in range(-1, 2):
add = val%10 + i
if 0 <= add <= 9:
rec(d+1, val*10+add, all)
# main
K = int(eval(input()))
all = []
# 1~9までを格納＆処理
for i in range(1, 10):
rec(1, i, all)
all.sort()
print((all[K-1])) | p02720 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.