1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
# author: a2htray
# create date: 2023/3/6
"""
PAT 乙级 1018
"""
if __name__ == '__main__':
n = int(input())
first = [0, 0, 0]
second = [0, 0, 0]
first_win = 0
second_win = 0
alphabet = ['B', 'C', 'J']
for _ in range(n):
p1, p2 = input().split()
if p1 == 'C' and p2 == 'J':
first[1] += 1
first_win += 1
elif p1 == 'C' and p2 == 'B':
second[0] += 1
second_win += 1
elif p1 == 'B' and p2 == 'J':
second[2] += 1
second_win += 1
elif p1 == 'B' and p2 == 'C':
first[0] += 1
first_win += 1
elif p1 == 'J' and p2 == 'B':
first[2] += 1
first_win += 1
elif p1 == 'J' and p2 == 'C':
second[1] += 1
second_win += 1
print(first_win, n - first_win - second_win, second_win)
print(second_win, n - first_win - second_win, first_win)
print(alphabet[first.index(max(first))], alphabet[second.index(max(second))])
|