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



Sample input:
6
AC
TLE
AC
AC
WA
TLE


Sample output:
AC x 3
WA x 1
TLE x 2
RE x 0

Submission status: Accepted

Solution code:
a = 0
b = 0
c = 0
d = 0
N = int(input())
S = []
for i in range(N):
    S.append(input())
for j in range(N):
  if S[j] == 'AC':
    a += 1
  elif S[j] == 'WA':
    b += 1
  elif S[j] == 'TLE':
    c += 1
  elif S[j] == 'RE':
    d += 1
print('AC x', a)
print('WA x', b)
print('TLE x', c)
print('RE x', d)

Submission status: Accepted

Solution code:
n = int(input())
l = [input() for i in range(n)]
d = {k: 0 for k in ['AC', 'WA', 'TLE', 'RE']}
for s in l:
    d[s] += 1
for s in ['AC', 'WA', 'TLE', 'RE']:
    print('{} x {}'.format(s, d[s]))

Submission status: Accepted

Solution code:
ans = {
  'AC' : 0,
  'WA' : 0,
  'TLE' : 0,
  'RE' : 0
}

for i in range(int(input())):
  ans[input()]+=1
               
for k, v in ans.items():
  print(f'{k} x {v}')

Submission status: Accepted

Solution code:
n=int(input())
l=['AC','WA','TLE','RE']
d=[0,0,0,0]
for i in range(n):
    s=input()
    if(s=='AC'):
        d[0]+=1
    elif(s=='WA'):
        d[1]+=1
    elif(s=='TLE'):
        d[2]+=1
    else:
        d[3]+=1
for i in range(4):
    print(l[i],'x',d[i])

Submission status: Accepted

Solution code:
n = int(input())
Sn = []

