大家应该都会玩“锤子剪刀布”的游戏:两人同时给出手势,胜负规则如图所示:
FigCJB.jpg
现给出两人的交锋记录,请统计双方的胜、平、负次数,并且给出双方分别出什么手势的胜算最大。
输入格式:
输入第 1 行给出正整数 N(≤10^5),即双方交锋的次数。随后 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
python代码
def panduan(a,b):
#1代表a得分 ;-1 代表b得分; 0 代表平局
if a is 'C' and b is 'J':
return 1
elif a is 'C' and b is 'B':
return -1
elif a is 'J' and b is 'B':
return 1
elif a is 'J' and b is 'C':
return -1
elif a is 'B' and b is 'J':
return -1
elif a is 'B' and b is 'C':
return 1
else:
return 0
import sys
input_jushu=sys.stdin.readline()
duiju=[]
for i in range(int(input_jushu)):
duiju.extend(sys.stdin.readline())
# b,j,j
jia_win=0
jia_win_shoushi=[0,0,0]
jia_lose=0
yi_win=0
yi_win_shoushi=[0,0,0]
yi_lose=0
pingju=0
postion={'B':0,'C':1,'J':2}
for i in range(0,len(duiju),4):
result=panduan(duiju[i],duiju[i+2])
if result is 0:
pingju=pingju+1
elif result is 1:
jia_win=jia_win+1
yi_lose=yi_lose+1
jia_win_shoushi[postion[duiju[i]]]=jia_win_shoushi[postion[duiju[i]]]+1
elif result is -1:
yi_win = yi_win + 1
jia_lose=jia_lose+1
yi_win_shoushi[postion[duiju[i+2]]]=yi_win_shoushi[postion[duiju[i+2]]]+1
print(jia_win,pingju,jia_lose)
print(yi_win,pingju,yi_lose)
max_data=max(jia_win_shoushi)
jia_max=jia_win_shoushi.index(max_data)
if jia_max is not 0 and jia_win_shoushi[1] == jia_win_shoushi[2]:
jia_max=1
YI_max_data=max(yi_win_shoushi)
yi_max=yi_win_shoushi.index(YI_max_data)
if yi_max is not 0 and yi_win_shoushi[1] == yi_win_shoushi[2]:
yi_max=1
postion_={0:'B',1:'C',2:'J'}
print(postion_[jia_max],postion_[yi_max])