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):
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007

inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')

file = 0

def solve():
    



    

    n=ii()
    m={}
    a=["AC","WA","TLE","RE"]
    m['WA']=0
    m['TLE']=0
    m["AC"]=0
    m["RE"]=0
    for i in range(n):
        s=si()
        m[s]+=1
    for i in a:
        print(i,end=" x ")
        print(m[i])












  
















if __name__ =="__main__":

    if(file):

        if path.exists('input1.txt'):
            sys.stdin=open('input1.txt', 'r')
            sys.stdout=open('output1.txt','w')
        else:
            input=sys.stdin.readline
    solve()

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

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

print("AC x "+ str(d["AC"]))
print("WA x "+ str(d["WA"]))
print("TLE x "+ str(d["TLE"]))
print("RE x "+ str(d["RE"]))

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

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

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

Solution (Python):
n = int(input())
s = dict()
s["AC"]=0
s["WA"]=0
s["TLE"]=0
s["RE"]=0

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

a = ["AC", "WA", "TLE", "RE"]
for i in a:
    print(i + " x " + str(s[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 {0}'.format(ans[0]))
print('WA x {0}'.format(ans[1]))
print('TLE x {0}'.format(ans[2]))
print('RE x {0}'.format(ans[3]))

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

for i in dic:
    print("%s x %d" % (i, dic[i]))

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    N = II()
    s = ["0"]*N
    for i in range(N):
        s[i] = input()
    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)

if __name__ == "__main__":
	main()

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

for s in ss:
    if s == t[0]:
        ans[0] += 1
    elif s == t[1]:
        ans[1] += 1
    elif s == t[2]:
        ans[2] += 1
    elif s == t[3]:
        ans[3] += 1


for j, c in zip(t, ans):
    print(j, " x ", c)

Solution (Python):
n = int(input())
l =[input() for _ in range(n)]
a=0
b=0
c=0
d=0
for i in l:
    if i == "AC":
        a += 1
    if i == "WA":
        b += 1
    if i == "TLE":
        c += 1
    if 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):
n=int(input())
l=[]
for i in range(n):
    k=input()
    l.append(k)
print("AC x {}".format(l.count("AC")))
print("WA x {}".format(l.count("WA")))
print("TLE x {}".format(l.count("TLE")))
print("RE x {}".format(l.count("RE")))

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

for i in range(n):
    st = input()
    if st == 'AC':
        s[0] += 1
    elif st == 'WA':
        s[1] += 1
    elif st == 'TLE':
        s[2] += 1
    else:
        s[3] += 1

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

Solution (Python):
N=int(input())
string_list=[input() for i in range(N)]
C0=0
C1=0
C2=0
C3=0
for i in string_list:
    if i=='AC':
        C0+=1
    elif i=='WA':
        C1+=1
    elif i=='TLE':
        C2+=1
    elif i=='RE':
        C3+=1

print('AC','','x','',C0)
print('WA','','x','',C1)
print('TLE','','x','',C2)
print('RE','','x','',C3)

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

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

Solution (Python):
def main():
    n = int(input())
    S = [input() for _ in range(n)]
    dic = {}
    dic["AC"] = 0
    dic["WA"] = 0
    dic["TLE"] = 0
    dic["RE"] = 0
    for s in S:
        if s in dic:
            dic[s] += 1
        else:
            dic[s] = 1
    print(f"AC x {dic['AC']}")
    print(f"WA x {dic['WA']}")
    print(f"TLE x {dic['TLE']}")
    print(f"RE x {dic['RE']}")
    return


if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())
c0,c1,c2,c3=0,0,0,0
for i in range(N):
  s=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", c0)
print("WA x", c1)
print("TLE x", c2)
print("RE x", c3)

Solution (Python):
from collections import defaultdict
dic = defaultdict(lambda :0)

N = int(input())
for i in range(N):
    dic[input()] += 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())
test = []
for i in range(N):
    s = input()
    test.append(s)

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

Solution (Python):
n=int(input())
Ac=0
Wa=0
Tle=0
Re=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
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())
ac = []
wa = []
tle = []
re = []
for _ in range(n):
    i = input()
    if i == "WA":
        wa.append(i)
    elif i == "AC":
        ac.append(i)
    elif i == "TLE":
        tle.append(i)
    else:
        re.append(i)

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())
arr = [input() for i in range(n)]
acnum = arr.count('AC')
wanum = arr.count('WA')
tlenum = arr.count('TLE')
renum = arr.count('RE')
print('AC x',str(acnum))
print('WA x',str(wanum))
print('TLE x',str(tlenum))
print('RE x',str(renum))

Solution (Python):
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    uinp = input()
    if uinp == "AC":
        AC += 1
    elif uinp == "WA":
        WA += 1
    elif uinp == "TLE":
        TLE += 1
    elif uinp == "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())
ac_count = 0
wa_count = 0
tle_count = 0
re_count = 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 {}'.format(ac_count))
print('WA x {}'.format(wa_count))
print('TLE x {}'.format(tle_count))
print('RE x {}'.format(re_count))

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

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

d = {"AC":0,"WA":0,"TLE":0,"RE":0}  
for s in sn:
  if s in d:
    d[s] += 1
    
for di in d.items():
  print(di[0],"x",di[1] )

Solution (Python):
import sys
input = sys.stdin.readline


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    N = readint()
    s = [readstr() for _ in range(N)]
    print(f"AC x {s.count('AC')}")
    print(f"WA x {s.count('WA')}")
    print(f"TLE x {s.count('TLE')}")
    print(f"RE x {s.count('RE')}")


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import sys, math, itertools, collections, bisect 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(N):
  IN=input()
  if IN=='AC':
    AC+=1
  if IN=='WA':
    WA+=1
  if IN=='TLE':
    TLE+=1
  if IN=='RE':
    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
for i in range(N):
  S = input()
  if S == "AC":
    c0+=1
  elif S == "WA":
    c1+=1
  elif S == "TLE":
    c2+=1
  elif S == "RE":
    c3+=1

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

Solution (Python):

N = int(input())
lst = [input() for _ in range(N)]
ac = 0
wa = 0
tle = 0
re = 0


for s in lst:
    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())
ac=0
wa=0
tle=0
re=0
for i in range(N):
    result=input()
    if(result=="AC"):
        ac+=1
    elif(result=="WA"):
        wa+=1
    elif(result=="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):
ac,wa,tle,re=0,0,0,0
for i in range(int(input())):
    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):
import collections
n = int(input())
ss = [input() for _ in range(n)]
ctr = collections.Counter(ss)
print('%s x %d' % ('AC', ctr['AC']))
print('%s x %d' % ('WA', ctr['WA']))
print('%s x %d' % ('TLE', ctr['TLE']))
print('%s x %d' % ('RE', ctr['RE']))

Solution (Python):
N=int(input())
num_AC=0
num_WA=0
num_TLE=0
num_RE=0
for i in range(N):
    S=input()
    if S=="AC":
        num_AC+=1
    elif S=="WA":
        num_WA+=1
    elif S=="TLE":
        num_TLE+=1
    else:
        num_RE+=1
print("AC x ",num_AC)
print("WA x ",num_WA)
print("TLE x ",num_TLE)
print("RE x ",num_RE)

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

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

for i in range(N):
    j = input()
    if j == "AC":
        AC += 1
    elif j == "WA":
        WA += 1
    elif j == "TLE":
        TLE += 1
    elif j == "RE":
        RE += 1


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

Solution (Python):
if __name__ == '__main__':
    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", ac)
    print("WA x", wa)
    print("TLE x", tle)
    print("RE x", re)

Solution (Python):
n=int(input(''))
l=[]

ac=[]
wa=[]
tle=[]
re=[]
for a in range(n):
    w=input('')
    if w=='AC':
        ac.append(w)
    elif w=='WA':
        wa.append(w)
    elif w=='TLE':
        tle.append(w)
    elif w=='RE':
        re.append(w)

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

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

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

