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):
N = int(input())

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

n = [0,0,0,0]
for i in range(N):
    if S[i]=='AC':
        n[0] += 1
    elif S[i]=='WA':
        n[1] += 1
    elif S[i]=='TLE':
        n[2] += 1
    elif S[i]=='RE':
        n[3] += 1

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

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

for _ in range(n):
  v = input()
  cnt[v] += 1
  
for k in cnt.keys():
  print(f"{k} x {cnt[k]}")

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

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



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

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

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

for item in judge:
  print(item + " x " + str(data.count(item)))

Solution (Python):
n = int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
  x = input()
  if x == 'AC':
    ac+=1
  elif x == 'WA':
    wa += 1
  elif x == '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())
Sn = [input()for i in range(1,n+1)]

C0 = Sn.count('AC')
C1 = Sn.count('WA')
C2 = Sn.count('TLE')
C3 = Sn.count('RE')

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=list(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())
s = list(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):
import collections

n = int(input())
SS = []

i = 0
j = 0
r = 0
s = 0

for k in range(n):
    k = input()
    if k == "AC":
        i += 1
    elif k == "WA":
        j += 1
    elif k == "TLE":
        r += 1
    elif k == "RE":
        s += 1

print('AC x ' + str(i))
print('WA x ' + str(j))
print('TLE x ' + str(r))
print('RE x ' + str(s))

Solution (Python):
n = int(input())
a = []
for i in range(n):
        t = input()
        a.append(t)
        
b = ['AC', 'WA', 'TLE', 'RE']

for i in range(len(b)):
        print(b[i],'x',a.count(b[i]))

Solution (Python):
n = int(input())
s = [0] * 4
c = ["AC", "WA", "TLE", "RE"] 
for i in range(n):
    a = input()
    for j in range(4):
        if a == c[j]:
            s[j] += 1

for i in range(4):
    print(c[i]+" x "+str(s[i]))

Solution (Python):
'''Template Starts'''

def _int():
    return int(input())
    
def _ints():
    return map(int, input().split())
    
def _str():
    return input()
    
def _list():
    return list(_ints())
    
'''Template Ends'''

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

for _ in range(_int()):
    count[_str()] += 1
print(f'''AC x {count['AC']}\nWA x {count['WA']}\nTLE x {count['TLE']}\nRE x {count['RE']}''')

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

Solution (Python):
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    N = int(input())
    judge = [input() for _ in range(N)]

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


if __name__ == "__main__":
    main()

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

ac = wa = tle = re = 0
for i 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
print('AC x', ac)
print('WA x', wa)
print('TLE x', tle)
print('RE x', re)

Solution (Python):
N = int(input())
results = []
for i in range(1,N+1):
  con = input()
  results.append(con)
A = results.count("AC")
W = results.count("WA")
T = results.count("TLE")
R = results.count("RE")
print("AC x {}".format(A))
print("WA x {}".format(W))
print("TLE x {}".format(T))
print("RE x {}".format(R))

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

Solution (Python):
arr=[0]*4
for _ in range(int(input())):
    s=input()
    if s=='AC':
        arr[0]+=1
    elif s=='WA':
        arr[1]+=1
    elif s=='TLE':
        arr[2]+=1
    else:
        arr[3]+=1
print("AC x",arr[0])
print("WA x",arr[1])
print("TLE x",arr[2])
print("RE x",arr[3])

Solution (Python):
n = int(input())
s_list = dict(AC=0,WA=0,TLE=0,RE=0)

for _ in range(n):
    s = input()
    s_list[s] += 1

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

Solution (Python):
from sys import stdin


n, *s = (x.rstrip() for x in stdin.readlines())

ac = s.count('AC')
wa = s.count('WA')
tle = s.count('TLE')
re = s.count('RE')

print(f'AC x {ac}')
print(f'WA x {wa}')
print(f'TLE x {tle}')
print(f'RE x {re}')

Solution (Python):
from collections import defaultdict

dic = defaultdict(int)
N = int(input())

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

print('AC x {}'.format(dic['AC']))
print('WA x {}'.format(dic['WA']))
print('TLE x {}'.format(dic['TLE']))
print('RE x {}'.format(dic['RE']))

Solution (Python):
n=int(input())
L=[0,0,0,0]
x = [input() for i in range(n)]

for i in range(n):

  if x[i]=='AC':
    L[0]=L[0]+1
  elif x[i]=='WA':
    L[1]=L[1]+1
  elif x[i]=='TLE':
    L[2]=L[2]+1
  else:
    L[3]=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):
from collections import Counter
def main():
    N = int( input())
    S = [ input() for _ in range(N)]
    C = Counter(S)
    print("AC", "x", C["AC"])
    print("WA", "x", C["WA"])
    print("TLE", "x", C["TLE"])
    print("RE", "x", C["RE"])

if __name__ == '__main__':
    main()

Solution (Python):
ac = 0
wa = 0
tle = 0
re = 0
for t in range(int(input())):
    s = input()
    if "AC" in s:
        ac += 1
    elif "WA" in s:
        wa += 1
    elif "TLE" in s:
        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())
Si = [input() for i in range(N)]

C0 = 0
C1 = 0
C2 = 0
C3 = 0

for in1 in Si:
    if in1 == "AC":
        C0 +=1
    elif in1 == "WA":
        C1 += 1
    elif in1 == "TLE":
        C2 += 1
    elif in1 == "RE":
        C3 += 1

print("AC x {}".format(C0))
print("WA x {}".format(C1))
print("TLE x {}".format(C2))
print("RE x {}".format(C3))

Solution (Python):
from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(n):
    word = str(input())
    d[word]+=1
print("{} {} {}".format("AC","x",d["AC"]))
print("{} {} {}".format("WA","x",d["WA"]))
print("{} {} {}".format("TLE","x",d["TLE"]))
print("{} {} {}".format("RE","x",d["RE"]))

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
    if s == 'WA':
        WA += 1
    if s == 'TLE':
        TLE += 1
    if s == '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):
n = int(input())
hashtable = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(n):
    create = input()
    if create in hashtable:
        hashtable[create] += 1
for i in hashtable.keys():
    print(i, end=" x ")
    print(hashtable.get(i))

Solution (Python):
num = int(input())
ac=0
wa=0
tle=0
re =0
for n in range(num):
  str1 =input()
  if str1=="AC":
    ac +=1
  elif str1=="WA":
    wa+=1
  elif str1=="TLE":
    tle+=1
  elif str1 == "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):
import collections

N = int(input())
C = []
for i in range(N):
  C.append(input())
X = collections.Counter(C)
print("AC x " + str(X["AC"]))
print("WA x " + str(X["WA"]))
print("TLE x " + str(X["TLE"]))
print("RE x " + str(X["RE"]))

Solution (Python):

import sys
input = lambda: sys.stdin.readline().strip()
counter = {
    'AC': 0,
    'WA': 0,
    'TLE': 0,
    'RE': 0
}
n = int(input())
for _ in range(n):
    counter[input()] += 1

for v, c in counter.items():
    print(v, 'x', c)

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

for i in range(n):
    ary.append(str(input()))

for j in ary:
    if j == "AC":
        s[0] += 1
    elif j == "WA":
        s[1] += 1
    elif j == "TLE":
        s[2] += 1
    elif j == "RE":
        s[3] += 1

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

Solution (Python):
N=int(input())
cnt_AC,cnt_WA,cnt_TLE,cnt_RE=0,0,0,0
ans=[cnt_AC,cnt_WA,cnt_TLE,cnt_RE]
result_list=["AC","WA","TLE","RE"]
for i in range(N):
    result=input()
    if result=="AC":
        ans[0]+=1
    elif result=="WA":
        ans[1]+=1
    elif result=="TLE":
        ans[2]+=1
    elif result=="RE":
        ans[3]+=1
for i in range(4):
    print(result_list[i]+" x "+str(ans[i]))

Solution (Python):
n=int(input())
L=[0,0,0,0]
x = [input() for i in range(n)]

for i in range(n):

  if x[i]=='AC':
    L[0]=L[0]+1
  elif x[i]=='WA':
    L[1]=L[1]+1
  elif x[i]=='TLE':
    L[2]=L[2]+1
  else:
    L[3]=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())
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):
N = int(input())
s = [input() for v in range(N)]
for v in ["AC", "WA", "TLE", "RE"]:
    print("{0} x {1}".format(v, s.count(v)))

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

R = ["AC", "WA", "TLE", "RE"]
C = [0, 0, 0, 0]

for i in range(N):
    S = input()
    if S == R[0]:
        C[0] += 1
    elif S == R[1]:
        C[1] += 1
    elif S == R[2]:
        C[2] += 1
    elif S == R[3]:
        C[3] += 1

for i in range(len(C)):
    print(R[i], "x", C[i])

Solution (Python):
N = int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(N):
  d = input()
  if d=="AC":
    AC+=1
  elif d=="WA":
    WA+=1
  elif d=="TLE":
    TLE+=1
  elif d=="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 _ in range(n):
    key = input()
    if key == 'AC':
        AC += 1
    elif key == 'RE':
        RE += 1
    elif key == 'WA':
        WA += 1
    else:
        TLE += 1
print('AC x',AC)
print('WA x',WA)
print('TLE x',TLE)
print('RE x',RE)

Solution (Python):


n = int(input())

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

C0 = s.count('AC')
C1 = s.count('WA')
C2 = s.count('TLE')
C3 = s.count('RE')

print("AC x {}".format(C0))
print("WA x {}".format(C1))
print("TLE x {}".format(C2))
print("RE x {}".format(C3))

Solution (Python):
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
  tmp = input()
  if(tmp == "AC"):
    AC += 1
  if(tmp == "WA"):
    WA += 1
  if(tmp == "TLE"):
    TLE += 1
  if(tmp == "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):
ac = 0
wa = 0
tle = 0
re = 0
for i in range(int(input())):
    n = input().upper()
    if n == 'AC':
        ac += 1
    elif n == 'WA':
        wa += 1
    elif n == 'TLE':
        tle += 1
    else:
        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)]

for item in ['AC', 'WA', 'TLE', 'RE']:
    print("{} x {}".format(item, S.count(item)))

Solution (Python):
N = int(input())
count = [0] *4
hyoka_li = ['AC','WA','TLE','RE']
for _ in range(N):
  hyoka = input()
  if hyoka == hyoka_li[0]:count[0] += 1
  elif hyoka == hyoka_li[1]:count[1] += 1
  elif hyoka == hyoka_li[2]:count[2] += 1
  else:count[3] += 1
for i in range(4):
	print('{} x {}'.format(hyoka_li[i],count[i]))

Solution (Python):
import collections
n = int(input())
d = collections.defaultdict(int)
for i in range(n):
  d[str(input())] += 1
print(f"AC x {d['AC']}")
print(f"WA x {d['WA']}")
print(f"TLE x {d['TLE']}")
print(f"RE x {d['RE']}")

Solution (Python):
data = {
    'AC': 0,
    'WA': 0,
    'TLE': 0,
    'RE': 0,
}

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

for k, v in data.items():
    print(k + ' x ' + str(v))

Solution (Python):
data = {
    'AC': 0,
    'WA': 0,
    'TLE': 0,
    'RE': 0,
}

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

print('AC x ' + str(data['AC']))
print('WA x ' + str(data['WA']))
print('TLE x ' + str(data['TLE']))
print('RE x ' + str(data['RE']))

Solution (Python):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    tmp = input()
    if tmp == "AC":
        ac += 1
    elif tmp == "WA":
        wa += 1
    elif tmp == "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())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    tmp = input()
    if tmp == "AC":
        ac += 1
    elif tmp == "WA":
        wa += 1
    elif tmp == "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())

countA = 0
countW = 0
countT = 0
countR = 0
for i in range(n):
  a = input()
  if a == "AC":
    countA += 1
  elif a == "WA":
    countW += 1
  elif a == "TLE":
    countT += 1
  elif a == "RE":
    countR += 1

print("AC x " + str(countA))
print("WA x " + str(countW))
print("TLE x " + str(countT))
print("RE x " + str(countR))

Solution (Python):
n=int(input())
a=0;w=0;r=0;tl=0
for _ in range(n):
  t=input()
  if(t=='AC'):
    a +=1
  elif(t=='WA'):
    w +=1
  elif(t=='RE'):
    r +=1
  elif(t=='TLE'):
    tl +=1
print('AC x '+str(a))
print('WA x '+str(w))
print('TLE x '+str(tl))
print('RE x '+str(r))

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

for i in ["AC", "WA", "TLE", "RE"]:
    if i in counter:
        value = counter[i]
    else:
        value = 0
    print(f"{i} x {value}")

Solution (Python):
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")))

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

AC=0
WA=0
TLE=0
RE=0
for i in range(N):
    ans = input()
    
    if ans == 'AC':
        AC += 1
    elif ans == 'WA':
        WA += 1
    elif ans == 'TLE':
        TLE += 1
    elif ans == '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 collections import Counter as counter


ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
ix = lambda x:list(input() for _ in range(x))
mix = lambda x:list(mi() for _ in range(x))
iix = lambda x:list(int(input()) for _ in range(x))


def resolve():
    n = ii()
    s = ix(n)
    judge = ["AC","WA","TLE","RE"]
    c = counter(s)
    for item in judge:
        print(item + " x " + str(c[item]))
    
if __name__ == "__main__":
    resolve()

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())
S=[]
for _ in range(N):
    S.append(input())
