Submission #1359361
Source Code Expand
def do(x, c): if len(x) == 1 or x.count(c) == len(x):return 0 res = "" for i in range(len(x) - 1): if(x[i] == c or x[i+1] == c):res += c else: res += x[i] return 1 + do(res, c) s = raw_input() ans = 100 for c in "abcdefghijklmnopqrstuvwxyz": ans = min(ans, do(s, c)) print ans
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | catupper |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 329 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 2692 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 | 11 ms | 2692 KB |
0_01.txt | AC | 10 ms | 2568 KB |
0_02.txt | AC | 10 ms | 2568 KB |
0_03.txt | AC | 11 ms | 2568 KB |
1_00.txt | AC | 10 ms | 2568 KB |
1_01.txt | AC | 28 ms | 2692 KB |
1_02.txt | AC | 26 ms | 2692 KB |
1_03.txt | AC | 24 ms | 2692 KB |
1_04.txt | AC | 25 ms | 2692 KB |
1_05.txt | AC | 21 ms | 2568 KB |
1_06.txt | AC | 21 ms | 2692 KB |
1_07.txt | AC | 17 ms | 2568 KB |
1_08.txt | AC | 22 ms | 2692 KB |
1_09.txt | AC | 21 ms | 2692 KB |