{"problem":{"name":"Count ABC","description":{"content":"We have a string $S$ of length $N$ consisting of uppercase English letters. How many times does `ABC` occur in $S$ as contiguous subsequences (see Sample Inputs and Outputs)?","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc150_b"},"statements":[{"statement_type":"Markdown","content":"We have a string $S$ of length $N$ consisting of uppercase English letters.\nHow many times does `ABC` occur in $S$ as contiguous subsequences (see Sample Inputs and Outputs)?\n\n## Constraints\n\n*   $3 \\leq N \\leq 50$\n*   $S$ consists of uppercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc150_b","tags":[],"sample_group":[["10\nZABCDBABCQ","2\n\nTwo contiguous subsequences of $S$ are equal to `ABC`: the $2$\\-nd through $4$\\-th characters, and the $7$\\-th through $9$\\-th characters."],["19\nTHREEONEFOURONEFIVE","0\n\nNo contiguous subsequences of $S$ are equal to `ABC`."],["33\nABCCABCBABCCABACBCBBABCBCBCBCABCB","5"]],"created_at":"2026-03-03 11:01:14"}}