Problem:
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

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <limits.h>
int main (void) {
int N;
scanf("%d",&N);
char S[N];
scanf("%s",S);
char txt[]="ABC";
int count=0;
int res =0;
if (N==strlen(txt)) {if (strcmp(S,txt)==0)
                        res=1;
                     else res = 0;}
 for (int i=0;i<=N-strlen(txt);i++){

    for (int j=0;j<strlen(txt);j++){
        if (S[i+j]==txt[j])count++;
        if (count==3 || S[i+j]!=txt[j]) break;
    }
    if (count == strlen(txt)) res++;
    count=0;
 }
 printf("%d",res);


return EXIT_SUCCESS;
}