ABC

AtCoder

IDagc034_b

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

ABCABC

Output #1

3

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

Input #2

Output #2

Input #3

ABCACCBABCBCAABCB

Output #3

API Response (JSON)

{
  "problem": {
    "name": "ABC",
    "description": {
      "content": "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` a",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc034_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a string $s$ consisting of `A`, `B` and `C`.\nSnuke wants to perform the following operation on $s$ as many times as possible:\n\n*   Choose a contiguous substring of $s$ that reads `ABC` a...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments