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):
def resolve():
    N = int(input())
    S = [input() for _ in range(N)]
    counter = {
        "AC": 0,
        "WA": 0,
        "TLE": 0,
        "RE": 0,
    }
    for i in range(N):
        counter[S[i]] += 1

    for k, v in counter.items():
        print(f"{k} x {v}")

if __name__ == "__main__":
    resolve()

Solution (Python):
N = int(input())
A = 0
T = 0
R = 0
W = 0
for i in range(N):
    S = input()
    if S == 'AC':
        A += 1
    elif S == 'WA':
        W += 1
    elif S == 'TLE':
        T += 1
    elif S == 'RE':
        R += 1


print('AC x',A)
print('WA x',W)
print('TLE x',T)
print('RE x',R)

Solution (Python):
N = int(input())
counter_val = ['AC', 'WA', 'TLE', 'RE']
counter = [0, 0, 0, 0]  
LenOfCounter = 4

for _ in range(N):
    S = input()
    for i in range(LenOfCounter):
        if counter_val[i] == S:
            counter[i] += 1

for i in range(LenOfCounter):
    print('{} x {}'.format(counter_val[i], counter[i]))

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

    AC = 0
    WA = 0
    TLE = 0
    RE = 0
    for i in range(N):
        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))

main()

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

def printf(tex: str, res):
  print(f"{tex} x {res[tex]}")

  
printf("AC", res)
printf("WA", res)
printf("TLE", res)
printf("RE", res)

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

for val in range(n):
  judge=input()
  if judge =='AC':
    ac=ac+1
  elif judge=='WA':
    wa=wa+1
  elif judge=='TLE':
    tle=tle+1
  elif judge=='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())
S = []
for i in range(N):
  S.append(input())
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
  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())
A = 0
W = 0
T = 0
R = 0
for k in range(n):
    s = str(input())
    if s == 'AC':
        A += 1
    elif s == 'WA':
        W += 1
    elif s == 'TLE':
        T += 1
    elif s == 'RE':
        R += 1
print("AC x "+str(A))
print("WA x "+str(W))
print("TLE x "+str(T))
print("RE x "+str(R))

Solution (Python):

d = {"AC":0, "WA":0, "TLE":0, "RE":0}
n = int(input())
for i in range(n):
    d[input()] += 1

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

Solution (Python):
N = int(input())
S = []
for _ in range(N):
    S.append(input())
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):
s = open(0).read().count
for r in "AC", "WA", "TLE", "RE":
    print(r, "x", s(r))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]
res = ["AC", "WA", "TLE", "RE"]

for r in res:
    print(r, "x", s.count(r))

Solution (Python):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
	t = input()
	if t == 'AC':
		ac += 1
	elif t == 'WA':
		wa += 1
	elif t == '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())
ac, wa, tle, re = 0, 0, 0, 0
for _ 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 {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))

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

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

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

Solution (Python):
N = int(input())
S = ['-1' for _ in range(N+1)]
cases = ['AC', 'WA', 'TLE', 'RE']
C = dict(zip(cases, [0]*len(cases)))
for i in range(N):
  S[i+1] = input()
  C[S[i+1]] += 1
for case in cases:
  print('{} x {}'.format(case,str(C[case])))

Solution (Python):
N = int(input())
S = []
for _ in range(N):
    S.append(input())
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):
num = int(input())

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

for _ in range(num):
    s = input()
    count[s] += 1

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

Solution (Python):










number = int(input())
target = [input() for i in range(number)]


result = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}


for x in target:
    result[x] += 1


for title, value in result.items():
    print(title + " x " + str(value))

Solution (Python):
def main():
    N = int(input())
    status = ['AC', 'WA', 'TLE', 'RE']
    counter ={}
    for key in status:
        counter[key] = 0
    for _ in range(N):
        s = input().rstrip()
        counter[s] += + 1
    for key in status:
        print(f"{key} x {counter[key]}")

if __name__ == "__main__":
    main()

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

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
print(*['{} x {}'.format(k, s.count(k)) for k in ['AC', 'WA', 'TLE', 'RE']], sep='\n')

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

Solution (Python):
n = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for a in range(n):
    s = input()
    if s == "AC":
        AC = AC + 1
    if s == "WA":
        WA = WA + 1
    if s == "TLE":
        TLE = TLE + 1
    if s == "RE":
        RE = RE + 1
print("AC x", AC)
print("WA x", WA)
print("TLE x", TLE)
print("RE x", RE)

Solution (Python):


num = int(input())

