提出 #5291855
ソースコード 拡げる
s=input()
k=int(input())
S=set()
for i in range(len(s)):
for j in range(1,k+1):
S.add(s[i:i+j])
print(sorted(list(S))[k-1])
提出情報
| 提出日時 | |
|---|---|
| 問題 | C - K-th Substring |
| ユーザ | takakin |
| 言語 | Python (3.4.3) |
| 得点 | 300 |
| コード長 | 135 Byte |
| 結果 | AC |
| 実行時間 | 35 ms |
| メモリ | 4592 KiB |
ジャッジ結果
| セット名 | Sample | Subtask | All | ||||||
|---|---|---|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
| 結果 |
|
|
|
| セット名 | テストケース |
|---|---|
| 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 |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| 0_000.txt | AC | 17 ms | 2940 KiB |
| 0_001.txt | AC | 17 ms | 2940 KiB |
| 0_002.txt | AC | 17 ms | 2940 KiB |
| 1_003.txt | AC | 17 ms | 2940 KiB |
| 1_004.txt | AC | 17 ms | 2940 KiB |
| 1_005.txt | AC | 17 ms | 2940 KiB |
| 1_006.txt | AC | 17 ms | 2940 KiB |
| 1_007.txt | AC | 17 ms | 2940 KiB |
| 1_008.txt | AC | 17 ms | 2940 KiB |
| 1_009.txt | AC | 17 ms | 3060 KiB |
| 1_010.txt | AC | 17 ms | 2940 KiB |
| 2_011.txt | AC | 26 ms | 3060 KiB |
| 2_012.txt | AC | 26 ms | 3060 KiB |
| 2_013.txt | AC | 34 ms | 4460 KiB |
| 2_014.txt | AC | 34 ms | 4592 KiB |
| 2_015.txt | AC | 30 ms | 4328 KiB |
| 2_016.txt | AC | 35 ms | 4588 KiB |
| 2_017.txt | AC | 34 ms | 4584 KiB |
| 2_018.txt | AC | 35 ms | 4588 KiB |