锤子剪刀布
#include<iostream>
#include<algorithm>
using namespace std;
int A[6] = {0}, B[6] = {0};
void judge(char a, char b)
{
if (a == b)
A[1]++, B[1]++;
else if (a == 'C' && b == 'J')
{ A[0]++, B[2]++;
A[4]++;
}
else if (a == 'C' && b == 'B')
{ A[2]++, B[0]++;
B[5]++;
}
else if (a == 'J' && b == 'B')
{ A[0]++, B[2]++;
A[3]++;
}
else if (a == 'J' && b == 'C')
{ A[2]++, B[0]++;
B[4]++;
}
else if (a == 'B' && b == 'C')
{ A[0]++, B[2]++;
A[5]++;
}
else if (a == 'B' && b == 'J')
{ A[2]++, B[0]++;
B[3]++;
}
}
void fun(int C[])
{
int maxNumber = max(C[3], max(C[4], C[5]));
int index;
for (int i = 3; i < 6; i++)
if (maxNumber == C[i])
index = i;
switch (index)
{ case 3:
cout << 'J';
break;
case 4:
cout << 'C';
break;
default:
cout << 'B';
break;
}
}
int main()
{ char a, b;
int N;
cin >> N;
while (N--)
{ cin >> a >> b;
judge(a, b);
}
for (int i = 0; i < 3; i++)
{ cout << A[i];
if (i != 2)
cout << " ";
}
cout << endl;
for (int i = 0; i < 3; i++)
{ cout << B[i];
if (i != 2)
cout << " ";
}
cout << endl;
fun(A);
cout << " ";
fun(B);
cout << endl;
}