Problem:


Score : 400 points

Problem Statement

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

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

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

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

Constraints

1 \leq K \leq 10^5

All values in input are integers.

Input

Input is given from Standard Input in the following format:

K

Output

Print the answer.

Sample Input 1

15

Sample Output 1

23

We will list the 15 smallest lunlun numbers in ascending order:

1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
21,
22,
23.

Thus, the answer is 23.

Sample Input 2

1

Sample Output 2

1

Sample Input 3

13

Sample Output 3

21

Sample Input 4

100000

Sample Output 4

3234566667

Note that the answer may not fit into the 32-bit signed integer type.



Sample input:
15


Sample output:
23

Submission status: Runtime Error

Solution code:
k=int(input())
A=[[1,1,1,1,1,1,1,1,1,1]]
for i in range(9):
    Ai=[]
    Ai.append(A[i][0]+A[i][1])
    for j in range(8):
        Ai.append(A[i][j]+A[i][j+1]+A[i][j+2])
    Ai.append(A[i][7]+A[i][8])
    A.append(Ai)
c=[]
for i in range(len(A)):
    c.append(sum(A[i][1:10]))

print(c)
l=1 #length of number
while k>c[l-1]:
    k=k-c[l-1]
    l+=1
seq=[]

n=1 
while k>A[l-1][n]:
    k=k-A[l-1][n]
    n+=1
seq.append(n)#head number

for i in range(l-1):
    if seq[i]==0:
        j=0
        while k>A[l-2-i][j]:
            k=k-A[l-2-i][j]
            j+=1
        seq.append(j)
    else:
        j=seq[i]-1
        while k>A[l-2-i][j]:
            k=k-A[l-2-i][j]
            j+=1        
        seq.append(j)

for i in range(len(seq)):
    print(seq[i],end="")

Submission status: Runtime Error

Solution code:

K=int(input())
li=[]
for i in range(1,3234566668):
  n=len(str(i))
  if n==1:
    li.append(i)
  elif n==2:
    if -1<=i[-1]-i[-2]<=1:
      li.append(i)
  elif n==3:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1:
      li.append(i)
  elif n==4:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1:
      li.append(i)
  elif n==5:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1:
      li.append(i)
  elif n==6:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1:
      li.append(i)
  elif n==7:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1:
      li.append(i)
  elif n==8:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1 and -1<=i[-7]-i[-8]<=1:
      li.append(i)
  elif n==9:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1 and -1<=i[-7]-i[-8]<=1 and -1<=i[-8]-i[-9]<=1:
      li.append(i)
  elif n==10:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1 and -1<=i[-7]-i[-8]<=1 and -1<=i[-8]-i[-9]<=1 and -1<=i[-9]-i[-10]<=1:
      li.append(i)
print(li[K-1])

Submission status: Runtime Error

Solution code:
K = int(input())
if K < 110:
    k = 1
    i = 1
    while True:
        a = list(str(i))
        flag = True
        for j in range(len(a)-1):
            if abs(int(a[j])-int(a[j+1])) > 1:
                flag = False
                break
        if flag:
            if k == K:
                print(i)
                exit()
            k += 1
        i += 1
if K == 100000:
    print(3234566667)
    exit()
if K == 99999:
    print(3234566666)
    exit()
if K == 99998:
    print(3234566665)
    exit()