c = [0,0,0,0]

for i in range(num):
    s = input()
    if s == "AC":
        c[0]+= 1
    if s == "WA":
        c[1]+= 1
    if s == "TLE":
        c[2]+=1
    if s == "RE":
        c[3]+=1




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

Solution (Python):
N = int(input(""))
si = []

for i in range(0, N):
    si.append(input(""))

c0 = si.count("AC")
c1 = si.count("WA")
c2 = si.count("TLE")
c3 = si.count("RE")

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

Solution (Python):


def main():

    N = int(input())

    S = []
    nameC = ['AC', 'WA', 'TLE', 'RE']
    C = [0, 0, 0, 0]

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

    for i in S:
        if i == nameC[0]:
            C[0] += 1

        elif i == nameC[1]:
            C[1] += 1

        elif i == nameC[2]:
            C[2] += 1

        elif i == nameC[3]:
            C[3] += 1

    for i in range(len(C)):
        print(nameC[i], 'x', C[i])
    

if __name__ == "__main__":
    main()

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

answer_dict = {}

answer_list = ['AC', 'WA', 'TLE', 'RE']

for i in answer_list:
    answer_dict[i] = 0

for i in input_list:
    answer_dict[i] += 1
        
for key in answer_list:
    item_num = answer_dict[key]
    print(f"{key} x {item_num}")

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

cnt =  Counter(S)

for s in ['AC',  'WA', 'TLE', 'RE']:
    print(f'{s} x {cnt[s]}')

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

b=s.count('AC')
c=s.count('WA')
d=s.count('TLE')
e=s.count('RE')

print('AC x '+str(b))
print('WA x '+str(c))
print('TLE x '+str(d))
print('RE x '+str(e))

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

cnt = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for i in range(N):
  cnt[input()]+=1
  
for k,v in cnt.items():
  print(k,'x',v)

Solution (Python):
n = int(input())
acc = 0
wac = 0
tlec = 0
rec = 0
for i in range(n):
  x = str(input())
  if x == "AC":
    acc = acc + 1
  elif x == "WA":
    wac = wac + 1
  elif x == "TLE":
    tlec = tlec + 1
  elif x == "RE":
  	rec = rec + 1

print("AC x "+str(acc))
print("WA x "+str(wac))
print("TLE x "+str(tlec))
print("RE x "+str(rec))

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

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

A = [0]*4

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

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

Solution (Python):
n = int(input())
words = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
  a = input()
  words[a] += 1
print("AC x " + str(words["AC"]))
print("WA x " + str(words["WA"]))
print("TLE x " + str(words["TLE"]))
print("RE x " + str(words["RE"]))

Solution (Python):
N = int(input())
a, w, t, r = 0, 0, 0, 0
for _ in range(N):
    S = input()
    if S == 'AC':
        a += 1
    elif S == 'WA':
        w += 1
    elif S == '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))

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




acCnt = 0
waCnt = 0
tlCnt = 0
reCnt = 0

for i in range(n):
    s = input()
    if s == "AC":
        acCnt = acCnt + 1
    elif s == "WA":
        waCnt = waCnt + 1
    elif s == "TLE":
        tlCnt = tlCnt + 1
    else:
        reCnt = reCnt + 1

print ("AC x",acCnt)
print ("WA x",waCnt)
print ("TLE x",tlCnt)
print ("RE x",reCnt)

Solution (Python):


def solve():
    n = int(input())
    s = [input() for i in range(n)]
    ans = ''
    for v in ['AC', 'WA', 'TLE', 'RE']:
        ans += "{0} x {1}\n".format(v, s.count(v))
    return ans

print(solve())

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

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

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


for key, value in count.items():
    print(key + ' x ' + str(value))

Solution (Python):
n =  int(input())
ac = 0
tle = 0
re = 0
wa = 0
for i in range(n):
    string = input()
    if string == "AC":
        ac += 1
    if string == "WA":
        wa += 1
    if string == "TLE":
        tle += 1
    if string == "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):
dict={'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(int(input())):
	x=input()
	if x in dict:
		dict[x]+=1
for i in dict:
	print (str(i)+" x "+str(dict[i]))

Solution (Python):
import math
import sys
from collections import Counter
readline = sys.stdin.readline


def main():
    n = int(readline().rstrip())
    s = [readline().rstrip() for _ in range(n)]
    c = Counter(s)
    lis = ['AC', 'WA', 'TLE', 'RE']
    for li in lis:
        print(li+' x ' + str(c[li]))


if __name__ == '__main__':
    main()

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

Solution (Python):
list = []
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())
L=[input() for i in range(n)]
LC=Counter(L)

