Problem:
 Score : 200 points    Problem Statement Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.  The problem has N test cases.  For each test case i ( 1\leq i \leq N ), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC , WA , TLE , and RE , respectively.  See the Output section for the output format.      Constraints  1 \leq N \leq 10^5  S_i is AC , WA , TLE , or RE .         Input Input is given from Standard Input in the following format:  N  S_1  \vdots  S_N       Output Let C_0 , C_1 , C_2 , and C_3 be the numbers of test cases for which the verdict is AC , WA , TLE , and RE , respectively. Print the following:  AC x C_0 WA x C_1 TLE x C_2 RE x C_3         Sample Input 1 6
AC
TLE
AC
AC
WA
TLE      Sample Output 1 AC x 3
WA x 1
TLE x 2
RE x 0  We have 3 , 1 , 2 , and 0 test case(s) for which the verdict is AC , WA , TLE , and RE , respectively.       Sample Input 2 10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC      Sample Output 2 AC x 10
WA x 0
TLE x 0
RE x 0

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    n = int(input())
    s = [input() for _ in range(n)]
    print('AC x {:}'.format(s.count('AC')))
    print('WA x {:}'.format(s.count('WA')))
    print('TLE x {:}'.format(s.count('TLE')))
    print('RE x {:}'.format(s.count('RE')))
    return 0

if __name__ == "__main__":
    main()

Solution (Python):
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]

count_s = Counter(s)

judge = ["AC", "WA", "TLE", "RE"]

for i in judge:
    c = count_s[i]
    print("{} x {}".format(i,c))

Solution (Python):
N = int(input()) 

S={}

for i in range(N):
    x = str(input())
    
    if x in S.keys():
        S[x] += 1
    else:
        S[x] = 1
        
if "AC" in S.keys():
    print("AC x " + str(S["AC"]))
else:
    print("AC x " +"0" )
    
if "WA" in S.keys():
    print("WA x " + str(S["WA"]))
else:
    print("WA x " +"0" )
    
if "TLE" in S.keys(): 
    print("TLE x " + str(S["TLE"]))
else:
    print("TLE x " +"0")
    
if "RE" in S.keys():
  print("RE x " + str(S["RE"]))
else:
  print("RE x " + "0" )

Solution (Python):
N = int(input())
S = [input() for i in range(N)]

print("AC x ", S.count("AC"))
print("WA x ", S.count("WA"))
print("TLE x ", S.count("TLE"))
print("RE x ", S.count("RE"))

Solution (Python):


N = int(input())
C = [0,0,0,0]
for _ in range(N):
    a = str(input())
    if(a == "AC"):
        C[0] += 1
    elif(a == "WA"):
        C[1] += 1
    elif(a == "TLE"):
        C[2] += 1
    elif(a == "RE"):
        C[3] += 1
print("AC x " + str(C[0]))
print("WA x " + str(C[1]))
print("TLE x " + str(C[2]))
print("RE x " + str(C[3]))

Solution (Python):
N = input()
li = [0,0,0,0]
for i in range(int(N)):
    a = input()
    if a == "AC":
        li[0] += 1
    if a == "WA":
        li[1] += 1
    if a == "TLE":
        li[2] += 1
    if a == "RE":
        li[3] += 1

print("AC x "+str(li[0]))
print("WA x "+str(li[1]))
print("TLE x "+str(li[2]))
print("RE x "+str(li[3]))

Solution (Python):
n = int(input())
d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

for i in range(n):
    a = input()
    d[a] += 1

print('AC x', d['AC'])
print('WA x', d['WA'])
print('TLE x', d['TLE'])
print('RE x', d['RE'])

Solution (Python):
n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
  c=input()
  if c=='AC':
    ac+=1
  elif c=='WA':
    wa+=1
  elif c=='TLE':
    tle+=1
  else:
    re+=1

