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 Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

program abc
  implicit none
  character(200010) :: s
  integer :: x(200010), a, n, m, i
  x = -1
  read(*,*) s
  s = trim(adjustl(s))
  n = len_trim(s)
  if (n.lt.3) then
    write(*,'(i0)') 0
    stop
  end if
  i = 1
  m = 0
  do while (i.le.n-1)
    m = m+1
    if (s(i:i).eq."A") then
      x(m) = 1
    else if (s(i:i+1).eq."BC") then
      x(m) = 0
      i = i+1
    end if
    i = i+1
  end do
  n = m+1
  m = 0
  a = 0
  i = 1
  do i = 1, n
    select case(x(i))
      case(-1)
        a = 0
      case(0)
        m = m+a
      case(1)
        a = a+1
    end select
  end do
  write(*,'(i0)') m
  stop
end program abc