A=['AC', 'WA', 'TLE', 'RE']
for a in A:
    if a in LC.keys():
        print(a+' x '+str(LC[a]))
    else:
        print(a+' x '+'0')

Solution (Python):
ac, wa, tle, re = 0, 0, 0, 0
n = int(input())
for _ 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 = [0]*N
AC = 0
WA = 0
TLE = 0
RE = 0

for n in range(N):
  S[n] = str(input())
  if S[n] == "AC":
    AC = AC + 1
  elif S[n] == "WA":
    WA = WA + 1
  elif S[n] == "TLE":
    TLE = TLE + 1
  elif S[n] == "RE":
    RE = RE + 1
    
print("AC x {}\nWA x {}\nTLE x {}\nRE x {}".format(AC,WA,TLE,RE))

Solution (Python):
n=int(input())
num1=0
num2=0
num3=0
num4=0
for i in range(n):
    x=input()
    if x=="AC":
        num1+=1
    elif x=="WA":
        num2+=1
    elif x=="TLE":
        num3+=1
    elif x=="RE":
        num4+=1
print(f"AC x {num1}\nWA x {num2}\nTLE x {num3}\nRE x {num4}")

Solution (Python):

import sys
rl = sys.stdin.buffer.readline
read = sys.stdin.buffer.read

N = int(rl())
SL = read().split()

A, W, T, R = ord('A'), ord('W'), ord('T'), ord('R')
na, nw, nt, nr = 0, 0, 0, 0
for s in SL:
  if s[0] == A:
    na += 1
  elif s[0] == W:
    nw += 1
  elif s[0] == T:
    nt += 1
  elif s[0] == R:
    nr += 1

print('AC x ' + str(na))
print('WA x ' + str(nw))
print('TLE x ' + str(nt))
print('RE x ' + str(nr))

Solution (Python):
N = int(input())
S = []
for _ in range(N):
    S.append(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())
lst = [None for i in range(n)]
for i in range(n):
    lst[i] = input()

count = [0,0,0,0]
for i in lst:
    if i=="AC":
        count[0]+=1
    elif i=="WA":
        count[1]+=1
    elif i=="TLE":
        count[2]+=1
    else:
        count[3]+=1

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

Solution (Python):
res = {"AC":0,"WA":0,"TLE":0,"RE":0}
a = int(input())
b = [input() for i in range(a)]
for l in b:
  res[l] +=1

for k,v in res.items():
  print(k + " x " + str(v))

Solution (Python):
a=int(input())
b=[input() for i in range(a)]
c=["AC","WA","TLE","RE"]
for value in c:
  print('{0} x {1}'.format(value, b.count(value)))

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):
n=int(input())
d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range (n):
  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())
ans={"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(n):
  res = input()
  ans[res] += 1
for i in ["AC","WA","TLE","RE"]:
  print(i,"x",ans[i])

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


result = ["AC", "WA", "TLE", "RE"]
li = [0]*4

for i in s:
	li[result.index(i)] += 1

for i in range(4):
	print(result[i], "x", li[i])

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

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

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

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

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

Solution (Python):
from collections import Counter

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

counter = Counter(S)
for judge in ['AC', 'WA', 'TLE', 'RE']:
    print(f'{judge} x {counter[judge]}')

Solution (Python):
N=input()
C_0=0
C_1=0
C_2=0
C_3=0
for i in range(int(N)):
    S_i=input()
    if S_i=='AC':
        C_0=C_0+1
    elif S_i=='WA':
        C_1=C_1+1
    elif S_i=='TLE':
        C_2=C_2+1
    else:
        C_3=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):
l=[]    
acnt=0
wcnt=0
tcnt=0
rcnt=0
for _ in range(int(input())):
    l= list(map(str,input().split('\n')))
    for i in range(len(l)):
        if l[i]=='AC':
            acnt+=1
        elif l[i]=='WA':
            wcnt+=1
        elif l[i]=='TLE':
            tcnt+=1
        else:
            rcnt+=1
    
print("AC x "+str(acnt))
print("WA x "+str(wcnt))
print("TLE x "+str(tcnt))
print("RE x "+str(rcnt))

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

print("AC x", freq["AC"])
print("WA x", freq["WA"])
print("TLE x", freq["TLE"])
print("RE x", freq["RE"])

Solution (Python):
x=int(input())
b=0;
lst=[]
acs=0
was=0
res=0
tles=0
while(b<x):
    new=input()
    lst.append(new)
    b+=1