ans=[0,0,0,0]
for i in S:
    if i=="AC":
        ans[0]+=1
    elif i=="WA":
        ans[1]+=1
    elif i=="TLE":
        ans[2]+=1
    else:
        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())
S = list(input() for i in range(N))
a=0
b=0
c=0
d=0
for i in S:
    if i =="AC":
        a +=1
    elif i =="WA":
        b +=1
    elif i =="TLE":
        c +=1
    elif i =="RE":
        d +=1
print("AC x "+ str(a))
print("WA x "+ str(b))
print("TLE x "+ str(c))
print("RE x "+ str(d))

Solution (Python):
from sys import stdin


def main():
    N, *S = [i.strip() for i in stdin.readlines()]
    N = int(N)
    judge = ["AC", "WA", "TLE", "RE"]
    mul = " x "
    C = [0] * len(judge)
    for Si in S:
        C[judge.index(Si)] += 1
    print("\n".join((judge[i] + mul + str(C[i]) for i in range(len(judge)))))
    return


main()

Solution (Python):
from sys import stdin


def main():
    N, *S = [i.strip() for i in stdin.readlines()]
    N = int(N)
    judge = ["AC", "WA", "TLE", "RE"]
    mul = " x "
    C = [0] * len(judge)
    for Si in S:
        C[judge.index(Si)] += 1
    print("\n".join([judge[i] + mul + str(C[i]) for i in range(len(judge))]))
    return


main()

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000

n = I()
result = [0]*4
for i in range(n):
    s = S()
    if(s == 'AC'):
        result[0] += 1
    elif(s == 'WA'):
        result[1] += 1
    elif(s == 'TLE'):
        result[2] += 1
    elif(s == 'RE'):
        result[3] += 1

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

Solution (Python):
n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
  st=input()
  if st=='AC':
    ac+=1
  elif st=="WA":
    wa+=1
  elif st=="TLE":
    tle+=1
  elif st=="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 _  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")))

Solution (Python):
n = int(input())
list = [input() for i in range(n)]
ac,wa,tle,re = 0,0,0,0
for j in list:
  if j == "AC":
    ac += 1
  if j == "WA":
    wa += 1
  if j == "TLE":
    tle += 1
  if j == "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())
c = [0, 0, 0, 0]

for i in range(n):
    s = input()
    if s == 'AC':
        c[0] += 1
    elif s == 'WA':
        c[1] += 1
    elif s == 'TLE':
        c[2] += 1
    elif s == '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 = int(input())
D = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(N):
  D[input()] += 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())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
	jud = input()
	if jud == 'AC':
		ac += 1
	elif jud == 'WA':
		wa += 1
	elif jud == 'TLE':
		tle += 1
	elif jud == '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 = []
ans = {"AC":0, "WA":0, "TLE":0,"RE":0}
i = 0
for i in range(N):
    S.append(input())

for i in range(N):
    ans[S[i]] +=1
for k, v in ans.items():
    print(k + " x " + str(v))

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

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())
d = {
    'AC': 0,
    'WA': 0,
    'TLE': 0,
    'RE': 0,
}

for _ in range(n):
    judge = input()
    d[judge] += 1

for k, v in d.items():
    print('{} x {}'.format(k, v))

Solution (Python):
n = int(input())
t = {}
for i in range(n):
    s = input()
    if s in t:
        t[s] += 1
    else:
        t[s] = 1
ver = ['AC', 'WA', 'TLE', 'RE']
for v in ver:
    if v in t:
        res = t[v]
    else:
        res = 0
    print(v + ' x ' + str(res))

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
         elif s == "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 = input()
check = [input() for i in range(int(n))]

print('AC x %d' % check.count('AC'))
print('WA x %d' % check.count('WA'))
print('TLE x %d' % check.count('TLE'))
print('RE x %d' % check.count('RE'))

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

AC = WA = TLE = RE = 0
for i in range(0, N, 1):
  t = str(input())
  if t == "AC":
    AC += 1
  elif t == "WA":
    WA += 1
  elif t == "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())

verdict = []

for i in range(n):
    m = input()
    verdict.append(m)


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

for i in range(n):

    if verdict[i] == "AC":
        AC += 1
    elif verdict[i] == "WA":
        WA += 1
    elif verdict[i] == "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())

l = []
for i in range(N):
    S = input()
    l.append(S)
    
print('AC x '+str(l.count('AC')))
print('WA x '+str(l.count('WA')))
print('TLE x '+str(l.count('TLE')))
print('RE x '+str(l.count('RE')))

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

for i in range(N):
  x = input()
  X.append(x)