for i in range(n):
    Sn.append(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, *s = open(0).read().split()
n = int(n)

c0 = s.count('AC')
c1 = s.count('WA')
c2 = s.count('TLE')
c3 = n - (c0 + c1 + c2)

print('AC x ' + str(c0), 'WA x ' + str(c1), sep='\n')
print('TLE x ' + str(c2), 'RE x ' + str(c3), sep='\n')

Submission status: Accepted

Solution code:
N = int(input().rstrip())

A = []
for i in range(N):
  line = input().rstrip()
  A.append(line)
  
print('AC x', A.count('AC'))
print('WA x', A.count('WA'))
print('TLE x', A.count('TLE'))
print('RE x', A.count('RE'))

Submission status: Accepted

Solution code:
#B - Judge Status Summary

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

for i in range(n):
  l.append(input())

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')))

Submission status: Accepted

Solution code:
from collections import Counter

N = int(input())
s = [input() for _ in range(N)]
c = Counter(s)
print(f'AC x {c["AC"] if c["AC"] else 0}')
print(f'WA x {c["WA"] if c["WA"] else 0}')
print(f'TLE x {c["TLE"] if c["TLE"] else 0}')
print(f'RE x {c["RE"] if c["RE"] else 0}')

Submission status: Accepted

Solution code:
from collections import defaultdict
N = int(input())
cnter = defaultdict(int)
for i in range(N):
  S = input()
  cnter[S] += 1
for ans in ["AC", "WA", "TLE", "RE"]:
  print("{} x {}".format(ans, cnter[ans]))

Submission status: Accepted

Solution code:
n = int(input())
x = list(range(n))
for i in range(n):
  x[i] = input()
c_0 = x.count("AC")
c_1 = x.count("WA")
c_2 = x.count("TLE")
c_3 = x.count("RE")
print("AC x {}".format(c_0))
print("WA x {}".format(c_1))
print("TLE x {}".format(c_2))
print("RE x {}".format(c_3))

Submission status: Accepted

Solution code:
from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(n):
    d[input()] += 1
for v in ['AC', 'WA', 'TLE', 'RE']:
    print(v, 'x', d[v])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 15 17:00:46 2020

@author: saito
"""

# %% import phase

# %% define phase

# %% input phase
N = int(input())
S = [0]*N
for i in range(N):
    S[i] = input()

# %% process phase
C = [0]*4
rslt = ['AC', 'WA', 'TLE', 'RE']
for i in range(4):
    C[i] = S.count(rslt[i])

# %%output phase
for i in range(4):
    print(rslt[i]+' '+'x'+' '+str(C[i]))

Submission status: Accepted

Solution code:
n = int(input())
l = [0, 0, 0, 0]
for _ in range(n):
  s = input()
  if s == 'AC':
    l[0] += 1
  elif s == 'WA':
    l[1] += 1
  elif s == 'TLE':
    l[2] += 1
  else:
    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]))

Submission status: Accepted

Solution code:
n = int(input())

arr = []
for it in range(n):
    arr.append(str(input()))

count_arr = [0] * 4

for i in arr:
    if i == 'AC':
        count_arr[0] += 1
    elif i == 'WA':
        count_arr[1] += 1
    elif i == 'TLE':
        count_arr[2] += 1
    elif i == 'RE':
        count_arr[3] += 1

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

Submission status: Accepted

Solution code:
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 {}'.format(AC))
print('WA x {}'.format(WA))
print('TLE x {}'.format(TLE))
print('RE x {}'.format(RE))

Submission status: Accepted

Solution code:
def abc173b_judge_status_summary():
    n = int(input())
    cnt_dict = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
    for _ in range(n):
        cnt_dict[input()] += 1

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

abc173b_judge_status_summary()

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    result = {
        'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0
    }
    for _ in range(n):
        s = input()
        result[s] += 1

    for key in result.keys():
        print('{} x {}'.format(key, result[key]))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(0, N):
    result = input().strip()
    if result == 'AC':
        ac += 1
    elif result == 'WA':
        wa += 1
    elif result == 'TLE':
        tle += 1
    elif result == 'RE':
        re += 1

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

Submission status: Accepted

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

C = [0]*4

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

print("AC x {}\nWA x {}\nTLE x {}\nRE x {}".format(C[0],C[1],C[2],C[3]))

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')

def solve():
    n = ni()
    d = dict()
    for _ in range(n):
        x = ns()
        d[x] = d.get(x, 0) + 1
    for x in ['AC', 'WA', 'TLE', 'RE']:
        print(x, 'x', d.get(x, 0))
    return

solve()

Submission status: Accepted

Solution code:
n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for _ 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", int(c0))
print("WA x", int(c1))
print("TLE x", int(c2))
print("RE x", int(c3))

Submission status: Accepted

Solution code:
import sys

a = w = t = r = 0
n = int(input())

for _ in range(n):
  s = sys.stdin.readline().strip()
  if s == "AC":
    a += 1
  elif s == "WA":
    w += 1
  elif s == "TLE":
    t += 1
  elif s == "RE":
    r += 1

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

Submission status: Accepted

Solution code:
from collections import Counter

n = int(input())
arr = []
for _ in range(n):
    arr.append(input())
cnt=Counter(arr)
print("AC x",cnt["AC"])
print("WA x",cnt["WA"])
print("TLE x",cnt["TLE"])
print("RE x",cnt["RE"])

Submission status: Accepted

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

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

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

print(f"AC x {d['AC']}\nWA x {d['WA']}\nTLE x {d['TLE']}\nRE x {d['RE']}")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n=int(readline())
s=read().rstrip().decode().split()
c=collections.Counter(s)
for x in ["AC","WA","TLE","RE"]:
    n=c[x]
    print("{} x {}".format(x, n))

Submission status: Accepted

Solution code:
import collections
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n=int(readline())
s=read().rstrip().decode().split()
c=collections.Counter(s)
print("AC x " + str(c["AC"]))
print("WA x " + str(c["WA"]))
print("TLE x " + str(c["TLE"]))
print("RE x " + str(c["RE"]))

Submission status: Accepted

Solution code:
import collections
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
n=int(readline())
s=read().decode().splitlines()
c=collections.Counter(s)
print("AC x " + str(c["AC"]))
print("WA x " + str(c["WA"]))
print("TLE x " + str(c["TLE"]))
print("RE x " + str(c["RE"]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
n=int(input())
s=[None]*n
for i in range(n):
    s[i]=input()
c=collections.Counter(s)
print("AC x " + str(c["AC"]))
print("WA x " + str(c["WA"]))
print("TLE x " + str(c["TLE"]))
print("RE x " + str(c["RE"]))

Submission status: Accepted

Solution code:
# Judge Status Summary
N = int(input())
ans = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for _ in range(N):
    s = input()
    ans[s] += 1
for k,v in ans.items():
    print(k + ' x ' + str(v))

Submission status: Accepted

Solution code:
verdict = input()
list1 = []
list2 = ["AC", "WA", "TLE", "RE"]

for i in range(0, int(verdict)):
    x = input()
    list1.append(x)

for x in list2:
    print(f"{x} x {list1.count(x)}")

Submission status: Accepted

Solution code:
"""B - Judge Status Summary"""
N = int(input())
ac, wa, tle, re = 0, 0, 0, 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))

Submission status: Accepted

Solution code:
import sys
n = int(input())
result = ['']*n
dic = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(n):
    result[i] = sys.stdin.readline().replace('\n', '')
    dic[result[i]] += 1

for key in dic:
    print(key, ' x ', dic[key], sep='')

Submission status: Accepted

Solution code:
n = int(input())
case = ["AC", "WA", "TLE", "RE"]
ac=0;wa=0;tle=0;re=0;
ss = []
for _ in range(n):
        ss.append(input())
for i in ss:
    if i == "AC":
        ac += 1
    elif i == "WA":
        wa += 1
    elif i == "TLE":
        tle += 1
    else:
        re += 1
print(f"{case[0]} x {ac}")
print(f"{case[1]} x {wa}")
print(f"{case[2]} x {tle}")
print(f"{case[3]} x {re}")

Submission status: Accepted

Solution code:
n = int(input())

n_ac = 0
n_wa = 0
n_tle = 0
n_re = 0

for i in range(n):
    x = input()
    if x == "AC":
        n_ac += 1
    elif x == "WA":
        n_wa += 1
    elif x == "TLE":
        n_tle += 1
    elif x == "RE":
        n_re += 1


print(
    "AC x " + str(n_ac) + "\n"
    + "WA x " + str(n_wa) + "\n"
    + "TLE x " + str(n_tle) + "\n"
    + "RE x " + str(n_re)
)

Submission status: Accepted

Solution code:
N = int(input())
Ns = []
for i in range(N):
    Ns.append(input())
#Ns = ["AC", "TLE"]

a = [0, 0, 0, 0]
for n in Ns:
    if n == "AC":
        a[0] += 1
    if n == "WA":
        a[1] += 1
    if n == "TLE":
        a[2] += 1
    if n == "RE":
        a[3] += 1

ss = ["AC", "WA", "TLE", "RE"]
for i in range(4):
    print("%s x %d" % (ss[i], a[i]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

cnt_AC = 0
cnt_WA = 0
cnt_TLE = 0
cnt_RE = 0

for _ in range(n) : 
    result = input()
    if result == "AC" : 
        cnt_AC += 1
    elif result == "WA" : 
        cnt_WA += 1
    elif result == "TLE" : 
        cnt_TLE += 1
    elif result == "RE" : 
        cnt_RE += 1
        
print("AC x", cnt_AC)
print("WA x", cnt_WA)
print("TLE x", cnt_TLE)
print("RE x", cnt_RE)

Submission status: Accepted

Solution code:
N=int(input())
S=[]
for n in range(N):
    S.append( input() )
AC, WA, TLE, RE = 0, 0, 0, 0
for n in range(N):
    if S[n]=='AC':
        AC += 1
    elif S[n]=='WA':
        WA += 1
    elif S[n]=='TLE':
        TLE += 1
    elif S[n]=='RE':
        RE += 1
print('AC x %d' % AC)
print('WA x %d' % WA)
print('TLE x %d' % TLE)
print('RE x %d' % RE)

Submission status: Accepted

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

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


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

Submission status: Accepted

Solution code:
_,*a=open(0);[print(x,"x",a.count(x+"\n"))for x in["AC","WA","TLE","RE"]]

Submission status: Accepted

Solution code:
N = int(input())
Si = a = [input() for i in range(N)]
print("AC x " + str(Si.count("AC")))
print("WA x " + str(Si.count("WA")))
print("TLE x " + str(Si.count("TLE")))
print("RE x " + str(Si.count("RE")))

Submission status: Accepted

Solution code:
n = int(input())

r = []

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
  else:
    re += 1

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

Submission status: Accepted

Solution code:
N=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(N):
    c=input()
    if(c=='AC'):
        AC+=1
    elif(c=='WA'):
        WA+=1
    elif(c=='TLE'):
        TLE+=1
    else:
        RE+=1

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

Submission status: Accepted

Solution code:
N = int(input())
AC, WA, TLE, RE = 0, 0, 0, 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 {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))

Submission status: Accepted

Solution code:
a,b,c,d=0,0,0,0
for i in range(int(input())):
  s=input()
  if s=="AC":
    a+=1
  elif s=="WA":
    b+=1
  elif s=="TLE":
    c+=1
  else:
    d+=1
print("AC x",a,"\nWA x",b,"\nTLE x",c,"\nRE x",d)

Submission status: Accepted

Solution code:
n = int(input())
a = 0
w = 0
t = 0
r = 0
i = 1
while i <= n:
  s_i = input()
  if s_i == "AC":
    a += 1
  elif s_i == "WA":
    w += 1
  elif s_i == "TLE":
    t += 1
  else:
    r += 1
  i += 1
print("AC x "+str(a))
print("WA x "+str(w))
print("TLE x "+str(t))
print("RE x "+str(r))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
C_0 = 0
C_1 = 0
C_2 = 0
C_3 = 0  
N = int(input())
for result in range(N) :
	result = input()
	if result == 'AC':
		C_0 += 1
	elif result == 'WA':
		C_1 += 1
	elif result == 'TLE':
		C_2 += 1
	elif result == 'RE':
		C_3 += 1

print('AC x',C_0)
print('WA x',C_1)
print('TLE x',C_2)      
print('RE x',C_3)

Submission status: Accepted

Solution code:
r = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(int(input())):
    r[input()] += 1
else:
    for key in r.keys():
        print(f"{key} x {r[key]}")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

for i in range(N):
  data[input()] += 1
 
for x in data.keys():
  print('{} x {}'.format(x,data[x]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    N = int(input())
    d = defaultdict(int)
    for _ in range(N):
        S = input()
        d[S] += 1

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


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
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(f"AC x {ac}")
print(f"WA x {wa}")
print(f"TLE x {tle}")
print(f"RE x {re}")

Submission status: Accepted

Solution code:
n=int(input())
c1=c2=c3=c4=0
for i in range(n):
 x=input()
 if x=="AC":
  c1+=1
 elif x=="WA":
  c2+=1
 elif x=="TLE":
  c3+=1
 elif x=="RE":
  c4+=1
print("AC x "+str(c1))
print("WA x "+str(c2))
print("TLE x "+str(c3))
print("RE x "+str(c4))

Submission status: Accepted

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

c = [s.count("AC"),s.count("WA"),s.count("TLE"),s.count("RE")]

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

Submission status: Accepted

Solution code:
c=open(0).read().count
for s in'AC','WA','TLE','RE':print(s, 'x',c(s))

Submission status: Accepted

Solution code:
a = int(input())
b = [input() for i in range(a)]
c =["AC", "WA", "TLE", "RE"]
for i in c:
  print(i+str(" x ")+str(b.count(i)))

Submission status: Accepted

Solution code:
#listの要素をキー、その出現数を値として持つディクショナリを返す
def count(list):
    dict = {}
    for i in range(len(list)):
        dict[list[i]] = dict.get(list[i], 0) + 1
    return dict
#dictのキーと値を一行ずつ出力
def output_dict_with_value(dict, sentence = None):
    if sentence != None:
        print(str(sentence))
    lst =  ["AC", "WA", "TLE", "RE"]
    for i in lst:
      if i in dict:
        print(i + " x " + str(dict[i]))
      else:
        print(i + " x 0")
times = int(input())
lst = []
for i in range(times):
  lst.append(input())
dict = count(lst)
output_dict_with_value(dict)

Submission status: Accepted

Solution code:
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(f'AC x {AC}')
print(f'WA x {WA}')
print(f'TLE x {TLE}')
print(f'RE x {RE}')

Submission status: Accepted

Solution code:
N=int(input())

list=[]
ac=0
wa=0
re=0
tlc=0

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

for i in range(N):
 if list[i]=="AC":
  ac+=1
 elif list[i]=="WA":
  wa+=1
 elif list[i]=="RE":
  re+=1
 else:
  tlc+=1

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

Submission status: Accepted

Solution code:
l = int(input())
n = []
for i in range(l):
  n.append(input())
ac = 0
wa = 0
tle = 0
re =0
for i in n:
  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))

Submission status: Accepted

Solution code:
n = int(input())

a = 0
w = 0
t = 0
r = 0

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

Submission status: Accepted

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

def kind(a):
  b=dic.get(a)
  if b!=None:
    return(b)
  else:
    return(0)

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

Submission status: Accepted

Solution code:
from collections import Counter
n=int(input())
lst=[]
for i in range(n):
    lst.append(input())
dct=Counter(lst)
try:
    print("AC x",dct["AC"])
except:
    print("AC x 0")

try:
    print("WA x",dct["WA"])
except:
    print("WA x 0")

try:
    print("TLE x",dct["TLE"])
except:
    print("TLE x 0")

try:
    print("RE x",dct["RE"])
except:
    print("RE x 0")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

count = [0, 0, 0, 0]
char = ["AC", "WA", "TLE", "RE"]
for i in range(N):
    get = input()

    for j in range(4):
        if get == char[j]:
            count[j] += 1

for k in range(4):
    print(char[k] + " x " + str(count[k]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AC=0
WA=0
TLE=0
RE=0
N=int(input())
for i in range(N):
  y=input()
  if y=="AC":
    AC+=1
  if y=="WA":
    WA+=1
  if y=="TLE":
    TLE+=1
  if y=="RE":
    RE+=1
print("AC x "+str(AC))
print("WA x "+str(WA))
print("TLE x "+str(TLE))
print("RE x "+str(RE))

Submission status: Accepted

Solution code:
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
	else:
		d+=1
print("AC x "+str(a))
print("WA x "+str(b))
print("TLE x "+str(c))
print("RE x "+str(d))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
 
def I(): return int(input())
def S(): return str(input())
def MI(): return map(str, input().split("\n"))
def LI(): return list(map(str, input().split()))

N = I()
c0 = c1 = c2 = c3 = 0
for i in range(N):
  
  ans = S().rstrip('\n')
  if ans == "AC":
    c0 += 1
  elif ans == "WA":
    c1 += 1
  elif ans == "TLE":
    c2 += 1
  elif ans == "RE":
    c3 += 1

print(f"AC x {c0}\nWA x {c1}\nTLE x {c2}\nRE x {c3}\n")

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
n = int(input())
c1 = 0
c2 = 0
c3 = 0
c4 = 0
for i in range(n):
    verd = input()
    if verd == "AC":
        c1 += 1
    elif verd == "WA":
        c2 += 1
    elif verd == "TLE":
        c3 += 1
    else:
        c4 += 1
print("AC x " + str(c1))
print("WA x " + str(c2))
print("TLE x " + str(c3))
print("RE x " + str(c4))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
Ans = [0] * 4

for i in range(1,N+1):
  st = str(input())
  if st == 'AC':
    Ans[0] += 1
  elif st == 'WA':
    Ans[1] += 1
  elif st == 'TLE':
    Ans[2] += 1
  elif st == 'RE':
    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]))

Submission status: Accepted

Solution code:
import sys
N = int(input())

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

for _ in range(N):
    S = input()
    if S in dict:
        i = dict.get(S)
        i += 1
        dict[S] = i

for key in dict.keys():
    print(key, 'x', dict.get(key))

Submission status: Accepted

Solution code:
n = int(input())
c0,c1,c2,c3 = 0,0,0,0
for i in range(n):
  ch = str(input())
  if ch == 'AC':
    c0 += 1
  elif ch == 'WA':
    c1 += 1
  elif ch == 'TLE':
    c2 += 1
  elif ch == 'RE':
    c3 += 1
print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(c0,c1,c2,c3))

Submission status: Accepted

Solution code:
A = int(input())
list1 = []
for i in range(A):
  a = input()
  list1.append(a)
b =list1.count('AC')
c =list1.count('TLE')
d =list1.count('RE')
e =list1.count('WA')
print('AC x '+ str(b))
print('WA x '+ str(e))
print('TLE x '+str(c))
print('RE x '+str(d))

Submission status: Accepted

Solution code:
#B - Judge Status Summary
S = []
N = int(input())
for i in range(N):
    Si = str(input())
    S.append(Si)
C0 = S.count('AC')
C1 = S.count('WA')
C2 = S.count('TLE')
C3 = S.count('RE')

# 出力
print("AC x",C0)
print("WA x",C1)
print("TLE x",C2)
print("RE x",C3)

Submission status: Accepted

Solution code:
N = int(input())
S = list()
for i in range(N):
    S.append(input())

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
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)))

Submission status: Accepted

Solution code:
N = int(input())

r = {}

for i in range(N):
  x = input()
  r[x] = r.get(x,0) +1

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

Submission status: Accepted

Solution code:
n = int(input())
ans = [0 for i in range(4)]
sList = []
for i in range(n):
    sList.append(input())

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

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