print("AC x {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))

Solution (Python):
N = int(input())
a = []
cnt_AC, cnt_WA, cnt_TLE, cnt_RE = 0,0,0,0
for i in range(N):
  a.append(input())
for i in a:
  if i == 'AC':
    cnt_AC += 1
  elif i == 'WA':
    cnt_WA += 1
  elif i == 'TLE':
    cnt_TLE += 1
  else:
    cnt_RE += 1
print('AC x',cnt_AC)
print('WA x',cnt_WA)
print('TLE x',cnt_TLE)
print('RE x',cnt_RE)

Solution (Python):
N = int(input())
counts = [0]*4
for _ in range(N):
  s = input()
  if s == "AC":
    counts[0] += 1
  elif s == "WA":
    counts[1] += 1
  elif s == "TLE":
    counts[2] += 1
  else:
    counts[3] += 1
print("AC x {}".format(counts[0]))
print("WA x {}".format(counts[1]))
print("TLE x {}".format(counts[2]))
print("RE x {}".format(counts[3]))

Solution (Python):
n = int(input())
s = [input() for c in range(n)]

m = s.count('AC')

print(f"AC x {m}")

m = s.count('WA')

print(f"WA x {m}")

m = s.count('TLE')

print(f"TLE x {m}")

m = s.count('RE')

print(f"RE x {m}")

Solution (Python):
n = int(input())
a = []
for _ in range(n):
  a.append(input())
print("AC x " + str(a.count("AC")))
print("WA x " + str(a.count("WA")))
print("TLE x " + str(a.count("TLE")))
print("RE x " + str(a.count("RE")))

Solution (Python):
N = int(input())
d = dict({'AC':0, 'WA':0, 'TLE':0, 'RE':0})
for i in range(N):
    S = input()
    d[S] += 1
print('AC x {}'.format(d['AC']))
print('WA x {}'.format(d['WA']))
print('TLE x {}'.format(d['TLE']))
print('RE x {}'.format(d['RE']))

Solution (Python):
n = int(input())
s = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}

for i in range(n):
    t = input()
    s[t] += 1

for k, v in s.items():
    print(k, "x", v)

Solution (Python):
N = int(input())
data = []
for i in range(N):
    data.append(input())
co_AC = 0
co_WA = 0
co_TLE = 0
co_RE = 0
for i in range(N):
    if data[i] == "AC":
        co_AC += 1
    elif data[i] == "WA":
        co_WA += 1
    elif data[i] == "TLE":
        co_TLE += 1
    else:
        co_RE += 1


print("AC" + " x " + str(co_AC))
print("WA" + " x " + str(co_WA))
print("TLE" + " x " + str(co_TLE))
print("RE" + " x " + str(co_RE))

Solution (Python):
N = int(input())
A = []
for _ in range(N):
    A.append(input())
print("AC","x",A.count('AC'))
print("WA","x",A.count('WA'))
print("TLE","x",A.count('TLE'))
print("RE","x",A.count('RE'))

Solution (Python):
N = int(input())
S = []
for s in range(N):
  S.append(input())
print('AC', end=' ') 
print('x', end=' ')
print(S.count('AC'))

print('WA', end=' ') 
print('x', end=' ')
print(S.count('WA'))

print('TLE', end=' ') 
print('x', end=' ')
print(S.count('TLE'))

print('RE', end=' ') 
print('x', end=' ')
print(S.count('RE'))

Solution (Python):
N=int(input())
S = [input() for _ in range(N)]
print('AC x ' +str(S.count('AC')))
print('WA x ' +str(S.count('WA')))
print('TLE x ' +str(S.count('TLE')))
print('RE x ' +str(S.count('RE')))

