101501: [AtCoder]ABC150 B - Count ABC

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $200$ points

Problem Statement

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)?

Constraints

  • $3 \leq N \leq 50$
  • $S$ consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

$N$
$S$

Output

Print number of occurrences of ABC in $S$ as contiguous subsequences.


Sample Input 1

10
ZABCDBABCQ

Sample Output 1

2

Two contiguous subsequences of $S$ are equal to ABC: the $2$-nd through $4$-th characters, and the $7$-th through $9$-th characters.


Sample Input 2

19
THREEONEFOURONEFIVE

Sample Output 2

0

No contiguous subsequences of $S$ are equal to ABC.


Sample Input 3

33
ABCCABCBABCCABACBCBBABCBCBCBCABCB

Sample Output 3

5

Input

题意翻译

**题意翻译** 输入一个长度为 $N$ 的字符串 $S$。 输出 $S$ 中包含多少个连续的 ABC。

加入题单

上一题 下一题 算法标签: