1018. 锤子剪刀布 (20)
时间限制
100 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第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 <stdio.h>
#include <stdlib.h>
int main()
{
int i,n,count_a=0,count_b=0,count_ping=0;
int count_aC=0,count_aB=0,count_aJ=0;
int count_bC=0,count_bB=0,count_bJ=0;
char a,b;
scanf("%d",&n);
getchar();
for(i=0;i<n;i++){
scanf("%c %c",&a,&b);
getchar();
if(a=='C'&&b=='J'){
count_a++; count_aC++;
}
if(a=='J'&&b=='C'){
count_b++; count_bC++;
}
if(a=='C'&&b=='B'){
count_b++; count_bB++;
}
if(a=='B'&&b=='C'){
count_a++; count_aB++;
}
if(a=='J'&&b=='B'){
count_a++; count_aJ++;
}
if(a=='B'&&b=='J'){
count_b++; count_bJ++;
}
if((a=='C'&&b=='C')||(a=='B'&&b=='B')||(a=='J'&&b=='J')){
count_ping++;
}
}
printf("%d %d %d\n",count_a,count_ping,count_b);
printf("%d %d %d\n",count_b,count_ping,count_a);
if(count_aB>=count_aC&&count_aB>=count_aJ)
printf("B ");
else if(count_aC>=count_aJ)
printf("C ");
else
printf("J ");
if(count_bB>=count_bC&&count_bB>=count_bJ)
printf("B");
else if(count_bC>=count_bJ)
printf("C");
else
printf("J");
return 0;
}