题目:
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
问题描述
输入格式:
输入第 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<cstring>
using namespace std;
int main() {
int n, c[3] = {0}, d[3] = {0};
cin >> n;
char a, b;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a == 'C' && b == 'J' || a == 'J' && b == 'B' || a == 'B' && b == 'C') {
if (a == 'C' && b == 'J') c[0]++;
else if (a == 'J' && b == 'B') c[1]++;
else if (a == 'B' && b == 'C') c[2]++;
cnt1++;
} else if (a == 'J' && b == 'C' || a == 'B' && b == 'J' || a == 'C' && b == 'B') {
cnt2++;
if (a == 'J' && b == 'C') d[0]++;
else if (a == 'B' && b == 'J') d[1]++;
else if ( a == 'C' && b == 'B') d[2]++;
} else if (a == b) {cnt3++;
}
}
cout << cnt1 << " " << cnt3 << " " << cnt2 << endl;
cout << cnt2 << " " << cnt3 << " " << cnt1 << endl;
int max = 0, max2 = 0, t, f;
for (int i = 0; i < 3; i++) {
if (c[i] > max) {
max = c[i];
t = i;
}
if (d[i] > max2) {
max2 = d[i];
f = i;
}
}
int k = 0, l = 0;
for (int i = 0; i < 3; i++) {
if (max == c[i]) k++;
}
for (int i = 0; i < 3; i++) {
if (max2 == d[i]) l++;
}
if (k == 1) {
if (t == 0) cout << "C" << " ";
else if (t == 1) cout << "J" << " ";
else cout << "B" << " ";
} else if (k > 1) {
if (c[2] == max && c[0] == max && c[1] == max) cout << "B" << " ";
if (c[2] != max && c[0] == max && c[1] == max) cout << "C" << " ";
if (c[2] == max && c[0] != max && c[1] == max) cout << "B" << " ";
if (c[2] == max && c[0] == max && c[1] != max) cout << "C" << " ";
}
if (l == 1) {
if (f == 0) cout << "C" << endl;
else if (f == 1) cout << "J" << endl;
else cout << "B" << endl;
} else if (l > 1) {
if (d[2] == max2 && d[0] == max2 && d[1] == max2) cout << "B" << endl;
if (d[2] != max2 && d[0] == max2 && d[1] == max2) cout << "C" << endl;
if (d[2] == max2 && d[0] != max2 && d[1] == max2) cout << "B" << endl;
if (d[2] == max2 && d[0] == max2 && d[1] != max2) cout << "C" << endl;
}
return 0;
}