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())
A = list(input() for _ in range(N))

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

Solution (Python):
N = int(input())
con = 0
list_s = []

while True:
  con = con + 1
  s = input()
  list_s.append(s)
  if con == N:
    break

ac = list_s.count('AC')
wa = list_s.count('WA')
tle = list_s.count('TLE')
re = list_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):
N = int(input())
AC, WA, TLE, RE = 0, 0, 0, 0

for i in range(N):
  type = input()
  if type == "AC":
    AC += 1
    continue
  if type == "WA":
    WA += 1
    continue
  if type == "TLE":
    TLE += 1
    continue
  if type == "RE":
    RE += 1
    continue
print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))

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

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

n = int(input())

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

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

Solution (Python):

N = int(input())
count_ac = 0
count_wa = 0
count_tle = 0
count_re = 0
for i in range(N):
    S = input()
    if S == "AC":
        count_ac += 1
    if S == "WA":
        count_wa += 1
    if S == "TLE":
        count_tle += 1
    if S == "RE":
        count_re += 1
    del S

print("AC x ",count_ac)
print("WA x ",count_wa)
print("TLE x ",count_tle)
print("RE x ",count_re)

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


AC = str(s.count('AC'))
WA = str(s.count('WA'))
TLE = str(s.count('TLE'))
RE = str(s.count('RE'))

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

Solution (Python):
N=int(input())
S=[input() for i in range(N)]
C0=str(S.count("AC"))
C1=str(S.count("WA"))
C2=str(S.count("TLE"))
C3=str(S.count("RE"))
print("AC x "+C0)
print("WA x "+C1)
print("TLE x "+C2)
print("RE x "+C3)

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 main():
    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
        else:
            Er += 1
    print('AC x', AC)
    print('WA x', WA)
    print('TLE x', TLE)
    print('RE x', RE)
main()

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())
st = [input() for i in range(n)]
print('AC x ' + str(st.count("AC")))
print('WA x ' + str(st.count("WA")))
print('TLE x ' + str(st.count("TLE")))
print('RE x ' + str(st.count("RE")))

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

Solution (Python):
kaisuu = input()
result = list()

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

for i in range(int(kaisuu)):
    result.append(input())

for i in range(int(kaisuu)):
    if result[i] == "AC":
        suu[0] += 1
    if result[i] == "WA":
        suu[1] += 1
    if result[i] == "TLE":
        suu[2] += 1
    if result[i] == "RE":
        suu[3] += 1

for i in range(4):
    print (judge[i],"x",suu[i])

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

AC_count = 0
WA_count = 0
TLE_count = 0
RE_count = 0

S = []
for i in range(N):
    S.append(input())
    if S[i] == 'AC':
        AC_count += 1
    elif S[i] == 'WA':
        WA_count += 1
    elif S[i] == 'TLE':
        TLE_count += 1
    elif S[i] == 'RE':
        RE_count += 1

print('AC x ' + str(AC_count))
print('WA x ' + str(WA_count))
print('TLE x ' + str(TLE_count))
print('RE x ' + str(RE_count))

Solution (Python):
n = input()
n = int(n)
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    wk = input()
    if wk == "AC":
        ac +=1
    elif wk == "WA":
        wa += 1
    elif wk == "TLE":
        tle += 1
    else :
        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())
a = 0
w = 0
t = 0
r = 0
for i in range(N):
  S=input();
  if S[0] == "A":
    a+=1
  elif S[0] == "W":
    w+=1
  elif S[0] == "T":
    t+=1
  else:
    r+=1
print("AC x",a)
print("WA x",w)
print("TLE x",t)
print("RE x",r)

Solution (Python):
n = int(input())
case = []
result = ["AC","WA","TLE","RE"]
for num in range(n):
  case.append(input())
for num in range(4):
  print("{} x {}".format(result[num],case.count(result[num])))

Solution (Python):
list_num = int(input())
word_list= []
for i in range(list_num):
    word_list.append(input())
    
ac = word_list.count('AC')
wa = word_list.count('WA')
tle = word_list.count('TLE')
re = word_list.count('RE')

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

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

ACcount = 0
WAcount = 0
TLEcount = 0
REcount = 0

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

for x in range(len(S)):
    if S[x] == ['A', 'C']:
        ACcount += 1
    elif S[x] == ['W','A']:
        WAcount += 1
    elif S[x] == ['T','L','E']:
        TLEcount += 1
    elif S[x] == ['R','E']:
        REcount += 1

