AC代码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn=1e6;
int main()
{
int T,w=0,e=0,l=0,j1=0,b1=0,c1=0,j2=0,b2=0,c2=0;
string m,n;
cin>>T;
for(int i=0;i<T;i++)
{
cin>>m>>n;
if((m[0]=='J'&&n[0]=='B')||(m[0]=='C'&&n[0]=='J')||(m[0]=='B'&&n[0]=='C'))
{
w++;
if(m[0]=='J') j1++;
if(m[0]=='C') c1++;
if(m[0]=='B') b1++;
}
else if(m[0]==n[0])
e++;
else
{
l++;
if(n[0]=='J') j2++;
if(n[0]=='C') c2++;
if(n[0]=='B') b2++;
}
}
cout<<w<<" "<<e<<" "<<l<<endl;
cout<<l<<" "<<e<<" "<<w<<endl;
string r;
int num;
num=max(max(j1,b1),c1);
r=(b1==num)?"B":((c1==num)?"C":"J");
cout<<r<<" ";
num=max(max(j2,b2),c2);
r=(b2==num)?"B":((c2==num)?"C":"J");
cout<<r<<endl;
return 0;
}