一、题目描述
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第 1 行给出正整数 N(≤105),即双方交锋的次数。随后 N 行,每行给出一次交锋的信息,即甲、乙双方同时给出的的手势。C
代表“锤子”、J
代表“剪刀”、B
代表“布”,第 1 个字母代表甲方,第 2 个代表乙方,中间有 1 个空格。
输出格式:
输出第 1、2 行分别给出甲、乙的胜、平、负次数,数字间以 1 个空格分隔。第 3 行给出两个字母,分别代表甲、乙获胜次数最多的手势,中间有 1 个空格。如果解不唯一,则输出按字母序最小的解。
输入样例:
10
C J
J B
C B
B B
B C
C C
C B
J B
B C
J J
//结尾无空行
输出样例:
5 3 2
2 3 5
B B
//结尾无空行
二、题解代码以及提交截图
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
struct compound_mode{
char A;
char B;
};
int main()
{
int N;
cin >> N;
int count_c1 = 0,count_j1 = 0,count_b1 = 0;
int count_c2 = 0,count_j2 = 0,count_b2 = 0;
vector<compound_mode> list1;
vector<compound_mode> list2;
vector<compound_mode> list3;
for(int i = 0;i < N;i++){
char A,B;
compound_mode C{};
cin >> A >>B;
if((A == 'C' && B == 'J') || (A == 'B' && B == 'C') || (A == 'J' && B == 'B')){
C.A = A;
C.B = B;
list1.push_back(C);
}
else if((A == 'C' && B == 'B') || (A == 'B' && B == 'J') || (A == 'J' && B == 'C')){
C.A = A;
C.B = B;
list2.push_back(C);
}
else{
C.A = A;
C.B = B;
list3.push_back(C);
}
}
cout << list1.size() << " " << list3.size() << " " << list2.size();
cout << endl;
cout << list2.size() << " " << list3.size() << " " << list1.size();
cout << endl;
for(auto & i : list1){
if(i.A == 'C'){
count_c1++;
}
else if(i.A == 'J'){
count_j1++;
}
else{
count_b1++;
}
}
double max1 = fmax(fmax(count_b1,count_c1),count_j1);
if(max1 == count_b1){
cout << 'B';
}
else if(max1 == count_c1){
cout << 'C';
}
else{
cout << 'J';
}
for(auto & i : list2){
if(i.B == 'C'){
count_c2++;
}
else if(i.B == 'J'){
count_j2++;
}
else{
count_b2++;
}
}
cout << " ";
double max2 = fmax(fmax(count_b2,count_c2),count_j2);
if(max2 == count_b2){
cout << 'B';
}
else if(max2 == count_c2){
cout << 'C';
}
else{
cout << 'J';
}
return 0;
}