print("AC x " + str(ACcount))
print("WA x " + str(WAcount))
print("TLE x " + str(TLEcount))
print("RE x " + str(REcount))

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

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

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 i in range(N)]

s = Counter(S)

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

Solution (Python):
from collections import Counter
l=[]
for _ in range(int(input())):
    l.append(input())
d=Counter(l)
print("AC x",d['AC'])
print("WA x",d['WA'])
print("TLE x",d['TLE'])
print("RE x",d['RE'])

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

for i in sys.stdin:
    S.append(i.replace("\n",""))

AC = []
WA = []
TLE = []
RE = []

S.sort()
P = [AC,TLE,RE,WA]

for i in S:
    if i == "AC":
        AC.append(0)
    elif i == "WA":
        WA.append(0)
    elif i == "TLE":
        TLE.append(0)
    else:
        RE.append(0)    
print("AC x ",len(AC))
print("WA x ",len(WA))
print("TLE x ",len(TLE))
print("RE x ",len(RE))

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy


if __name__ == "__main__":
    n = int(input())
    s = [input() for i in range(n)]
    c  = ["AC","WA","TLE","RE"]
    cnt = [0]*4
    for i in s:
        if i == "AC":
            cnt[0]+=1
        elif i == "WA":
            cnt[1]+=1
        elif i == "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):
list = []
words = ['AC','WA','TLE','RE']
words_count = {'AC':0,'WA':0,'TLE':0,'RE':0}
    
try:
    while True:
      val = input()
      if val:
        list.append(val)
      else:
        break
except EOFError:
    pass

for i in range(1,len(list)):
  for word in words:
    if list[i] == word:
      words_count[word] += 1

for k,v in words_count.items():
  print("{key} x {value}".format(key = k,value= v))

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
ac = []
wa =[]
tle = []
re = []
for i in range(n):
    if s[i] == 'AC':
        ac.append(s[i])
    elif s[i] == 'WA':
        wa.append(s[i])
    elif s[i] == 'TLE':
        tle.append(s[i])
    else:
        re.append(s[i])
print(f'AC x {len(ac)}')
print(f'WA x {len(wa)}')
print(f'TLE x {len(tle)}')
print(f'RE x {len(re)}')

Solution (Python):
n=int(input())
a,b,c,d=0,0,0,0
for _ in range(n):
    n=input()
    if n=="AC":
        a+=1
    elif n=="WA":
        b+=1
    elif n=="TLE":
        c+=1
    else:
       d+=1
print("AC x" ,a)
print("WA x",b)
print("TLE x",c)
print("RE x",d)

Solution (Python):
n=int(input())
l=[]
keys=['AC','WA','TLE','RE']
for i in range(n):
  x=(input())
  l.append(x)
s=dict.fromkeys(keys, 0)
for i in l:
  if i in s:
    s[i]+=1
for k,v in s.items():
  print(k,"x",v)

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())
    
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_list = []
WA_list = []
TLE_list = []
RE_list = []

for _ in range(N) :
    S = str(input())
    if S == 'AC' :
        AC_list.append(S)
    elif S == 'WA' :
        WA_list.append(S)
    elif S == 'TLE' :
        TLE_list.append(S)
    elif S == 'RE' :
        RE_list.append(S)

print('AC x ' + str(len(AC_list)))
print('WA x ' + str(len(WA_list)))
print('TLE x ' + str(len(TLE_list)))
print('RE x ' + str(len(RE_list)))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]
a = 0
w = 0
t = 0
r = 0
for i in range(n):
    if s[i]  == "AC":
        a += 1
    elif s[i] == "WA":
        w += 1
    elif s[i] == "TLE":
        t += 1
    else:
        r += 1
print("AC x",str(a))
print("WA x",str(w))
print("TLE x",str(t))
print("RE x",str(r))

Solution (Python):
import sys






def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))



from collections import defaultdict

def main():
	n=II()
	d=defaultdict(int)
	for _ in range(n):
		d[input()]+=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"]))






if __name__ == "__main__":
	main()

Solution (Python):

n = int(input())

a,b,c,d = 0,0,0,0
for _ in range(n):
    t = input()
    if t=='AC':
        a += 1
    elif t=='WA':
        b += 1
    elif t=='TLE':
        c += 1
    elif t=='RE':
        d += 1

print('AC x {}'.format(a))
print('WA x {}'.format(b))
print('TLE x {}'.format(c))
print('RE x {}'.format(d))

Solution (Python):
n = int(input())
sum = [0,0,0,0]
for i in range(n):
  x = input()
  if x == 'AC':
      sum[0]+=1
  elif x == 'WA':
      sum[1]+=1
  elif x == 'TLE':
      sum[2]+=1
  elif x== 'RE':
      sum[3]+=1
print('AC x '+str(sum[0]))
print('WA x '+str(sum[1]))
print('TLE x '+str(sum[2]))
print('RE x '+str(sum[3]))

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
AC = 0
WA = 0
TLE = 0
RE = 0
for t in s:
    if (t == 'AC'):
        AC += 1
    elif (t == 'WA'):
        WA += 1
    elif (t == 'TLE'):
        TLE += 1
    else:
        RE += 1

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

Solution (Python):
n=int(input())
c0=0
c1=0
c2=0
c3=0
while(n>0):
    s=input()
    if(s=="AC"):
        c0+=1
    elif(s=="WA"):
        c1+=1
    elif(s=="TLE"):
        c2+=1
    elif(s=="RE"):
        c3+=1
    n=n-1
print("AC x",c0)
print("WA x",c1)
print("TLE x",c2)
print("RE x",c3)

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

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

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


for a in dic.keys():
    dic[a]=s.count(a)


for a,b in dic.items():
    print(str(a)+" x "+str(b))

Solution (Python):




import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)


def 関数(n):
    ac = 0
    wa = 0
    tle = 0
    re = 0

    for i in range(n):
        keesu = sys.stdin.readline().rstrip()
        if keesu == "AC": 
            ac += 1
        elif keesu == "WA":
            wa += 1
        elif keesu == "TLE":
            tle += 1
        elif keesu == "RE":
            re += 1
        else:
            print("Erreur: ", keesu)

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

def çözmek():
 
    N = int(input())

    関数(N)

if __name__ == "__main__":
    çözmek()

Solution (Python):
N = int(input())
S = []
for i in range(N):
    S.append(str(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):
N = int(input())
memo = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

for _ in range(N):
  memo[input()] += 1
  
for k, v in memo.items():
  print('{k} x {v}'.format(k=k, v=v))

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

d = 0
e = 0
r = 0
f = 0

for i in range(N):
    a = str(input())
    if a == 'AC':
        d +=1
    elif a == 'WA':
        e += 1
    elif a == 'TLE':
        r += 1
    else:
        f += 1
        
print("AC x " +str(d))
print("WA x " + str(e))
print("TLE x " + str(r))
print("RE x " + str(f))

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


check_list = ['AC', 'WA', 'TLE', 'RE']
count_list = [0, 0, 0, 0]

for i in range(N):
    flag = 0
    S = input()
    while flag<4:
        if S==check_list[flag]:
            count_list[flag] += 1
            break;
        else:
            flag += 1

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

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 k, v in C.items():
    print("{} x {}".format(k, v))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
a=S.count('AC')
b=S.count('WA')
c=S.count('TLE')
d=S.count('RE')
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())

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())
ac = 0
tle = 0
wa = 0
re = 0
for _ in range(n):
    user = input()
    if user == "AC":
        ac += 1
    elif user == "TLE":
        tle += 1
    elif user == "WA":
        wa += 1
    else:
        re += 1
print("AC x {} \nWA x {} \nTLE x {} \nRE x {}".format(ac, wa, tle, re))

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

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

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=0
wa=0
tle=0
re=0
for i in range(n):
  a = input()
  if a == 'AC':
    ac=ac+1
  elif a == 'WA':
    wa=wa+1
  elif a == 'TLE':
    tle=tle+1
  elif a == 'RE':
    re = re + 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())
s = []
for i in range(n):
    s.append(str(input()))

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

for i in range(n):
 
    if str(s[i]) == 'AC': 
        ac += 1
    if str(s[i]) == 'WA': 
        wa += 1
    if str(s[i]) == 'TLE': 
        tle += 1
    if str(s[i]) == 'RE': 
        re += 1
    
print('AC x ',ac)
print('WA x ',wa)
print('TLE x ',tle)
print('RE x ',re)

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

a = [input() for i in range(M)]

AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(M):
    if(a[i] == 'AC'):
        AC+=1
    elif(a[i] == 'WA'):
        WA+=1
    elif(a[i] == 'TLE'):
        TLE+=1
    elif(a[i] == 'RE'):
        RE+=1

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

Solution (Python):
nn = int(input())
ss = [input() for _ in range(nn)]

from collections import Counter

cc = Counter(ss)

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

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

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

for i in s:
    if i == "AC":
        AC += 1
    elif i == "WA":
        WA += 1
    elif i == "TLE":
        TLE += 1
    else:
        RE += 1
print("AC x " + str(AC))
print("WA x " + str(WA))
print("TLE x " + str(TLE))
print("RE x " + str(RE))

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

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

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

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

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

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

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

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

Solution (Python):
N = int(input())
a=[]
ca =0
cb =0
cc =0
cd=0
for i in range(N):
  a.append(input())
ca = a.count('AC')
cb = a.count('WA')
cc = a.count('TLE')
cd = a.count('RE')
print('AC','x',ca)
print('WA','x',cb)
print('TLE','x',cc)
print('RE','x',cd)

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

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

l=[]

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

for key, value in dic.items():
    print(f"{key} x {value}")

Solution (Python):
from collections import Counter

def main():
    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
        elif i == 'RE':
            re += 1
    print('AC x ', ac, sep='')
    print('WA x ', wa, sep='')
    print('TLE x ', tle, sep='')
    print('RE x ', re, sep='')

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
l = []
for i in range(N):
    l.append(input())
AC = l.count('AC')
WA = l.count('WA')
TLE = l.count('TLE')
RE = l.count('RE')
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)]
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
    elif s[i] == "RE":
        re += 1
    else:
        pass
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):
  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 " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

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

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

Solution (Python):
N = int(input())
S = [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):
d = {"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(int(input())):
  s = input()
  d[s] += 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())
test = []
for i in range(n):
    test.append(input())
print('AC x ' + str(test.count('AC')))
print('WA x ' + str(test.count('WA')))
print('TLE x ' + str(test.count('TLE')))
print('RE x ' + str(test.count('RE')))

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

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

print('AC x {0}'.format(ans.count('AC')))
print('WA x {0}'.format(ans.count('WA')))
print('TLE x {0}'.format(ans.count('TLE')))
print('RE x {0}'.format(ans.count('RE')))

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

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

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

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

Solution (Python):
t = int(input())
d = dict()
d['TLE'] = 0
d['AC'] = 0
d['WA'] = 0
d['RE'] = 0
while t > 0:
    s = input()
    if s == 'TLE':
        d['TLE'] += 1
    elif s == 'WA':
        d['WA'] += 1
    elif s == 'RE':
        d['RE'] += 1
    elif s == 'AC':
        d['AC'] += 1
    t-=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())
S = list()
AC = 0
WA = 0
TLE = 0
RE = 0
for x in range(0,N):
	S.append(input())

for lisss in S:
	if lisss=='AC':
		AC+=1
	elif lisss == 'WA':
		WA+=1
	elif lisss == 'TLE':
		TLE+=1
	elif lisss == 'RE':
		RE+=1

print('AC x %d \n' % AC)
print('WA x %d \n' % WA)
print('TLE x %d \n' % TLE)
print('RE x %d \n' % RE)

Solution (Python):
N = int(input())
list = []
for i in range(N):
    list.append(input())
C0 = 0
C1 = 0
C2 = 0
C3 = 0
for i in range(N):
    if list[i] == "AC":
        C0 += 1
    elif list[i] == "WA":
        C1 += 1
    elif list[i] == "TLE":
        C2 += 1
    elif list[i] == "RE":
        C3 += 1
        
print("AC x",C0)
print("WA x", C1)
print("TLE x", C2)
print("RE x", C3)

Solution (Python):
import collections

n = int(input())
s = [input() for _ in range(n)]
c = collections.Counter(s)

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

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

AC_num = 0
WA_num = 0
TLE_num = 0
RE_num = 0

for num in range(N):
  if a[num] == 'AC':
    AC_num += 1
  elif a[num] == 'WA':
    WA_num += 1
  elif a[num] == 'TLE':
    TLE_num += 1
  else:
    RE_num += 1

print('AC x ',AC_num)
print('WA x ',WA_num)
print('TLE x ',TLE_num)
print('RE x ',RE_num)

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

