Submission #2498718


Source Code Expand

Copy
# cook your dish here
# from math import * 
#for _ in range(int(input().strip())):

s = input()
k = int(input())
var = 0
sub = set()
size = 0
for var in range(97,123):
    if len(sub)>k:
        break
    for i in range(len(s)):
        size=0
        if s[i]==chr(var):
            for j in range(i,len(s)):
                if size>=k:
                    break
                sub.add(s[i:(j+1)])
                size+=1 
l = list(sub)
l.sort()
print(l[k-1])

Submission Info

Submission Time
Task C - K-th Substring
User pankajkhan
Language Python (3.4.3)
Score 300
Code Size 482 Byte
Status AC
Exec Time 57 ms
Memory 3064 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 11
AC × 19
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 2_011.txt, 2_012.txt, 2_013.txt, 2_014.txt, 2_015.txt, 2_016.txt, 2_017.txt, 2_018.txt
Case Name Status Exec Time Memory
0_000.txt AC 17 ms 3064 KB
0_001.txt AC 17 ms 3064 KB
0_002.txt AC 17 ms 3064 KB
1_003.txt AC 17 ms 3064 KB
1_004.txt AC 17 ms 3060 KB
1_005.txt AC 17 ms 3064 KB
1_006.txt AC 17 ms 3064 KB
1_007.txt AC 17 ms 3064 KB
1_008.txt AC 17 ms 3064 KB
1_009.txt AC 17 ms 3064 KB
1_010.txt AC 17 ms 3064 KB
2_011.txt AC 57 ms 3060 KB
2_012.txt AC 33 ms 3064 KB
2_013.txt AC 19 ms 3064 KB
2_014.txt AC 18 ms 3064 KB
2_015.txt AC 18 ms 3064 KB
2_016.txt AC 19 ms 3064 KB
2_017.txt AC 19 ms 3064 KB
2_018.txt AC 19 ms 3064 KB