题目
大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第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>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
struct Play{
char jia;
char yi;
};
int game(char jia, char yi){//甲赢1,乙赢-1
if(jia == yi) return 0;
if(jia == 'C' && yi == 'J') return 1;
if(jia == 'C' && yi == 'B') return -1;
if(jia == 'J' && yi == 'C') return -1;
if(jia == 'J' && yi == 'B') return 1;
if(jia == 'B' && yi == 'J') return -1;
if(jia == 'B' && yi == 'C') return 1;
}
char Most(int c,int j,int b){
int most = j;
char r = 'J';
if(c>=most){
most = c;
r = 'C';
}
if(b>=most){
most = b;
r = 'B';
}
return r;
}
int main()
{
int N;
cin>>N;
Play player[N];
int j_s,j_p,j_f,y_s,y_p,y_f;
j_s=j_p=j_f=y_s=y_p=y_f=0;
int j_C,j_J,j_B,y_C,y_J,y_B;
j_C=j_J=j_B=y_C=y_J=y_B=0;
for(int i=0; i<N; i++){
cin>>player[i].jia>>player[i].yi;
int r = game(player[i].jia,player[i].yi);
if(r == 1){
j_s++;
y_f++;
if(player[i].jia == 'C') j_C++;
if(player[i].jia == 'J') j_J++;
if(player[i].jia == 'B') j_B++;
}else if(r == 0){
j_p++;
y_p++;
}else if(r == -1){
y_s++;
j_f++;
if(player[i].yi == 'C') y_C++;
if(player[i].yi == 'J') y_J++;
if(player[i].yi == 'B') y_B++;
}
}
cout<<j_s<<" "<<j_p<<" "<<j_f<<"\n";
cout<<y_s<<" "<<y_p<<" "<<y_f<<"\n";
cout<<Most(j_C,j_J,j_B)<<" "<<Most(y_C,y_J,y_B);
return 0;
}