大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第 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
代码:
创建两个字典,分别用于记录甲方和乙方的胜、平、负的次数
创建两个字典,分别用于记录甲方和乙方的获胜次数最多的手势
使用一个循环来读入每一次的交锋信息,并统计胜、平、负的次数
n=int(input())
player_a={'win':0,'draw':0,'lose':0}
player_b={'win':0,'draw':0,'lose':0}
player_a_gestures={'B':0,'C':0,'J':0}
player_b_gestures={'B':0,'C':0,'J':0}
for i in range(n):
a,b=input().split()
if a=='C':
if b=='C':
player_a['draw']+=1
player_b['draw']+=1
elif b=='J':
player_a['win']+=1
player_b['lose']+=1
player_a_gestures['C']+=1
else:
player_b['win']+=1
player_a['lose']+=1
player_b_gestures['B']+=1
elif a=='B':
if b=='B':
player_a['draw']+=1
player_b['draw']+=1
elif b=='C':
player_a['win']+=1
player_b['lose']+=1
player_a_gestures['B']+=1
else:
player_b['win']+=1
player_a['lose']+=1
player_b_gestures['J']+=1
else:
if b=='J':
player_a['draw']+=1
player_b['draw']+=1
elif b=='B':
player_a['win']+=1
player_b['lose']+=1
player_a_gestures['J']+=1
else:
player_b['win']+=1
player_a['lose']+=1
player_b_gestures['C']+=1
print(player_a['win'],player_a['draw'],player_a['lose'])
print(player_b['win'],player_b['draw'],player_b['lose'])
max_gesture_a=max(player_a_gestures,key=player_a_gestures.get)
max_gesture_b=max(player_b_gestures,key=player_b_gestures.get)
print(max_gesture_a,max_gesture_b)
代码不难写,枚举每种情况就好,毕竟也就9种情况