ソースコード 拡げる

Copy
```import sys
import math
if __name__ == "__main__":
s = str(input())
K = int(input())
uniq = sorted(list(set(list(s))))
buf = []
for i in range(len(uniq)):
buf.append(uniq[i])
for j in range(len(s)):
if s[j] == uniq[i]:
fin = K
if (len(s) - j) - K < 0:
fin = (len(s) - j)
for k in range(1, fin):
buf.append(s[j:j+k+1])
ans = sorted(buf)
#   print(ans)
print(ans[K-1])```

#### 提出情報

提出日時 2018-05-12 21:49:32+0900 C - K-th Substring tomowill Python (3.4.3) 0 491 Byte WA 52 ms 4468 KB

#### ジャッジ結果

 AC × 3
 AC × 9 WA × 2
 AC × 9 WA × 10
セット名 テストケース
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 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 3064 KB
1_005.txt WA 17 ms 3064 KB
1_006.txt WA 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 WA 31 ms 4468 KB
2_012.txt WA 31 ms 4468 KB
2_013.txt WA 47 ms 4340 KB
2_014.txt WA 50 ms 4468 KB
2_015.txt WA 42 ms 4084 KB
2_016.txt WA 49 ms 4468 KB
2_017.txt WA 52 ms 4468 KB
2_018.txt WA 52 ms 4468 KB