for i in range(n):
    st = input()
    if st == 'AC':
        c0 = c0 + 1
    elif st == 'WA':
        c1 = c1 + 1
    elif st == 'TLE':
        c2 = c2 + 1
    else: 
        c3 = c3 + 1
        

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

Solution (Python):
l = ['AC', 'WA', 'TLE', 'RE']
c = [0,0,0,0]
n = int(input())
for i in range(n):
  c[l.index(input())] += 1
for i in range(len(l)):
  print(f'{l[i]} x {c[i]}')

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

cnt_ac = 0
cnt_wa = 0
cnt_tle = 0
cnt_re = 0

for cnt in range(n):
    if s[cnt] == "AC":
        cnt_ac += 1
    elif s[cnt] == "WA":
        cnt_wa += 1
    elif s[cnt] == "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())

AC = 0
WA = 0
TLE = 0
RE = 0
for _ 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):
def readInt():
    return list(map(int, input().split()))

ac = 0
wa = 0
tle = 0
re = 0
n = int(input())
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 {}'.format(ac))
print('WA x {}'.format(wa))
print('TLE x {}'.format(tle))
print('RE x {}'.format(re))

Solution (Python):
N = int(input())
S = [input() for i in range(N)]
count_AC, count_WA, count_TLE, count_RE = 0, 0, 0, 0
for s in S:
    if s == 'AC':
        count_AC+=1
    elif s == 'WA':
        count_WA+=1
    elif s == 'TLE':
        count_TLE+=1
    else:
        count_RE+=1

print('AC x '+str(count_AC))
print('WA x '+str(count_WA))
print('TLE x '+str(count_TLE))
print('RE x '+str(count_RE))

Solution (Python):
n = int(input())
l = [input() for x in range(n)]
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):
import numpy as np
N = int(input())
S = [input() for n in range(N)]
S = np.array(S)

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

Solution (Python):
n=int(input(""))
c0=0
c1=0
c2=0
c3=0
for i in range(n):
    s=input("")
    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):
N = int(input())
S = []
for _ in range(N):
  S.append(input())

C = {
  'AC': 0,
  'WA': 0,
  'TLE': 0, 
  'RE': 0
}
for s in S:
  C[s] += 1

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

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

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

S = [input() for _ 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())

A = []

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

cnt = [0,0,0,0]

for r in A:
    if r == 'AC': cnt[0] += 1
    elif r == 'WA': cnt[1] += 1
    elif r == 'TLE': cnt[2] += 1
    else: cnt[3] += 1

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

Solution (Python):
from collections import Counter
N, *S=map(str, open(0).read().split())
N = int(N)
S = Counter(S)

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

Solution (Python):
N = int(input())
S = []
for i 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())


AC = 0
WA = 0
TLE = 0
RE = 0
for _ in range(N):
    judge = input()
    if judge == 'AC':
        AC += 1
    elif judge == 'WA':
        WA += 1
    elif judge == 'TLE':
        TLE += 1
    elif judge == '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())
words = []
for i in range(N):
    w = input()
    words.append(w)
ac_len = words.count('AC')
wa_len = words.count('WA')
tl_len = words.count('TLE')
re_len = words.count('RE')
print(f'AC x {ac_len}')
print(f'WA x {wa_len}')
print(f'TLE x {tl_len}')
print(f'RE x {re_len}')

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

for i in ["AC","WA","TLE","RE"]:
    print(i,"x",cnt[i])

Solution (Python):
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    S = input()
    if S == 'AC':
        AC = AC + 1
    elif S == 'WA':
        WA = WA + 1
    elif S == 'TLE':
        TLE = TLE + 1
    else:
        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())
cnt = [0]*4
for i in range(n):
    s = input()
    if s == 'AC':
        cnt[0] += 1
    elif s == 'WA':
        cnt[1] += 1
    elif s == 'TLE':
        cnt[2] += 1
    else:
        cnt[3] += 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())
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(str(input())) for i in range(N)]

AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    if S[i][0] == 'A':
        AC += 1
    elif S[i][0] == 'W':
        WA += 1
    elif S[i][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):
N = int(input())

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

res = [0, 0, 0, 0]
for i in S:
    if i == 'AC':
        res[0] += 1
    elif i == 'WA':
        res[1] += 1
    elif i == 'TLE':
        res[2] += 1
    elif i == 'RE':
        res[3] += 1

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

Solution (Python):
n = int(input())
count = [0, 0, 0, 0]
for _ in range(n):
    s = input()
    if s == "AC":
        count[0] += 1
    elif s == "WA":
        count[1] += 1
    elif s == "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):
n = int(input())
s = []
for i in range(n):
    s.append(input())

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

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

Solution (Python):
from collections import Counter

n = int(input())
verdict = list()
while n:
    n -= 1
    verdict.append(input())

dictOBJ = dict()
dictOBJ = { 'AC' : 0, 'WA' : 0, 'TLE' : 0, 'RE' : 0}
for elm in verdict:
    dictOBJ[elm] += 1

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

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

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

a = "AC x " + str(AC)
b = "WA x " + str(WA)
c = "TLE x " + str(TLE)
d = "RE x " + str(RE)

print(a)
print(b)
print(c)
print(d)

Solution (Python):
import numpy as np

N = int(input())
s = np.array([input() for _ in range(N)])
print('AC x {}'.format(np.count_nonzero(s=='AC')))
print('WA x {}'.format(np.count_nonzero(s=='WA')))
print('TLE x {}'.format(np.count_nonzero(s=='TLE')))
print('RE x {}'.format(np.count_nonzero(s=='RE')))

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 = []
for i in range(N):
    S.append(input())
    
a=0
w=0
t=0
r=0

for i in S:
    if i=="AC":
        a+=1
    elif i=="WA":
        w+=1
    elif i=="TLE":
        t+=1
    elif i=="RE":
        r+=1
        
print(f"AC x {a}")
print(f"WA x {w}")
print(f"TLE x {t}")
print(f"RE x {r}")

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

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

Solution (Python):
N=int(input())
List = []
for i in range (N):
  List.append(input())
res1 = List.count("AC")
res2= List.count("WA")
res3= List.count("TLE")
res4= List.count("RE")

print("AC x",res1)
print("WA x",res2) 
print("TLE x",res3)
print("RE x",res4)

Solution (Python):

N=int(input())
a=0
b=0
c=0
d=0
for i in range(N):
    s=input()
    if s=="AC":
        a+=1
    elif s=="WA":
        b+=1
    elif s=="TLE":
        c+=1
    elif s=="RE":
        d+=1
print("AC x ",a)
print("WA x ",b)
print("TLE x ",c)
print("RE x ",d)

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

def main():
    cnt = [0] * 4
    n = int(input())
    for i in range(n):
        res = input()
        if res == "AC":
            cnt[0] += 1
        elif res == "WA":
            cnt[1] += 1
        elif res == "TLE":
            cnt[2] += 1
        elif res == "RE":
            cnt[3] += 1
    print("AC x "+str(cnt[0]))
    print("WA x "+str(cnt[1]))
    print("TLE x "+str(cnt[2]))
    print("RE x "+str(cnt[3]))

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 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
  
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 x in range(N)]

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

ac = sum(1 for x in S if x == "AC")
wa = sum(1 for x in S if x == "WA")
tl = sum(1 for x in S if x == "TLE")
re = sum(1 for x in S if x == "RE")

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

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

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

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

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

for i in range(n):
    s = input()
    if "AC" == s:
        ac += 1
    elif "WA" == s:
        wa += 1
    elif "TLE" == s:
        tle += 1
    elif "RE" == s:
        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())
lis = [0,0,0,0]
for i in range(N):
    s = input()
    if s == 'AC':
        lis[0] += 1
    elif s == 'WA':
        lis[1] += 1
    elif s == '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):


