Submission #3046987

---

Source Code Expand

s = raw_input();
K = int(raw_input());

l = len(s)

ss = []
num = 0

for i in range(1,l+1):
    for j in range(l-i+1):
        slice = s[j:j+i]
#        print slice in ss
        if (slice in ss) is True:
#            print slice
            continue
        else:
            ss.append(slice)
            ss.sort()
            if len(ss) > K :
                ss.pop()
#        print ss

print ss[K-1]
            
    

Submission Info

Judge Result