1018 锤子剪刀布 (20 分)python

'''
Author: 365JHWZGo
Description: 1018 锤子剪刀布 (20 分)
Date: 2021-09-20 19:32:55
FilePath: \demo5.py
LastEditTime: 2021-09-20 21:56:56
LastEditors: 365JHWZGo
'''
num = int(input())
d1 = dict()
d2 = dict()
e = 0
for i in range(num):
    p1, p2 = input().split()
    if p1 == p2:
        e += 1
    elif ((p1 == 'J' and p2 == 'B') or (p1 == 'C' and p2 == 'J')
          or (p1 == 'B' and p2 == 'C')):
        d1[p1] = d1.get(p1, 0) + 1
    else:
        d2[p2] = d2.get(p2, 0) + 1
s1 = 0
s2 = 0
s1 = sum(d1.values())
s2 = sum(d2.values())
print(s1,e,num-s1-e)
print(s2,e,num-s2-e)
v1 = []
v2 = []
for i in d1.keys(): 
    if d1[i] == max(d1.values()):
        v1.append(i)
for i in d2.keys():
    if d2[i] == max(d2.values()):
        v2.append(i)
if v1:
    v1.sort()
    print(v1[0],end=' ')
else:
    print('B',end=' ')
if v2:
    v2.sort()
    print(v2[0],end='')
else:
    print('B',end='')
#此处需要注意的是：当游戏次数为0是，队手双方均是出B的优势最大！还需要修改结尾换行符

第5个测试点在：s1 = 0
s2 = 0
要先赋初值