1018. 锤子剪刀布 (20)
时间限制
100 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
![](http://nos.patest.cn/7r_muvaqb4myb9.jpg)
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第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>
using namespace std;
#define C 0
#define J 1
#define B 2
int wintimea[3] = { 0 };
int wintimeb[3] = { 0 };
int judge(char a, char b)//判决函数
{
int judge;
if (a == 'C' && b == 'B') {
judge = -1;//b用B赢了
wintimeb[B]++;
}
else if (a == 'B' && b == 'J') {
judge = -1;//b用J赢了
wintimeb[J]++;
}
else if (a == 'J' && b == 'C') {
judge = -1;//b用C赢了
wintimeb[C]++;
}
else if (a == 'B' && b == 'C') {
judge = 1;//a用B赢了
wintimea[B]++;
}
else if (a == 'J' && b == 'B') {
judge = 1;//a用J赢了
wintimea[J]++;
}
else if (a == 'C' && b == 'J') {
judge = 1;//a用C赢了
wintimea[C]++;
}
else if (a == b) {
judge = 0;
}
return judge;
}
int main()
{
int n;
int result;
cin >> n;
char a, b;
int wina = 0, winb = 0, draw = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
result = judge(a, b);
if (result == 0)
draw++;
else if (result < 0)
winb++;
else
wina++;
}
cout << wina << " " << draw << " " << winb << endl;
cout << winb << " " << draw << " " << wina << endl;
char MaxA = ((wintimea[C]>wintimea[B]&&wintimea[C]>=wintimea[J])?'C':(wintimea[B]>=wintimea[J]?'B':'J'));
char MaxB = ((wintimeb[C]>wintimeb[B]&&wintimeb[C]>=wintimeb[J])?'C':(wintimeb[B]>=wintimeb[J]?'B':'J'));
cout << MaxA << " " << MaxB;
return 0;
}