1579A - Casimir's String Solitaire - CodeForces Solution

//You can't do anything until you try
#include<bits/stdc++.h>
using namespace std;
#define Checkmate return 0
#define ll long long
#define newl '\n'

class test{
    void process();
    public:
        void withTestCase();
        void withOutTestCase();
};

void test::withTestCase(){
    int t;    cin>>t;
    while(t--){
        process();
    }
    return;
}

void test::process(){
    string ch;    cin>>ch;
    int A_count = count(ch.begin(), ch.end(), 'A');
    int B_count = count(ch.begin(), ch.end(), 'B');
    int C_count = count(ch.begin(), ch.end(), 'C');

    if(A_count + C_count == B_count) cout<<"YES\n";
    else cout<<"NO\n";

    return;
}

void test::withOutTestCase(){
    process();
    return;
}

int main(int argc, char const *argv[]){
    test ob;
    ob.withTestCase();
    Checkmate;
}