Solution (Python):
import collections
N = int(input())
S = [input() for i in range(N)]
c = collections.Counter(S)
print("AC","x",(c["AC"]))
print("WA","x",(c["WA"]))
print("TLE","x",(c["TLE"]))
print("RE","x",(c["RE"]))

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

for i in Result:
    print(i, 'x', S.count(i))

Solution (Python):
n=int(input())
a=[]
for i in range(0,n):
    t=input()
    a.append(t)
print(f"AC x {a.count('AC')}")
print(f"WA x {a.count('WA')}")
print(f"TLE x {a.count('TLE')}")
print(f"RE x {a.count('RE')}")

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

Solution (Python):
from collections import *






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())
s_li = [input() for x in range(n)]

num_AC = s_li.count("AC")
num_WA = s_li.count("WA")
num_TLE = s_li.count("TLE")
num_RE = s_li.count("RE")

print("AC x "+str(num_AC))
print("WA x "+str(num_WA))
print("TLE x "+str(num_TLE))
print("RE x "+str(num_RE))

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

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

for j in range(N):
    if S[j] == 'AC':
        cnt_ac += 1
    elif S[j] == 'WA':
        cnt_wa += 1
    elif S[j] == 'TLE':
        cnt_tle += 1
    else:
        cnt_re += 1

print('AC x ' + str(cnt_ac))
print('WA x ' + str(cnt_wa))
print('TLE x ' + str(cnt_tle))
print('RE x ' + str(cnt_re))

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

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

for i in range(len(S)):
    D[S[i]] += 1

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

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

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

acn = 0
wan = 0
tlen = 0
ren = 0

for a in lst:
    if a == 'AC':
        acn += 1
    elif a == 'WA':
        wan += 1
    elif a == 'TLE':
        tlen += 1
    elif a == 'RE':
        ren += 1
    else:
        continue

print('AC x ' + str(acn))
print('WA x ' + str(wan))
print('TLE x ' + str(tlen))
print('RE x ' + str(ren))

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

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

for k in ['AC', 'WA', 'TLE', 'RE']:
    print(k + ' x ' + str(ans[k]))

Solution (Python):
N=int(input())
S=''
for _ in range(N):
  S+=input()
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')}")

Solution (Python):
N = int(input())
n = [input() for i in range(N)]
count_AC = 0
count_WA = 0
count_TLE = 0
count_RE = 0
for i in n:
    if i == 'AC':
        count_AC += 1
    elif i == 'WA':
        count_WA += 1
    elif i == 'TLE':
        count_TLE += 1
    elif i == 'RE':
        count_RE += 1
print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}'.format(count_AC, count_WA, count_TLE, count_RE))

Solution (Python):
n = int(input())
cnt = [0, 0, 0, 0]
for n in range(n):
	s = input()
	if (s == 'AC'):
		cnt[0] += 1
	if (s == 'WA'):
		cnt[1] += 1
	if (s == 'TLE'):
		cnt[2] += 1
	if (s == 'RE'):
		cnt[3] += 1
print('AC x', cnt[0])
print('WA x', cnt[1])
print('TLE x', cnt[2])
print('RE x', cnt[3])

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

Solution (Python):
import collections

import sys
a = []
for l in sys.stdin:
    a.append(l.rstrip('\n'))
cc = collections.Counter(a)
print("AC x {}".format(cc["AC"]))
print("WA x {}".format(cc["WA"]))
print("TLE x {}".format(cc["TLE"]))
print("RE x {}".format(cc["RE"]))

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
    if s == "WA":
        c1 += 1
    if s == "TLE":
        c2 += 1
    if s == "RE":
        c3 += 1
print("AC x " + str(c0), "WA x " + str(c1), "TLE x " + str(c2), "RE x " + str(c3), sep="\n")

Solution (Python):
import sys
import collections

def resolve(in_, out):
    n = int(next(in_))
    c = collections.Counter(s.strip() for s in in_)
    print('AC x {}'.format(c.get(b'AC', 0)), file=out)
    print('WA x {}'.format(c.get(b'WA', 0)), file=out)
    print('TLE x {}'.format(c.get(b'TLE', 0)), file=out)
    print('RE x {}'.format(c.get(b'RE', 0)), file=out)


def main():
    resolve(sys.stdin.buffer, sys.stdout)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
print(f"AC x {s.count('AC')}\nWA x {s.count('WA')}\nTLE x {s.count('TLE')}\nRE x {s.count('RE')}")