Submission #2496753


Source Code Expand

s=input()
N=len(s)
K=int(input())
L=[]
for i in range(1,K+1):
    for j in range(N-i+1):
        L.append(s[j:j+i])
L.sort()
M=len(L)
k=0
if K==1:
    print(L[0])
    exit()
for j in range(M-1):
    if L[j]!=L[j+1]:
        k+=1
    if k==K:
        print(L[j])
        break

Submission Info

Submission Time
Task C - K-th Substring
User shakayami
Language Python (3.4.3)
Score 0
Code Size 295 Byte
Status WA
Exec Time 33 ms
Memory 4340 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 8
WA × 3
AC × 15
WA × 4
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 3060 KB
0_002.txt AC 17 ms 3064 KB
1_003.txt WA 17 ms 3060 KB
1_004.txt WA 17 ms 3060 KB
1_005.txt WA 17 ms 3064 KB
1_006.txt AC 17 ms 3064 KB
1_007.txt AC 17 ms 3060 KB
1_008.txt AC 17 ms 3064 KB
1_009.txt AC 17 ms 3060 KB
1_010.txt AC 17 ms 3064 KB
2_011.txt WA 29 ms 4212 KB
2_012.txt AC 25 ms 4212 KB
2_013.txt AC 31 ms 4212 KB
2_014.txt AC 33 ms 4340 KB
2_015.txt AC 28 ms 3956 KB
2_016.txt AC 33 ms 4340 KB
2_017.txt AC 32 ms 4340 KB
2_018.txt AC 33 ms 4340 KB