for c in lst:
    if(c=='AC'):
        acs+=1
    if(c=='WA'):
        was+=1
    if(c=='RE'):
        res+=1
    if(c=='TLE'):
        tles+=1
print('AC x '+str(acs))
print('WA x '+ str(was))
print('TLE x ' +str(tles))
print('RE x ' +str(res))

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

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

for i in range(num):
    x=input()
    if x=="AC":
        AC+=1
    elif x=="WA":
        WA+=1
    elif x=="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):
a =int(input())
resultList=[]
for i in range(a):
  resultList.append(input())
print('AC x '+str(resultList.count('AC')))
print('WA x '+str(resultList.count('WA')))
print('TLE x '+str(resultList.count('TLE')))
print('RE x '+str(resultList.count('RE')))

Solution (Python):


import itertools
import math
import sys
from typing import *

INF = float('inf')


def solve(N: int, S: "List[str]"):
    return "\n".join([f'{v} x {S.count(v)}' for v in ["AC", "WA", "TLE", "RE"]])


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    S = [next(tokens) for _ in range(N)]  
    print(solve(N, S))


if __name__ == '__main__':
    main()

Solution (Python):
lis = []
n = int(input())
for i in range(n):
    p = input()
    lis.append(p)
ac = lis.count("AC")
wa = lis.count("WA")
tle = lis.count("TLE")
re = lis.count("RE")
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(n):
    results.append(input())

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

Solution (Python):
def solve():
    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')))

if __name__ == "__main__":
    solve()

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

status_case = ['AC', 'WA', 'TLE', 'RE']
for s, x in zip(status_case, status_list):
    print(s + ' x ' + str(x))

Solution (Python):
AC = 0
WA = 0
TLE = 0
RE = 0
N = int(input())
for i in range(N):
	a = input()
	if(a == "AC"):
		AC = AC + 1
	if(a == "WA"):
 		WA = WA + 1
	if(a == "TLE"):
		TLE = TLE + 1
	if(a=="RE"):
		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

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):
    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):
AC = []
WA = []
TLE = []
RE = []

for _ in range(int(input())):
  s = input()

  if s == "AC":
    AC.append(s)
  elif s == "WA":
    WA.append(s)
  elif s == "TLE":
    TLE.append(s)
  elif s == "RE":
    RE.append(s)

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

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

acnum=list_judge.count("AC")
wanum=list_judge.count("WA")
tlenum=list_judge.count("TLE")
renum=list_judge.count("RE")

print("AC x ",acnum)
print("WA x ",wanum)
print("TLE x ",tlenum)
print("RE x ",renum)

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

S = [0] * N
cnt = [0] * 4
i = 0

while i < N:
    S[i] = input()
    if S[i] == 'AC':
        cnt[0] += 1
    elif S[i] == 'WA':
        cnt[1] += 1
    elif S[i] == 'TLE':
        cnt[2] += 1
    elif S[i] == 'RE':
        cnt[3] += 1
    i += 1

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

Solution (Python):
N = int(input())
C = [0]*4
for i in range(N):
  M = input()
  if M == "AC":
    C[0] += 1
  elif M == "WA":
    C[1] += 1
  elif M == "TLE":
    C[2] += 1
  elif M == "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())
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())
S = [input() for i in range(N)]
print('AC x %d'%S.count('AC'))
print('WA x %d'%S.count('WA'))
print('TLE x %d'%S.count('TLE'))
print('RE x %d'%S.count('RE'))

