Problem:
Score : 600 points

Problem Statement

You are given a string s consisting of A, B and C.

Snuke wants to perform the following operation on s as many times as possible:

Choose a contiguous substring of s that reads ABC and replace it with BCA.

Find the maximum possible number of operations.

Constraints

1 \leq |s| \leq 200000

Each character of s is A, B and C.

Input

Input is given from Standard Input in the following format:

s

Output

Find the maximum possible number of operations.

Sample Input 1

ABCABC

Sample Output 1

3

You can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.

Sample Input 2

C

Sample Output 2

0

Sample Input 3

ABCACCBABCBCAABCB

Sample Output 3

6

Solution in Lua (Lua 5.3.5) (judge verdict: Time Limit Exceeded)


local s = io.read()
-- s = "ABCABC"
-- s = "ABCACCBABCBCAABCB"
local c = {}
for i = 1, #s do
	c[i] = string.sub(s, i, i)
end
-- print_r(c)

local num = 0
local i = 1
while i <= #c - 2 do
	if c[i] == "A" then
		-- print(222, i, c[i], c[i+1], c[i+2])
		if c[i+1] == "B" and c[i+2] == "C" then
			c[i] = "B"
			c[i+1] = "C"
			c[i+2] = "A"
			i = i - 1
			if i <= 0 then
				i = 1
			end
			num = num + 1
		else
			i = i + 1
		end
	else
		i = i + 1
	end
end
print(num)