Score : 200 points
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)?
Input is given from Standard Input in the following format:
N S
Print number of occurrences of ABC
in S as contiguous subsequences.
10 ZABCDBABCQ
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.
19 THREEONEFOURONEFIVE
0
No contiguous subsequences of S are equal to ABC
.
33 ABCCABCBABCCABACBCBBABCBCBCBCABCB
5