Solution (Python):
""" B
    https://atcoder.jp/contests/abc173/tasks/abc173_b
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return reduce(lambda acc, _: acc + [readIntegerSet(m)], range(0, n), [])

def main(N, S):
    result = {
        "AC": 0,
        "WA": 0,
        "TLE": 0,
        "RE": 0
    }

    for s in S:
        result[s] += 1

    print("AC x {}".format(result["AC"]))
    print("WA x {}".format(result["WA"]))
    print("TLE x {}".format(result["TLE"]))
    print("RE x {}".format(result["RE"]))

if __name__ == "__main__":
    _N = readInteger()
    _S = [readString().strip() for _ in range(0, _N)]

    main(_N, _S)

Solution (Python):
N = int(input())

A = [input() for i in range (N)]

AC = A.count('AC')
WA = A.count('WA')
TLE = A.count('TLE')
RE= A.count('RE')

print('AC x ' + str(AC))
print('WA x ' + str(WA))
print('TLE x ' + str(TLE))
print('RE x ' + str(RE))

Solution (Python):
N = int(input())
L = [input() for _ in range(N)]

AC = 0
WA = 0
TLE = 0
RE = 0
for i in L:
    if i == "AC":
        AC += 1
    elif i == "WA":
        WA += 1
    elif i == "TLE":
        TLE += 1
    elif i == "RE":
        RE += 1

print("AC x " + str(AC))
print("WA x " + str(WA))
print("TLE x " + str(TLE))
print("RE x " + str(RE))

Solution (Python):
N = int(input())

S = [input() for i in range(N)]

ac = 0
wa = 0
tle = 0
re = 0

for s in S:
    if s[0] == 'A':
        ac += 1
    elif s[0] == 'W':
        wa += 1
    elif s[0] == 'T':
        tle += 1
    else:
        re += 1

print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Solution (Python):
from collections import defaultdict

def main():
    n = int(input())
    ans = defaultdict(lambda: 0)
    for _ in range(n):
        s = input()
        ans[s] += 1
    print(f"AC x {ans['AC']}")
    print(f"WA x {ans['WA']}")
    print(f"TLE x {ans['TLE']}")
    print(f"RE x {ans['RE']}")
        
        

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
s = []

for _ in range(n):
    s.append(input())

print("AC","x",s.count('AC'))
print("WA","x",s.count('WA'))
print("TLE","x",s.count('TLE'))
print("RE","x",s.count('RE'))

Solution (Python):


n = int(input())

ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
    data = str(input())
    if (data == 'AC'):
        ac += 1
    elif (data == 'WA'):
        wa += 1
    elif (data == 'TLE'):
        tle += 1
    elif (data == 'RE'):
        re += 1    

print("AC x " + str(ac) + "\n" + "WA x " + str(wa) + "\n" + "TLE x " + str(tle) + "\n" + "RE x " + str(re) + "\n")

Solution (Python):

from collections import Counter

N = int(input().strip())
S_list = [input().strip() for _ in range(N)]


cnt = Counter(S_list)

for s in ["AC", "WA" ,"TLE" ,"RE"]:
    if s in cnt:
        print( s, "x", cnt[s] )
    else:
        print( s, "x", 0 )

Solution (Python):
ac = 0
wa = 0
tle = 0
re = 0

n = int(input())

s = ["a"]*n
for i in range(n):
    s[i] = input()

for j in range(n):
    if s[j]=="AC":
        ac += 1
    elif s[j]=="WA":
        wa += 1
    elif s[j]=="TLE":
        tle += 1
    elif s[j]=="RE":
        re += 1

print("AC x {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))

Solution (Python):
import collections
n = int(input())
s = []
for i in range(n):
    s.append(input())

c = collections.Counter(s)

print('AC x', c['AC'])
print('WA x', c['WA'])
print('TLE x', c['TLE'])
print('RE x', c['RE'])

Solution (Python):
n = int(input())
a = []
for i in range(n):
  a.append(input())
ac = a.count('AC')
wa = a.count('WA')
tle = a.count('TLE')
re = a.count('RE')
print('AC', 'x', ac)
print('WA', 'x', wa)
print('TLE', 'x', tle)
print('RE', 'x', re)

Solution (Python):
N=int(input())
AC=int(0)
WA=int(0)
TLE=int(0)
RE=int(0)
for i in range(N):
    inp=input()
    if inp=="AC":
        AC+=1
    if inp=="WA":
        WA+=1
    if inp=="TLE":
        TLE+=1
    if inp=="RE":
        RE+=1

print("AC x",AC)
print("WA x",WA)
print("TLE x",TLE)
print("RE x",RE)

Solution (Python):
n = int(input())
ac = "AC"
wa = "WA"
tle = "TLE"
re = "RE"

ans = [0, 0, 0, 0]
for _ in range(n):
    a = input()
    if (a == ac):
        ans[0] += 1
    if (a == wa):
        ans[1] += 1
    if (a == tle):
        ans[2] += 1
    if (a == re):
        ans[3] += 1

print("AC x ",ans[0])
print("WA x ",ans[1])
print("TLE x ",ans[2])
print("RE x ",ans[3])

Solution (Python):
N = int(input())
AC, WA, TLE, RE = 0,0,0,0

for _ in range(N):
    S = input()
    
    if S == 'AC':
        AC += 1
    elif S == 'WA':
        WA += 1
    elif S == 'TLE':
        TLE += 1
    elif S == 'RE':
        RE +=1 
    else:
        continue

print('AC x ' + str(AC))
print('WA x ' + str(WA))
print('TLE x ' + str(TLE))
print('RE x ' + str(RE))

Solution (Python):
n = int(input())
import collections

hashmap = {
    'AC' : 0,
    'WA' : 0,
    'TLE': 0,
    'RE' : 0
}

while n > 0:
    t = input()
    hashmap[t] = hashmap.get(t, 0) + 1
    n -= 1

for key, val in hashmap.items():
    print(key + " x " + str(val))

Solution (Python):
from collections import Counter
N = int(input())
A = [input() for i in range(N)]
ans_dict = {
    'AC' :0,
    'WA' :0,
    'TLE' :0,
    'RE' :0
}
ct = dict(Counter(A))
for i in ct:
    ans_dict[i] = ct[i]
for k,v in ans_dict.items():
    print(f'{k}  x {v}')

Solution (Python):
from collections import Counter

n = int(input())
s = [input() for i in range(n)]

d = Counter(s)

for x in ["AC", "WA", "TLE", "RE"]:
  print(x + " x " + str(d[x]))

Solution (Python):
N=int(input())
result_list = ['AC', 'WA', 'TLE', 'RE']
count_list = [0, 0, 0, 0]
for i in range(N):
  S = input()
  count_list[result_list.index(S)] = count_list[result_list.index(S)] + 1

for i in range(4):
  print(result_list[i]+' x '+str(count_list[i]))

Solution (Python):
N=int(input()) 

li_AC = list()
li_TLE = list()
li_WA = list()
li_RE = list()


for i in range(N):
    s=input()
    if 'AC' == s:
        li_AC.append(s)
    if 'RE' == s:
        li_RE.append(s)
    if 'TLE' == s:
        li_TLE.append(s)
    if 'WA' == s:
        li_WA.append(s)

print(f'AC x {len(li_AC)}')

print(f'WA x {len(li_WA)}')
print(f'TLE x {len(li_TLE)}')
print(f'RE x {len(li_RE)}')

Solution (Python):
import collections,sys
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()
N = I()
S = [S() for _ in range(N)]
counter_S = collections.defaultdict(int)
for s in S:
    counter_S[s] += 1
for ans in ['AC','WA','TLE','RE']:
    print('{0} x {1}'.format(ans,counter_S[ans]))
print()

Solution (Python):


N = int(input())
table = [0, 0, 0, 0]
for i in range(N):
  a = input()
  if a == "AC":
    table[0] += 1
  elif a == "WA":
    table[1] += 1
  elif a == "TLE":
    table[2] += 1
  else:
    table[3] += 1

print("AC x {}".format(table[0]))
print("WA x {}".format(table[1]))
print("TLE x {}".format(table[2]))
print("RE x {}".format(table[3]))

Solution (Python):
N = int(input())
list = [input() for i in range(N)]

print("AC x", list.count("AC"))
print("WA x", list.count("WA"))
print("TLE x", list.count("TLE"))
print("RE x", list.count("RE"))

Solution (Python):
n=int(input())
a= [input() for i in range(n)]
c=[0]*4
for i in a:
    if i=='AC':
        c[0]+=1
    elif i=='WA':
        c[1]+=1
    elif i=='TLE':
        c[2]+=1
    else:
        c[3]+=1

print('AC'+' ' + 'x'+' '+ str(c[0]))
print('WA'+' '+ 'x'+' '+ str(c[1]))
print('TLE' +' ' +'x'+' '+str(c[2]))
print('RE'+' ' +'x' +' '+str(c[3]))

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    d = {"AC": 0, "WA":0, "TLE": 0, "RE": 0}
    for i in range(n):
        n = input()
        d[n] += 1
    for key, value in d.items():
        print(f'{key} x {value}')

Solution (Python):
n = int(input())
a = 0
w = 0
t = 0
r = 0

for i in range(n):
    x = str(input())
    if x == "AC":
        a = a + 1
    elif x == "WA":
        w = w + 1
    elif x == "TLE":
        t = t + 1
    elif x == "RE":
        r = r + 1

print("AC x " +str(a))
print("WA x " +str(w))
print("TLE x " +str(t))
print("RE x " +str(r))

Solution (Python):
N = int(input())
S = {"AC" : 0,"WA" : 0,"TLE" : 0,"RE" : 0}
     
for i in range(N):
  x = input()
  S[x] += 1
  
for i in S.keys():
  ans = " ".join([i,"x",str(S[i])])
  print(ans)

Solution (Python):
n = int(input())

ls = []
for i in range(n):
    ls.append(str(input()))


ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    if ls[i] == "AC":
        ac += 1
    elif ls[i] == "WA":
        wa += 1
    elif ls[i] == "TLE":
        tle += 1
    else:
        re += 1

print("AC x " + str(ac) + "\nWA x " + str(wa) + "\nTLE x " + str(tle) + "\nRE x " + str(re))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]

AC = 0
WA = 0
TLE = 0
RE = 0

for x in S:
    if x == "AC":
        AC += 1
    elif x == "WA":
        WA += 1
    elif x == "TLE":
        TLE += 1
    elif x == "RE":
        RE += 1

print(f"AC x {AC}")
print(f"WA x {WA}")
print(f"TLE x {TLE}")
print(f"RE x {RE}")

Solution (Python):
N = int(input())
S = [input()for i in range(N)]
ans = [0,0,0,0,]
ans[0] = S.count("AC")
ans[1] = S.count("WA")
ans[2] = S.count("TLE")
ans[3] = S.count("RE")

print(f"AC x {ans[0]}")
print(f"WA x {ans[1]}")
print(f"TLE x {ans[2]}")
print(f"RE x {ans[3]}")

Solution (Python):
n = int(input())
s = []
for i in range(n):
    s.append(input())

print("AC x", s.count("AC"))
print("WA x", s.count("WA"))
print("TLE x", s.count("TLE"))
print("RE x", s.count("RE"))

Solution (Python):
N = int(input())
l = [0]*N
count_1 = 0
count_2 = 0
count_3 = 0
count_4 = 0
for i in range(N):
  l[i] = input()
  if l[i] == 'AC':
    count_1 += 1
  if l[i] == 'WA':
    count_2 += 1
  if l[i] == 'TLE':
    count_3 += 1
  if l[i] == 'RE':
    count_4 += 1
print('AC','x',count_1)
print('WA','x',count_2)
print('TLE','x',count_3)
print('RE','x',count_4)

Solution (Python):
n = int(input())
s = [""]*n

ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
    s[i] = str(input())
    if s[i] == "AC":
        ac += 1
    elif s[i] == "WA":
        wa += 1
    elif s[i] == "TLE":
        tle += 1
    else:
        re += 1

print("AC x " + str(ac))

print("WA x " + str(wa))

print("TLE x " + str(tle))

print("RE x " + str(re))

Solution (Python):
N = int(input())
results = ['AC', 'WA', 'TLE', "RE"]
d = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}

for _ in range(N):
	r = input()
	d[r] += 1

for i in range(4):
	print(results[i] + ' x ' + str(d[results[i]]))

Solution (Python):
N = int(input())

S = []
for n in range(N):
    s = input()
    S.append(s)

print("AC x "+str(S.count("AC")))
print("WA x "+str(S.count("WA")))
print("TLE x "+str(S.count("TLE")))
print("RE x "+str(S.count("RE")))

Solution (Python):
N=int(input())
S=[input() for i in range(N)]
S="".join(S)

print('AC x',S.count('AC'))
print('WA x',S.count('WA'))
print('TLE x',S.count('TLE'))
print('RE x',S.count('RE'))

Solution (Python):
n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
    m=input()
    if m=='AC': ac+=1
    elif m=='WA': wa+=1
    elif m=='TLE': tle+=1
    elif m=='RE': re+=1
print('AC x '+str(ac))
print('WA x '+str(wa))
print('TLE x '+str(tle))
print('RE x '+str(re))

Solution (Python):
from sys import stdin
N = int(stdin.readline().rstrip())
ac, wa, tle, re = 0, 0, 0, 0

for i in range(0, N):
    a = stdin.readline().rstrip()
    if a == 'AC':
        ac += 1
    elif a == 'WA':
        wa += 1
    elif a == 'TLE':
        tle += 1
    elif a == 'RE':
        re += 1

print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(ac, wa, tle, re))

Solution (Python):
verdicts = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
N = int(input())
for i in range(N):
    v = input()
    verdicts[v] += 1

for v, f in verdicts.items():
    print(f'{v} x {f}')

Solution (Python):
N = int(input())

c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(1, N+1) :
    s = input()
    if s == 'AC' :
        c0 = c0 + 1
    elif s == 'WA' :
        c1 = c1 + 1
    elif s == 'TLE' :
        c2 = c2 + 1
    elif s == 'RE' :
        c3 = c3 + 1

print("AC x " + str(c0))
print("WA x " + str(c1))
print("TLE x " + str(c2))
print("RE x " + str(c3))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]

ac = str(S.count("AC"))
wa = str(S.count("WA"))
tle = str(S.count("TLE"))
re = str(S.count("RE"))

print("AC x " + ac)
print("WA x " + wa)
print("TLE x " + tle)
print("RE x " + re)

Solution (Python):

n=int(input())

s=[input() for _ in range(n)]
AC_a=0
WA_a=0
TLE_a=0
RE_a=0

for i in range(n):
    if s[i]=='AC':
        AC_a+=1
    elif s[i]=='WA':
        WA_a+=1
    elif s[i]=='TLE':
        TLE_a+=1
    elif s[i]=='RE':
        RE_a+=1
print('AC','x',AC_a)
print('WA','x',WA_a)
print('TLE','x',TLE_a)
print('RE','x',RE_a)

Solution (Python):
n = int(input())

j = list()
for _ in range(n):
    string = input()
    j.append(string)

ac = j.count("AC")
wa = j.count("WA")
tle = j.count("TLE")
re = j.count("RE")
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Solution (Python):
N = int(input())

ans = [0] * 4

for i in range(N):
    s = input()
    if 'AC' == s:
        ans[0] += 1
    elif 'WA' == s:
        ans[1] += 1
    elif 'TLE' == s:
        ans[2] += 1
    elif 'RE' == s:
        ans[3] += 1

print('AC x', ans[0])
print('WA x', ans[1])
print('TLE x', ans[2])
print('RE x', ans[3])

Solution (Python):
N=int(input())
result=[]

import collections

for _ in range(N):
    s=input()
    result.append(s)

R=collections.Counter(result)

print('AC x',R['AC'])
print('WA x',R['WA'])
print('TLE x',R['TLE'])
print('RE x',R['RE'])

Solution (Python):
N = int(input())
ans = [0,0,0,0]

for _ in range(N):
    a = input()
    if a == "AC":
        ans[0] += 1
    elif a == "WA":
        ans[1] += 1
    elif a == "TLE":
        ans[2] += 1
    else:
        ans[3] += 1

print("AC x "+ str(ans[0]))
print("WA x "+ str(ans[1]))
print("TLE x "+ str(ans[2]))
print("RE x "+ str(ans[3]))

Solution (Python):
lists = [input() for i in range(int(input()))]
dct = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for lst in lists:
    if lst in dct:
        dct[lst] += 1

for k, v in dct.items():
    print(k,'x',v)

Solution (Python):
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(int(input())):
	d[input()]+=1
print('AC x',d['AC'])
print('WA x',d['WA'])
print('TLE x',d['TLE'])
print('RE x',d['RE'])

Solution (Python):
N = int(input())
arr = []

for _ in range(N):
    arr.append(input())

print(f'AC x {arr.count("AC")}')
print(f'WA x {arr.count("WA")}')
print(f'TLE x {arr.count("TLE")}')
print(f'RE x {arr.count("RE")}')

Solution (Python):
import collections
N = int(input())
results = []
for i in range(N):
    results.append(input())

c = collections.Counter(results)
for s in ['AC', 'WA', 'TLE', 'RE']:
    print('{} x {}'.format(s, c[s]))

Solution (Python):
n=int(input())


i=0
s=[]
while(i<n):
    s.append(input())
    i+=1

print("AC x "+str(s.count('AC')))
print("WA x "+str(s.count('WA')))
print("TLE x "+str(s.count('TLE')))
print("RE x "+str(s.count('RE')))

Solution (Python):


n = int(input())

S=[input() for i in range(n)]
ac=0
tle=0
wa=0
re=0
for i in range(n):
    if(S[i] == 'AC'):
        ac = ac+1
    if(S[i]=='TLE'):
        tle=tle+1
    if(S[i]=='WA'):
        wa=wa+1
    if(S[i]=='RE'):
        re=re+1



print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Solution (Python):
n = int(input())
ac_cnt, wa_cnt, tle_cnt, re_cnt = 0, 0, 0, 0
for _ in range(n):
    s = input()
    if s == 'AC':
        ac_cnt += 1
    elif s == 'WA':
        wa_cnt += 1
    elif s == 'TLE':
        tle_cnt += 1
    elif s == 'RE':
        re_cnt += 1

print(f'AC x {ac_cnt}') 
print(f'WA x {wa_cnt}') 
print(f'TLE x {tle_cnt}') 
print(f'RE x {re_cnt}')

Solution (Python):
n=int(input())
result={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(n):
  result[input()] += 1
for i,j in result.items():
  print(f'{i} x {j}')

Solution (Python):
n = int(input())
s = {'AC': 0, 'WA':0, 'TLE':0, 'RE':0}
for i in range(n):
    s[str(input())] += 1

for i in s:
    print(i+' x '+str(s[i]))

Solution (Python):
N = int(input())
ans = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(N):
    S = input()
    ans[S] += 1

for k, v in ans.items():
    print(k,'x',v)

Solution (Python):
N = int(input())
dict =  {"AC":0,"WA":0,"TLE":0,"RE":0}
count = 0
for i in range(N):
    judge = input()
    if dict.get(judge) is not None:
        dict[judge] += 1
for key in dict.keys():
    print("{} x {}".format(key,dict[key]))

Solution (Python):
a = int(input())
b = [input() for i in range(a)]
AC = 0
WA = 0
TLE = 0
RE = 0

for bun in b:
    if bun == 'AC':
        AC += 1
    elif bun == 'WA':
        WA += 1
    elif bun =='TLE':
        TLE += 1
    elif bun == 'RE':
        RE += 1

print('AC x ' + str(AC))
print('WA x ' + str(WA))
print('TLE x ' + str(TLE))
print('RE x ' + str(RE))

Solution (Python):
n = int(input())
ls = [input() for _ in range(n)]
print("AC x",ls.count("AC"))
print("WA x",ls.count("WA"))
print("TLE x",ls.count("TLE"))
print("RE x",ls.count("RE"))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]

res = {'AC': s.count('AC'),
       'WA': s.count('WA'),
       'TLE': s.count('TLE'),
       'RE': s.count('RE')
       }

for k in res:
    print(f'{k} x {res[k]}')

Solution (Python):
n = int(input())
l = [0] * 4

for i in range(n):
    ans = input()
    if ans == 'AC':
        l[0] += 1
    elif ans == 'WA':
        l[1] += 1
    elif ans == 'TLE':
        l[2] += 1
    elif ans == 'RE':
        l[3] += 1

print('AC x '+ str(l[0]))
print('WA x '+ str(l[1]))
print('TLE x '+ str(l[2]))
print('RE x '+ str(l[3]))

Solution (Python):
n=int(input())

l=[input() for i in range(n)]

x=l.count("AC")
y=l.count("WA")
z=l.count("TLE")
zz=l.count("RE")

print("AC x "+str(x))
print("WA x "+str(y))
print("TLE x "+str(z))
print("RE x "+str(zz))

Solution (Python):
n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
    x=input()
    if (x=="RE"):
        re+=1
    if (x=="WA"):
        wa+=1
    if (x=="TLE"):
        tle+=1
    if (x=="AC"):
        ac+=1
print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Solution (Python):
n = int(input())
ac,wa,tle,re = 0,0,0,0
for i in range(n):
	str = input()
	if  str == "AC":
		ac += 1
	if  str == "WA":
		wa += 1
	if str == "TLE":
		tle += 1
	if str == "RE":
		re += 1
print("AC x", ac)
print("WA x", wa)
print("TLE x",tle)
print("RE x",re)

Solution (Python):
n = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(0, n):
    case = str(input())
    if case == "AC":
        AC = AC+1
    elif case == "WA":
        WA = WA+1
    elif case == "TLE":
        TLE = TLE+1
    elif case == "RE": 
        RE = RE+1

print("AC x {0}".format(AC))
print("WA x {0}".format(WA))
print("TLE x {0}".format(TLE))
print("RE x {0}".format(RE))

Solution (Python):
n = int(input())

ac = 0
wa = 0
tle = 0
re = 0
for i in range(n) :
    s = input()
    if s == 'AC' :
        ac += 1
    elif s == 'WA' :
        wa += 1
    elif s == 'TLE' :
        tle += 1
    else :
        re += 1
print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)

Solution (Python):
N = int(input())
c0,c1,c2,c3 = 0,0,0,0

for i in range(N):
    a = input()
    if a == "AC":
        c0 += 1
    elif a =="WA":
        c1 +=1
    elif a == "TLE":
        c2 += 1
    elif a == "RE":
        c3 += 1

print("AC x %d" %c0)
print("WA x %d" %c1)
print("TLE x %d" %c2)
print("RE x %d" %c3)

Solution (Python):
n = int(input())
ans =[input() for i in range(n)]

print("AC x "+str(ans.count("AC")))
print("WA x "+str(ans.count("WA")))
print("TLE x "+str(ans.count("TLE")))
print("RE x "+str(ans.count("RE")))

Solution (Python):
N = int(input())
judge = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(N):
  judge[input()] += 1
print('AC x ' + str(judge['AC']))
print('WA x ' + str(judge['WA']))
print('TLE x ' + str(judge['TLE']))
print('RE x ' + str(judge['RE']))

Solution (Python):
def main():
    n = int(input())

    s = [0 for i in range(n)]
    for i in range(n):
        s[i] = input()

    a = 0
    w = 0
    t = 0
    r = 0
    
    for i in range(n):
        if (s[i] == 'AC'):
            a += 1
        elif (s[i] == 'WA'):
            w += 1
        elif (s[i] == 'TLE'):
            t += 1
        else:
            r += 1

    print('AC x ' + str(a))
    print('WA x ' + str(w))
    print('TLE x ' + str(t))
    print('RE x ' + str(r))
    
main()

Solution (Python):
from sys import stdin
n = int(stdin.readline().rstrip())

data = [stdin.readline().rstrip() for _ in range(n)]

ac, wa, tle, re = 0,0,0,0

for i in data:
    if i =='AC':
        ac += 1
    elif i == 'WA':
        wa += 1
    elif i == 'TLE':
        tle += 1
    else:
        re += 1

print("AC x "+ str(ac))
print("WA x "+ str(wa))
print("TLE x "+ str(tle))
print("RE x "+ str(re))

Solution (Python):
import collections
n = int(input())
s = [input() for _ in range(n)]
s_ = collections.Counter(s)
print("AC x",int(s_['AC']))
print("WA x",int(s_["WA"]))
print("TLE x",int(s_["TLE"]))
print("RE x",int(s_["RE"]))

Solution (Python):
inp = int(input())

ac = 0
wa = 0
tle = 0
re = 0
for i in range(inp):
    inputSt = input()
    if inputSt == "AC":
        ac += 1
    elif inputSt == "WA":
        wa += 1
    elif inputSt == "TLE":
        tle += 1
    else:
        re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Solution (Python):
score = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
N = int(input())
for _ in range(N):
    result = input()
    if result == 'AC':
        score[result] += 1
    elif result == 'WA':
        score[result] += 1
    elif result == 'TLE':
        score[result] += 1
    elif result == 'RE':
        score[result] += 1
for i in score.keys():
    print(i, 'x', score[i])

Solution (Python):
N=int(input())
lis=[0,0,0,0]
for i in range(N):
  tmp=input()
  if tmp=="AC":
    lis[0]+=1
  elif tmp=="WA":
    lis[1]+=1
  elif tmp=="TLE":
    lis[2]+=1
  else:
    lis[3]+=1
print("AC x "+str(lis[0]))
print("WA x "+str(lis[1]))
print("TLE x "+str(lis[2]))
print("RE x "+str(lis[3]))

Solution (Python):
n=int(input())
a1=0
a2=0
a3=0 
a4=0
i=1 
while(i<=n):
    s=input()
    if(s=='AC'):
        a1+=1 
    elif(s=='WA'):
        a2+=1 
    elif(s=="TLE"):
        a3+=1 
    else:
        a4+=1 
    i+=1 
print("AC x",a1)
print("WA x",a2)
print("TLE x",a3)
print("RE x",a4)

Solution (Python):
ac = wa = tle = re = 0
for _ in range(int(input())):
	s = str(input())
	if s=='AC':
		ac+=1
	elif s=='WA':
		wa+=1
	elif s=='TLE':
		tle+=1
	else:
		re+=1
print('AC', 'x' , ac)
print('WA', 'x' , wa)
print('TLE', 'x' , tle)
print('RE', 'x' , re)

Solution (Python):
n = int(input())
ac=0
wa=0
tle=0
re=0

for i in range(n):
  s = input()
  if(s=="AC"):
    ac+=1
  elif(s=="WA"):
    wa+=1
  elif(s=="TLE"):
    tle+=1
  else:
    re+=1
    
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Solution (Python):
N = int(input())
S_list = []
for _ in range(N):
  S = str(input())
  S_list.append(S)

AC_list = [S == 'AC' for S in S_list]
WA_list = [S == 'WA' for S in S_list]
TLE_list = [S == 'TLE' for S in S_list]
RE_list = [S == 'RE' for S in S_list]
print('AC x {}'.format(sum(AC_list)))
print('WA x {}'.format(sum(WA_list)))
print('TLE x {}'.format(sum(TLE_list)))
print('RE x {}'.format(sum(RE_list)))

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
 
print("AC x " +  str(s.count('AC')))
print("WA x " +  str(s.count('WA')))
print("TLE x " +  str(s.count('TLE')))
print("RE x " +  str(s.count('RE')))

Solution (Python):
from collections import Counter

N = int(input())
sl = []
for i in range(N):
    sl.append(input())
C_sl = Counter(sl)


print(f'AC x {C_sl["AC"]}')
print(f'WA x {C_sl["WA"]}')
print(f'TLE x {C_sl["TLE"]}')
print(f'RE x {C_sl["RE"]}')

Solution (Python):
def main():
    N = int(input())
    C = [0,0,0,0]
    for _ in range(N):
        S = input()
        if S == 'AC':
            C[0] += 1
        elif S == 'WA':
            C[1] += 1
        elif S == 'TLE':
            C[2] += 1
        else:
            C[3] += 1
    print('AC x ' + str(C[0]))
    print('WA x ' + str(C[1]))
    print('TLE x ' + str(C[2]))
    print('RE x ' + str(C[3]))

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
ac = 0
tle = 0
wa = 0
re = 0
for i in range(n) :
    s = input()
    if s == 'AC' :
        ac += 1
    elif s == 'WA' :
        wa += 1
    elif s == 'TLE' :
        tle += 1
    else :
        re += 1
print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Solution (Python):
N=int(input())
S=[]
for i in range(N):
  S.append(input())
print('AC x',S.count('AC'))
print('WA x',S.count('WA'))
print('TLE x',S.count('TLE'))
print('RE x',S.count('RE'))