Submission #3761973
Source Code Expand
import string S = input() ret = 1000 for c in string.ascii_letters: if c not in S: continue k = 0 t = S nt = "" while t.count(c) != len(t): k += 1 nt = "" for i in range(len(t) - 1): if t[i] == c or t[i + 1] == c: nt += c else: nt += t[i] t = nt ret = min(ret, k) print(ret)
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | wat_shun |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 427 Byte |
Status | AC |
Exec Time | 55 ms |
Memory | 4084 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 36 ms | 4084 KB |
0_01.txt | AC | 24 ms | 3764 KB |
0_02.txt | AC | 24 ms | 3764 KB |
0_03.txt | AC | 25 ms | 3768 KB |
1_00.txt | AC | 24 ms | 3768 KB |
1_01.txt | AC | 26 ms | 3764 KB |
1_02.txt | AC | 24 ms | 3764 KB |
1_03.txt | AC | 24 ms | 3764 KB |
1_04.txt | AC | 25 ms | 3768 KB |
1_05.txt | AC | 25 ms | 3768 KB |
1_06.txt | AC | 29 ms | 3764 KB |
1_07.txt | AC | 31 ms | 3764 KB |
1_08.txt | AC | 45 ms | 3764 KB |
1_09.txt | AC | 55 ms | 3764 KB |