Writing Algorithms Every Day (Queue) A Gift for April Fools' Day

Click to open the link

This topic has been opened before, which is to see (the amount that is not offset before B appears.

Code:

#include<iostream>
#include<cstdio>
#include<string.h>
#include<stack>
#include<queue>
#include<queue>
using namespace std ;
#define MAX 400
int main(){
  string s ;
  while(cin >> s) {
    queue<char> qe;
    int num =0;
    for (int i = 0 ; i <strlen(s.c_str());i++)
    {
        if(s[i]=='B')
        {
            break;
        }
        if(s[i]=='(')
        {
            qe.push ('(');
        }
        if(s[i]==')')
            if(!qe.empty())
                qe.pop();
    }
    cout << qe.size()<<endl;
  }
}