1018 锤子剪刀布 (20 分)
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
FigCJB.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 <cstdio>
#include <cstring>
#include <cmath>
int main()
{
int N = 0;
scanf("%d", &N);
int draw = 0;//平局次数
int win1 = 0, defeat1 = 0;//甲通过出?获胜和失败的次数
int win2 = 0, defeat2 = 0;//甲通过出✂获胜和失败的次数
int win3 = 0, defeat3 = 0;//甲通过出✋获胜和失败的次数
getchar();
for (int i = 0; i < N; i++)
{
char AA, BB;//表示甲乙出的手势
//scanf_s("%c %c", &AA, &BB);
AA = getchar();
getchar();
BB = getchar();
getchar();
if (AA == 'C')//甲出?
{
if (BB == 'C') draw++;//乙也出?则平局
if (BB == 'J') win1++;//乙出✂则甲胜利
if (BB == 'B') defeat1++;//乙出✋则甲失败
}
if (AA == 'J')//甲出✂
{
if (BB == 'C') defeat2++;//乙也出?则失败
if (BB == 'J') draw++;//乙出✂则甲平局
if (BB == 'B') win2++;//乙出✋则甲胜利
}
if (AA == 'B')//甲出✋
{
if (BB == 'C') win3++;//乙也出?则胜利
if (BB == 'J') defeat3++;//乙出✂则甲失败
if (BB == 'B') draw++;//乙出✋则甲平局
}
}
int win = win1 + win2 + win3;//甲获胜总次数(或者说乙失败总次数)
int defeat = defeat1 + defeat2 + defeat3;//甲失败总次数(或者说乙胜利总次数)
printf("%d %d %d\n", win, draw, defeat);
printf("%d %d %d\n", defeat, draw, win);
if (win3 >= win1 && win3 > win2 || win3 > win1 && win3 >= win2) printf("B");//甲通过出✋获胜次数最多
else if (win1 >= win2 && win1 > win3 || win1 > win2 && win1 >= win3) printf("C");//甲通过出?获胜次数最多
else if (win2 >= win1 && win2 > win3 || win2 > win1 && win2 >= win3) printf("J");//甲通过出✂获胜次数最多
else printf("B");//否则出✋;如果解不唯一,则输出按字母序最小的解。
if (defeat1 >= defeat2 && defeat1 > defeat3 || defeat1 > defeat2 && defeat1 >= defeat3) printf(" B\n");
else if (defeat2 >= defeat1 && defeat2 > defeat3 || defeat2 > defeat1 && defeat2 >= defeat3) printf(" C\n");
else if (defeat3 >= defeat1 && defeat3 > defeat2 || defeat3 > defeat1 && defeat3 >= defeat2) printf(" J\n");
else printf(" B\n");
return 0;
}