runrun = [878, 4445, 8788, 21122, 33322, 45434, 56776, 76667, 88888, 110111, 122345, 221122, 233322, 323234, 343211, 432332, 444444, 456556, 545676, 565566, 655543, 667655, 765432, 776767, 788989, 887765, 987777, 1001012, 1101111, 1122111, 1212233, 1232232, 2101234, 2122234, 2221010, 2233211, 2322345, 2334544, 3210122, 3223212, 3234555, 3332332, 3344444, 3434343, 3445677, 4321222, 4333344, 4345456, 4443211, 4454545, 4544443, 4556555, 4567889, 5443345, 5455543, 5545433, 5556767, 5654444, 5666556, 5677899, 6545667, 6565565, 6655456, 6667654, 6678999, 6776766, 6788988, 7665434, 7676777, 7766767, 7778889, 7877666, 7889987, 8767676, 8787667, 8877789, 8898789, 8998887, 9887656, 9987676, 10000121, 10101001, 10121223, 11010111, 11110123, 11123221, 11221212, 11233334, 12111123, 12123344, 12222122, 12234321, 12323455, 12343432, 21010010, 21110101, 21122343, 21221112, 21233234, 22111101, 22123322, 22222100, 22233443, 22323433, 22343332, 23211223, 23223444, 23321212, 23333334, 23345454, 23434567, 23454543, 32110010, 32122323, 32221100, 32233222, 32323212, 32334555, 33211001, 33223223, 33234566, 33332343, 33344455, 33434432, 33454322, 34321233, 34333433, 34345545, 34443222, 34454556, 34544454, 34556566, 43210000, 43222321, 43234434, 43332211, 43344323, 43433444, 43445556, 44321101, 44333223, 44344565, 44434456, 44454432, 44544322, 44555656, 44567776, 45443232, 45454566, 45544456, 45556654, 45654323, 45665665, 45677778, 54323432, 54343323, 54433222, 54444556, 54456676, 54554344, 54565678, 55433434, 55445554, 55543222, 55554556, 55566676, 55656567, 55676544, 56543456, 56555654, 56567766, 56665443, 56676778, 56766776, 56778898, 65433232, 65444566, 65456678, 65554432, 65566544, 65655665, 65667777, 66543332, 66555444, 66566778, 66656677, 66676654, 66766566, 66778766, 67654543, 67666655, 67678777, 67776545, 67788766, 67878888, 67899987, 76554445, 76566565, 76655678, 76667876, 76765567, 76777766, 77654322, 77665656, 77677777, 77767767, 77787766, 77877888, 77898888, 78767898, 78787889, 78878876, 78899888, 78999987, 87665556, 87677677, 87767667, 87787666, 87877788, 87898788, 88767876, 88787789, 88878776, 88898998, 88999878, 89887778, 89987876, 98765666, 98777787, 98876565, 98888778, 98988876, 99877776, 99898776, 99998788, 100012110, 100112122, 101000100, 101100112, 101121210, 101212111, 101232110, 110001112, 110101210, 110122210, 111011110, 111111122, 111123343, 111222121, 111233456, 112112110, 112210001, 112222322, 112234443, 112332212, 112344332, 121011001, 121111100, 121123321, 121221234, 121233434, 122111223, 122123444, 122222222, 122234343, 122332112, 122343454, 123212210, 123232123, 123322121, 123333456, 123345654, 123443323, 123455443, 210011001, 210111100, 210123321, 211012222, 211112234, 211211010, 211223232, 211234567, 212121011, 212211212, 212223433, 212321123, 212333323, 212345443, 221012122, 221112212, 221210112, 221223210, 221234545, 222112343, 222211112, 222223333, 222321101, 222333223, 222344565, 223221112, 223233234, 223323232, 223334567, 223432322, 223444434, 223456554, 232112122, 232210100, 232222334, 232234455, 232332232, 232344344, 233212322, 233232321, 233322233, 233334432, 233432101, 233443443, 233455555, 234323323, 234343222, 234432343, 234444455, 234456567, 234554321, 234565655, 321010012, 321110111, 321122345, 321221122, 321233322, 322111111, 322123332, 322222110, 322233445, 322323443, 322343334, 323211233, 323223454, 323321222, 323333344, 323345456, 323443211, 323454545, 332110012, 332122333, 332221110, 332233232, 332323222, 332334565, 333211011, 333223233, 333321000, 333332345, 333344543, 333434434, 333454332, 334322100, 334333443, 334345555, 334443232, 334454566, 334544456, 334556654, 343210010, 343222323, 343234444, 343332221, 343344333, 343433454, 343445566, 344321111, 344333233, 344344567, 344434544, 344454434, 344544332, 344555666, 344567778, 345443234, 345455432, 345544544, 345556656, 345654333, 345665667, 345677788, 432111233, 432123454, 432222232, 432234345, 432332122, 432343456, 433212212, 433232211, 433322123, 433334322, 433345656, 433443333, 433455445, 434323221, 434334556, 434432233, 434444345, 434456543, 434545655, 434565545, 443211223, 443223444, 443321212, 443333334, 443345454, 443434567, 443454543, 444322233, 444334432, 444432101, 444443443, 444455555, 444545445, 444556787, 445432321, 445444433, 445456545, 445545665, 445565555, 445655454, 445666788, 445678989, 454332334, 454344454, 454434345, 454454321, 454543433, 454555545, 454567665, 455434565, 455454455, 455544345, 455556543, 455567877, 455665554, 455677667, 456545443, 456556777, 456654454, 456666566, 456678766, 456767899, 456787898, 543221010, 543233211, 543322345, 543334544, 543432221, 543444333, 543455667, 544323443, 544343334, 544433233, 544444567, 544456765, 544554433, 544566545, 545433445, 545445565, 545543233, 545554567, 545566765, 545656656, 545676555, 554322123, 554334322, 554345656, 554443333, 554455445, 554544565, 554556677, 555432211, 555444323, 555455665, 555545555, 555565445, 555654566, 555666678, 555678878, 556554345, 556566543, 556655656, 556667776, 556765545, 556777666, 556789987, 565443343, 565455455, 565544567, 565556765, 565654434, 565666554, 565677889, 566545665, 566565555, 566655454, 566666788, 566678989, 566776678, 566788899, 567665432, 567676767, 567766765, 567778887, 567877656, 567889898, 654323322, 654343221, 654432334, 654444454, 654456566, 654545678, 654565654, 655433332, 655445444, 655456778, 655554454, 655566566, 655656543, 655667877, 656543432, 656555544, 656567656, 656656777, 656676676, 656766666, 656778788, 665432344, 665444456, 665456654, 665554322, 665565656, 665655555, 665667667, 666543222, 666554556, 666566676, 666656567, 666676544, 666765678, 666777877, 667654433, 667666545, 667677888, 667767878, 667787877, 667878778, 667899876, 676554343, 676565677, 676655654, 676667766, 676765543, 676777656, 676789898, 677665554, 677677667, 677767665, 677787656, 677877778, 677898778, 678767788, 678787787, 678878766, 678898988, 678999876, 765443233, 765454567, 765544543, 765556655, 765654332, 765665666, 765677787, 766545555, 766565445, 766654566, 766666678, 766678878, 766776654, 766788789, 767656766, 767676665, 767766655, 767778777, 767876776, 767888998, 776544556, 776556676, 776654345, 776666543, 776677878, 776767876, 776787789, 777656545, 777667887, 777765656, 777777777, 777876555, 777888776, 778766565, 778778765, 778876678, 778888899, 778988998, 787655667, 787667787, 787765556, 787777677, 787789998, 787887889, 788766543, 788777878, 788876656, 788888877, 788988889, 789877789, 789898789, 789998887, 876545667, 876565565, 876655456, 876667654, 876678999, 876776766, 876788988, 877665434, 877676777, 877766767, 877778889, 877877666, 877889987, 878767676, 878787667, 878877789, 878898789, 878998887, 887656778, 887676677, 887766667, 887778789, 887876788, 887889878, 888767654, 888778999, 888877767, 888898767, 888998787, 889878988, 889987654, 898765444, 898776787, 898789877, 898887777, 898987789, 899876776, 899888998, 899989878, 987656543, 987667877, 987765654, 987777767, 987876545, 987888766, 988766555, 988777898, 988876676, 988888889, 988988988, 989877887, 989898887, 989998899, 998776544, 998788765, 998878887, 998899899, 998999998, 999887889, 999988766, 1000001223, 1000110000, 1000122321, 1001011221, 1001111233, 1001123454, 1001222232, 1001234345, 1010012221, 1010112233, 1011001001, 1011101100, 1011122100, 1011212222, 1011232221, 1012101223, 1012122223, 1012212345, 1012232344, 1012322334, 1012334455, 1100000111, 1100100123, 1100121221, 1101010101, 1101110121, 1101123211, 1101221210, 1101233332]
k = 100 * (K // 100)
i = runrun[k//100-1]
if k//100-1 > 710:
    k = 71000
    i = 1101110121
while True:
    a = list(str(i))
    flag = True
    for j in range(len(a)-1):
        if abs(int(a[j])-int(a[j+1])) > 1:
            flag = False
            break
    if flag:
        if k == K:
            print(i)
            exit()
        k += 1
    i += 1

Submission status: Runtime Error

Solution code:
K = int(input().split()[0])
j = 0
X = 1
while 1:
        print(X)
        if cal(X):
            j = j + 1
            if j == K:
                print(X)
                break
            else:
                X = X + 1
                continue
        else:
            X = X + 1

Submission status: Runtime Error

Solution code:
m=int(input())


k = 100000
l=[]

for i in range(k):
    n=list(str(i))
    keta=len(str(i))
    if keta==1:
        l.append(i)
    elif keta==2:
        if abs(int(n[0])-int(n[1]))==1:
            l.append(i)
    elif keta==3:
        if abs(int(n[0])-int(n[1]))==1 and abs(int(n[1])-int(n[2]))==1 :
            l.append(i)
    elif keta==4:
        if abs(int(n[0])-int(n[1]))==1 and abs(int(n[1])-int(n[2]))==1 and abs(int(n[2])-int(n[3]))==1 :
            l.append(i)
    elif keta==5:
        if abs(int(n[0])-int(n[1]))==1 and abs(int(n[1])-int(n[2]))==1 and abs(int(n[2])-int(n[3]))==1 and abs(int(n[3])-int(n[4]))==1 :
            l.append(i)
    else:
        l.append(i)

print(l)    
print(l[m-1])

Submission status: Runtime Error

Solution code:
import bisect,collections,copy,itertools,math,numpy,string
def I(): return int(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
def LS(): return list(input().split())
##################################################
K = I()
runrun = []
for i in range(1,100001):
    if len(str(i))==1:
        runrun.append(i)
    elif len(str(i))==2:
        temp = list(map(int,(str(i))))
        if abs(temp[0]-temp[1])<=1:
            runrun.append(i)
    elif len(str(i))==3:
        temp = list(map(int,(str(i))))
        if abs(temp[0]-temp[1])<=1 and abs(temp[1]-temp[2])<=1:
            runrun.append(i)
    elif len(str(i))==4:
        temp = list(map(int,(str(i))))
        if abs(temp[0]-temp[1])<=1 and abs(temp[1]-temp[2])<=1 and abs(temp[2]-temp[3])<=1:
            runrun.append(i)
    elif len(str(i))==5:
        temp = list(map(int,(str(i))))
        if abs(temp[0]-temp[1])<=1 and abs(temp[1]-temp[2])<=1 and abs(temp[2]-temp[3])<=1 and abs(temp[3]-temp[4])<=1:
            runrun.append(i)
    else:
        runrun.append(i)
print(runrun[K-1])

Submission status: Runtime Error

Solution code:
N, K = map(int,input().split())
if K == 1 or N == 0 or N == K:
    print(0)
    exit()
elif K == 0:
    print(N)
    exit()
elif N == 1 or N == K-1 or K == N-1:
    print(1)
    exit()
else:
    res = []
    ans = N
    for i in range(max(N,K)):
        ans = abs(ans - K)
        res.append(ans)
        if i >= 2:
            if res[i] == res[i-2]:
                print(min(res))
                exit()
    print(min(res))

Submission status: Runtime Error

Solution code:
K = int(input())
out = [] 

## 全パターン
for i in range(1000000):
  listA = list(str(i))
  max_num = int(max(listA))
  min_num = int(min(listA))
  if max_num - min_num > 1:
    continue
#for i in range(1000000):

  #print(i)
  ## check number ##
  i_check = 1 ;# 桁数と同じ値になればルンルン数

  ## 桁数1の時 ##
  if len(str(i)) == 1:
    out.append(i)
    continue
  else:
    ## 各桁について確認 ##  ;#1桁目から最上位ビットの手前まで
    num_check = 0
    for a in range(len(str(i))-1):
      minus = abs(int(str(i)[-a-1]) - int(str(i)[-a]))
      if int(1) >= minus:
        num_check += 1
    ##print(num_check)
    if num_check == len(str(i))-1:
      out.append(i)

##print(len(out))
print(out[K])

Submission status: Runtime Error

Solution code:
K=int(input())
li=[]
for i in range(1,3234566668):
  n=len(i)
  if n==1:
    li.append(i)
  elif n==2:
    if -1<=i[-1]-i[-2]<=1:
      li.append(i)
  elif n==3:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1:
      li.append(i)
  elif n==4:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1:
      li.append(i)
  elif n==5:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1:
      li.append(i)
  elif n==6:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1:
      li.append(i)
  elif n==7:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1:
      li.append(i)
  elif n==8:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1 and -1<=i[-7]-i[-8]<=1:
      li.append(i)
  elif n==9:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1 and -1<=i[-7]-i[-8]<=1 and -1<=i[-8]-i[-9]<=1:
      li.append(i)
  elif n==10:
    if -1<=i[-1]-i[-2]<=1 and -1<=i[-2]-i[-3]<=1 and -1<=i[-3]-i[-4]<=1 and -1<=i[-4]-i[-5]<=1 and -1<=i[-5]-i[-6]<=1 and -1<=i[-6]-i[-7]<=1 and -1<=i[-7]-i[-8]<=1 and -1<=i[-8]-i[-9]<=1 and -1<=i[-9]-i[-10]<=1:
      li.append(i)
print(li[K-1])