def main():
    n = int(input())
    cnt = [0,0,0,0]

    for _ in range(n):
        judge = input()
        if judge == 'AC':
            cnt[0] += 1
        elif judge == 'WA':
            cnt[1] += 1
        elif judge == 'TLE':
            cnt[2] += 1
        elif judge == 'RE':
            cnt[3] += 1

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

if __name__ == '__main__':
    main()

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

result  = [0,0,0,0]

for i in range(n):
    s = input()
    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 " + str(result[0]))
print("WA x " + str(result[1]))
print("TLE x " + str(result[2]))
print("RE x " + str(result[3]))

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

import collections

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):
wa = {}
wa["AC"] = 0
wa["WA"] = 0
wa["TLE"] = 0
wa["RE"] = 0

for _ in range(int(input())):
  st = input()
  wa[st] += 1
  
print("AC x ",wa["AC"])
print("WA x ",wa["WA"])
print("TLE x ",wa["TLE"])
print("RE x ",wa["RE"])

Solution (Python):
def resolve():
    N = int(input())
    ans = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

    for _ in range(N):
        S = str(input())
        ans[S] += 1
    print('AC x', ans['AC'])
    print('WA x', ans['WA'])
    print('TLE x', ans['TLE'])
    print('RE x', ans['RE'])

    return
resolve()

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

ans = [0, 0, 0, 0]
for i in range(n):
    inp = input()
    if inp == "AC":
        ans[0] += 1
    elif inp == "WA":
        ans[1] += 1
    elif inp == "TLE":
        ans[2] += 1
    else:
        ans[3] += 1

code = ["AC", "WA", "TLE", "RE"]
for a, c in zip(ans, code):
    print(c, "x", a)

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 == "AC":
        ac += 1
    if s == "TLE":
        tle += 1
    if s == "WA":
        wa += 1
    if 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):
n = int(input())

L = [0 for i in range(4)]



for i in range(n):
    a = input()
    
    if a == 'AC':
        L[0] += 1
    if a == 'WA':
        L[1] += 1
    if a == 'TLE':
        L[2] += 1
    if a == '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):


import numpy as np


import numpy as np
hairu = int(input())
ac = 0
wa = 0
re = 0
tle = 0

for i in range(hairu):
    s = input()
    if s == "AC":
        ac += 1
    if s == "WA":
        wa += 1
    if s == "RE":
        re += 1
    if s == "TLE":
        tle += 1

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

Solution (Python):
import collections


N = int(input())
S = []
for _ in range(N):
    si = input()
    S.append(si)



c = collections.Counter(S)


ac = c["AC"]
wa = c["WA"]
tle = c["TLE"]
re = c["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())
c=[0 for i in range(4)]
for i in range(n):
  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 ",c[0])
print("WA x ",c[1])
print("TLE x ",c[2])
print("RE x ",c[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
    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(str(input()) for _ in range(N))

result = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for i in S:
    result[i] += 1

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

Solution (Python):
n = int(input())
s = list(input() for _ 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())
cnt_ac = 0
cnt_wa = 0
cnt_tle = 0
cnt_re = 0
for _ in range(n):
    s = input()
    if s == 'AC':
        cnt_ac += 1
    elif s == 'TLE':
        cnt_tle += 1
    elif s == 'WA':
        cnt_wa += 1
    else:
        cnt_re += 1

print('AC x {}'.format(cnt_ac))
print('WA x {}'.format(cnt_wa))
print('TLE x {}'.format(cnt_tle))
print('RE x {}'.format(cnt_re))

Solution (Python):
n=int(input())
s=[]
for i in range(n):
    s.append(input())
a,b,c,d=0,0,0,0
for i in range(n):
    if s[i]=="AC":
        a+=1
    elif s[i]=="WA":
        b+=1
    elif s[i]=="TLE":
        c+=1
    else:
        d+=1
print("AC x "+str(a))
print("WA x "+str(b))
print("TLE x "+str(c))
print("RE x "+str(d))

Solution (Python):
import collections

n = int(input())

s = []
for i in range(n):
  s.append(input())
  
s_colle = collections.Counter(s)

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