Submission #4068733


Source Code Expand

def n_gram(seq, n):
    return {seq[i: i+n] for i in range(len(seq) - n + 1)}

def main(s, k):
    tmp = set()
    for i in range(1, 6):
        tmp = tmp | n_gram(s, i)
    substr = sorted(list(tmp))
    print(substr[k-1])

if __name__ == '__main__':
    main(input(), int(input()))

Submission Info

Submission Time
Task C - K-th Substring
User mizume
Language Python (3.4.3)
Score 300
Code Size 294 Byte
Status AC
Exec Time 32 ms
Memory 4804 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 18 ms 3060 KB
0_001.txt AC 18 ms 3060 KB
0_002.txt AC 18 ms 2940 KB
1_003.txt AC 17 ms 2940 KB
1_004.txt AC 17 ms 3060 KB
1_005.txt AC 18 ms 2940 KB
1_006.txt AC 18 ms 2940 KB
1_007.txt AC 18 ms 3060 KB
1_008.txt AC 17 ms 3060 KB
1_009.txt AC 18 ms 3060 KB
1_010.txt AC 18 ms 3060 KB
2_011.txt AC 23 ms 3060 KB
2_012.txt AC 22 ms 3060 KB
2_013.txt AC 30 ms 4676 KB
2_014.txt AC 32 ms 4796 KB
2_015.txt AC 28 ms 4804 KB
2_016.txt AC 31 ms 4800 KB
2_017.txt AC 31 ms 4804 KB
2_018.txt AC 31 ms 4804 KB