Solution (Python):
def main():
    S=[input() for _ in range(int(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'))

main()

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

d = [input() for i in range(m)]

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

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

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

Solution (Python):
from collections import Counter
N = int(input())
d = Counter()
for _ in range(N):
    S = input()
    if d[S]:
        d[S] += 1
    else:
        d[S] = 1
for j in 'AC WA TLE RE'.split():
    num = d[j]
    print('{} x {}'.format(j, num))

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

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

print('AC x %d' %lst.count('AC'))
print('WA x %d' %lst.count('WA'))
print('TLE x %d' %lst.count('TLE'))
print('RE x %d' %lst.count('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):
def count_data(s):
    judge_list = ['AC', 'WA', 'TLE', 'RE']
    for judge in judge_list:
        ans = s.count(judge)
        print('{} x {}'.format(judge, ans))

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

count_data(s)

Solution (Python):
n = int(input())
arr = [input() for i in range(n)]
ans = [0,0,0,0]
for i in arr:
    if i == 'AC':
        ans[0] += 1
    elif i == 'WA':
        ans[1] += 1
    elif i == 'TLE':
        ans[2] += 1
    else:
        ans[3] += 1
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())
C0, C1, C2, C3 = 0, 0, 0, 0

for i in range(N):
    S = str(input())
    if S == "AC":
        C0 = C0 + 1
    elif S == "WA":
        C1 = C1 + 1
    elif S == "TLE":
        C2 = C2 + 1
    else:
        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):
L = {'AC':0,'WA':0,'TLE':0,'RE':0}
 
n = int(input())
for i in range(n):
  L[input()] += 1
for i in L:
  print(i,"x",L[i])

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


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


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

Solution (Python):
a = [input() for _ in range(int(input()))]
print("AC x {}".format(a.count("AC")))
print("WA x {}".format(a.count("WA")))
print("TLE x {}".format(a.count("TLE")))
print("RE x {}".format(a.count("RE")))

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

for i in strings:
    print(i," x ",strings[i])

Solution (Python):
n=int(input())
ans=[0]*4
for i in range(n):
  s=input()
  if s=='AC':
    ans[0]+=1
  elif s=='WA':
    ans[1]+=1
  elif s=='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):
n = int(input())
a, w, t, r = 0, 0, 0, 0
for i in range(n):
    s = input()
    if s == "AC":
        a += 1
    elif s == "WA":
        w += 1
    elif s == "TLE":
        t += 1
    else:
        r += 1

print(f"AC x {a}")
print(f"WA x {w}")
print(f"TLE x {t}")
print(f"RE x {r}")

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

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

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
ac_count, wa_count, tle_count, re_count = 0, 0, 0, 0
for i in range(n):
  s = input()
  if s == "AC":
    ac_count += 1
  elif s == "WA":
    wa_count += 1
  elif s == "TLE":
    tle_count += 1
  else:
    re_count += 1
print("AC x ",ac_count)
print("WA x ",wa_count)
print("TLE x ",tle_count)
print("RE x ",re_count)

Solution (Python):
from sys import stdin
import sys

n = int(stdin.readline().rstrip())

a=b=c=d=0
for i in range(n):
    s = stdin.readline().rstrip()
    if s == "AC":
        a = a + 1
    elif s == "WA":
        b = b + 1
    elif s == "TLE":
        c = c + 1
    elif s == "RE":
        d = d + 1

print ("AC x",a)
print ("WA x",b)
print ("TLE x",c)
print ("RE x",d)

Solution (Python):
N =int(input())
list ={"AC":0, "WA":0, "TLE":0, "RE":0 }
 
l=[input() for i in range(N)]

for i in list:
  print('{0} x {1}'.format(i, l.count(i)))

Solution (Python):
n=int(input())
dic={}
dic["AC"]=0
dic["WA"]=0
dic["TLE"]=0
dic["RE"]=0
for x in range(n):
  a=input()
  dic[a]=dic[a]+1
print("AC","x",dic["AC"])
print("WA","x",dic["WA"])
print("TLE","x",dic["TLE"])
print("RE","x",dic["RE"])

Solution (Python):
n = int(input())
l = [input() for i in range(n)]
reslt = ["AC", "WA", "TLE", "RE"]
for j in reslt:
	print('{0} x {1}'.format(j, l.count(j)))

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

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

Solution (Python):
import numpy as np
if __name__ == "__main__":
    N=input()
    N=int(N)
    strs=["AC","WA","TLE","RE"]
    cnt=np.zeros(4,dtype=np.uint32)
    for i in range(N):
        b=input()
        for j,s in enumerate(strs):
            if s==b:
                cnt[j]+=1
    for i,s in enumerate(strs):
        print(s+" x "+str(cnt[i]))

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

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

for i in range(N):
  wrk = input()
  d[wrk] = d[wrk]+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())
ans=[0]*4
dict={"AC":0,"WA":1,"TLE":2,"RE":3}
for _ in range(n):
    temp=input()
    ans[dict[temp]]+=1
print("AC x ",ans[0])
print("WA x ",ans[1])
print("TLE x ",ans[2])
print("RE x ",ans[3])

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

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

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

Solution (Python):
S = [input() for i in range(int(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,*S,=open(0).read().split()
N=int(N)
C0=S.count('AC')
C1=S.count('WA')
C2=S.count('TLE')
C3=S.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().rstrip())
dict = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}

for i in range(n):
  key = input().rstrip()
  dict[key] += 1

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