codeforces_A_solutions/code.cpp at main · ApurvRai/codeforces_A_solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include<iostream>
#include<queue>
#include<list>
#include<iterator>
#include<vector>
#include<cmath>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
typedef long long int ll;
/*struct node
{
    vector<ll> pos;
    ll f;
};*/
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll t;
	cin>>t;
	while(t--)
	{
	    string a;
	    cin>>a;
	    ll na=0,nb=0,nc=0;
	    for(ll i=0;i<a.size();i++)
	    {
	        if(a[i]=='A')
	         na++;
	        else if(a[i]=='B')
	         nb++;
	        else
	         nc++;
	    }
	    if(na>0&&nc>0)
	    {
	        if(nb==na+nc)
	         cout<<"YES\n";
	        else
	         cout<<"NO\n";
	    }
	    else if(na==0)
	    {
	        if(nc==nb)
	         cout<<"YES\n";
	        else
	         cout<<"NO\n";
	    }
	    else if(nc==0)
	    {
	        if(na==nb)
	         cout<<"YES\n";
	        else
	         cout<<"NO\n";
	    }
	    else
	     cout<<"NO\n";
	}
	return 0;
}