Submission #8415061


Source Code Expand

def main():
    s=input()
    m=int(input())
    tank=[]
    n=len(s)
    alpha=[chr(i) for i in range(97, 97+26)]
    for i in range(26):
        for j in range(n):
            if alpha[i]==s[j]:
                for k in range(min(n-j,m)):
                    if s[j:j+k+1] not in tank:
                        tank.append(s[j:j+k+1])
        if len(tank)>=m:
            break
    tank.sort()
    print(tank[m-1])
    
if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task C - K-th Substring
User modoki
Language PyPy3 (2.4.0)
Score 300
Code Size 478 Byte
Status AC
Exec Time 180 ms
Memory 39536 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 161 ms 38256 KB
0_001.txt AC 163 ms 38256 KB
0_002.txt AC 163 ms 38256 KB
1_003.txt AC 163 ms 38256 KB
1_004.txt AC 163 ms 38256 KB
1_005.txt AC 164 ms 38384 KB
1_006.txt AC 162 ms 38256 KB
1_007.txt AC 162 ms 38256 KB
1_008.txt AC 163 ms 38256 KB
1_009.txt AC 162 ms 38256 KB
1_010.txt AC 163 ms 38256 KB
2_011.txt AC 180 ms 39536 KB
2_012.txt AC 178 ms 39536 KB
2_013.txt AC 166 ms 38512 KB
2_014.txt AC 166 ms 38512 KB
2_015.txt AC 167 ms 38512 KB
2_016.txt AC 167 ms 38512 KB
2_017.txt AC 168 ms 38640 KB
2_018.txt AC 170 ms 38512 KB