def Judge():
  k = 0
  l = 0
  m = 0
  n = 0
  for i in range(N):
    if X[i] == 'AC':
      k+=1
    if X[i] == 'WA':
      l+=1
    if X[i] == 'TLE':
      m+=1
    if X[i] == 'RE':
      n+=1
  print("AC " + "x " + str(k))
  print("WA " + "x " + str(l))
  print("TLE " + "x " + str(m))
  print("RE " + "x " + str(n))
Judge()

Solution (Python):
t=int(input())
ac=0
wa=0
tle=0
re=0
for _ in range(t):
  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())
store={'AC':0,'WA':0,'TLE':0,'RE':0}
while n:
    c=input()
    store[c]+=1
    n-=1

for keys in store:
    print(keys,'x',store[keys])

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

Solution (Python):
from collections import Counter

N = int(input())
S = [input() for _ in range(N)] + ["AC", "WA", "TLE", "RE"]

S = Counter(S)

print("AC x "+ str(S["AC"]-1) )
print("WA x "+ str(S["WA"]-1) )
print("TLE x "+ str(S["TLE"]-1) )
print("RE x "+ str(S["RE"]-1) )

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
count = 0
ans = 0

N = i()
S = [s() 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):
n=int(input())
s=[input() for i in range(n)]
for v in ['AC', 'WA', 'TLE', 'RE']:
    print('{0} x {1}'.format(v, s.count(v)))

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def line_to_int(): return int(sys.stdin.readline())
def line_to_each_int(): return map(int, sys.stdin.readline().split())
def line_to_list(): return list(map(int, sys.stdin.readline().split()))
def line_to_list_in_iteration(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]

import sys


from itertools import accumulate 
import bisect 
from collections import Counter

n = line_to_int()
s = []
for i in range(n):
    s.append(sys.stdin.readline().strip())

ans = Counter(s)
print('AC x', ans['AC'])
print('WA x', ans['WA'])
print('TLE x', ans['TLE'])
print('RE x', ans['RE'])

Solution (Python):

n = int(input())
ac = wa = tle = re = 0

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

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", 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
  elif(s == "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):
d = {
    'AC': 0,
    'WA': 0,
    'TLE': 0,
    'RE': 0
}

n = int(input())

for _ in range(n):
    res = input()
    d[res] += 1

for k, v in d.items():
    print('{} x {:d}'.format(k, v))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
ans = {}
ans['AC'] = 0
ans['WA'] = 0
ans['TLE'] = 0
ans['RE'] = 0
for s in S:
    ans[s] += 1
for key in ans:
    print(key + ' x ' + str(ans[key]))

Solution (Python):
from collections import Counter
n=int(input())
s=[input() for i in range(n)]
ans=["AC","WA","TLE","RE"]
s=Counter(s)
for i in ans:
  print("{} x {}".format(i,s[i]))

Solution (Python):
table = {
	'AC' : 0,
	'WA' : 0,
	'TLE' : 0,
	'RE' : 0,
}

n = int(input())

for i in range(n):
	verdict = input().strip()
	table[verdict]+=1

for v in table:
	print('{0} x {1}'.format(v, table[v]))

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

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
ans = [0] * 4
j = ["AC","WA","TLE","RE"]
for i in range(n):
    if s[i] == "AC":
        ans[0] += 1
    elif s[i] == "WA":
        ans[1] += 1
    elif s[i] == "TLE":
        ans[2] += 1
    else:
        ans[3] += 1
for i in range(4):
    print(j[i]+" x "+str(ans[i]))

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

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

N = I()
c0, c1, c2, c3 = 0,0,0,0
for i in range(N):
    s = S()
    if s == "AC":
        c0 += 1
    elif s == "WA":
        c1 += 1
    elif s == "TLE":
        c2 += 1
    elif s == "RE":
        c3 += 1

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

Solution (Python):
from collections import Counter

n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
output = ['AC', 'WA', 'TLE', 'RE']

for key in output:
    print(f'{key} x {counter[key]}')

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

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

for i in range(N):
  x = input()
  if x == "AC" :
    ac += 1
    
  elif x == "WA" :
    wa += 1
    
  elif x == "TLE" :
    tle += 1
    
  elif x == "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())

dic = {}
dic["AC"] = 0
dic["WA"] = 0
dic["TLE"] = 0
dic["RE"] = 0

for i in range(N):
    S = input()
    dic[S] += 1

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

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

Solution (Python):
n=int(input())
dic={"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(n):
  s=input()
  dic[s]+=1
for k,v in dic.items():
  print("{0} x {1}".format(k,v))