Submission #7081905

---

Source Code Expand

from itertools import product, combinations
N = int(input())
C = input()
c = "ABXY"

def solve(a, b):
    i = 0
    res = 0
    while i < N-1:
        A = C[i:i+2]
        if A==a or A==b:
            res += 1
            i += 2
        else:
            i += 1
    return res

ans = 0
for a, b in combinations([x+y for x, y in product(c, repeat=2)], 2):
    ans = max(ans, solve(a, b))
print(N-ans)

Submission Info

Judge Result