Submission #3233095


Source Code Expand

st = list(str(input()))
s = [st[i] for i in range(len(st))]
ans = []
lis = []
for k in range(len(s)):
  lis = st
  while lis != [s[k] for _ in range(len(lis))]:
    cou = []
    for i in range(len(lis)-1):
      if lis[i+1] == s[k] or lis[i] == s[k]:
        cou.append(s[k])
      else:
        cou.append("X")
    lis = cou
  ans.append(len(lis))
print(len(s)-max(ans))

Submission Info

Submission Time
Task A - Shrinking
User tako0218
Language Python (3.4.3)
Score 300
Code Size 386 Byte
Status AC
Exec Time 164 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 14
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 16 ms 3060 KB
0_01.txt AC 17 ms 3064 KB
0_02.txt AC 17 ms 3064 KB
0_03.txt AC 20 ms 3064 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 164 ms 3064 KB
1_02.txt AC 18 ms 3064 KB
1_03.txt AC 34 ms 3064 KB
1_04.txt AC 50 ms 3060 KB
1_05.txt AC 54 ms 3064 KB
1_06.txt AC 67 ms 3064 KB
1_07.txt AC 55 ms 3064 KB
1_08.txt AC 129 ms 3064 KB
1_09.txt AC 136 ms 3064 KB