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:
N = int(input())
c0 = c1 = c2 = c3 = 0

for i in range(N):
  judge = input()
  if judge == "AC":
    c0 += 1
  elif judge == "WA":
    c1 += 1
  elif judge == "TLE":
    c2 += 1
  else:
    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:
a,b,c,d = 0,0,0,0
for N in range(int(input())):
    s = input()
    if s == 'AC':
        a+=1
    if s == 'WA':
        b+=1
    if s == 'TLE':
        c+=1
    if s == 'RE':
        d+=1
print("AC x",a)
print("WA x",b)
print("TLE x",c)
print("RE x",d)

Submission status: Accepted

Solution code:
def main():
    import sys
    readline = sys.stdin.buffer.readline
    sys.setrecursionlimit(10 ** 7)

    from collections import Counter

    n = int(readline())
    s = [readline().rstrip().decode() for _ in range(n)]
    counter = Counter(s)
    print('AC x {}'.format(counter['AC']))
    print('WA x {}'.format(counter['WA']))
    print('TLE x {}'.format(counter['TLE']))
    print('RE x {}'.format(counter['RE']))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def judge_status_summary():
    # 入力
    N = int(input())
    S = [input() for _ in range(N)]
    # 判別処理 
    # リスト初期化
    result_list = ['AC', 'WA', 'TLE', 'RE']
    count_list = [0, 0, 0, 0]
    # 集計
    for i in range(N):
        one_count_up_inxex = result_list.index(S[i])
        count_list[one_count_up_inxex] += 1
    # 表示
    for i in range(4):
        print(result_list[i], 'x', count_list[i])

judge_status_summary()

Submission status: Accepted

Solution code:
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
from collections import deque  # 双方向キュー
from collections import defaultdict  # 初期化済み辞書
from heapq import heapify, heappush, heappop, heappushpop  # プライオリティキュー
from bisect import bisect_left, bisect_right  # 二分探索
sys.setrecursionlimit(int(1e+6))
MOD = int(1e+9) + 7
#import numpy as np  # 1.8.2
#import scipy  # 0.13.3

def main():
    N = i2n()
    keys = ['AC', 'WA', 'TLE', 'RE']
    d = {}
    for k in keys:
        d[k] = 0
    for _ in range(N):
        s = i2s()
        d[s] += 1
    for k in keys:
        print('%s x %d' % (k, d[k]))

main()

Submission status: Accepted

Solution code:
n = int(input())
ans = [0 for _ in range(4)]
for _ in range(n):
    a = input()
    if a == 'AC': ans[0] += 1
    elif a == 'WA': ans[1] += 1
    elif a == 'TLE': ans[2] += 1
    else: ans[3] += 1

for i, j in enumerate(['AC', 'WA', 'TLE', 'RE']):
    print(j+' x %d' % ans[i])

Submission status: Accepted

Solution code:
count = int(input())

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

for _ in range(count):
    i = input()
    if i == 'AC':
        ac += 1
    if i == 'WA':
        wa += 1
    if i == 'TLE':
        tle += 1
    if i =='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())
S = [input() for _ in range(N)]

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

Submission status: Accepted

Solution code:
judge = ['AC', 'WA', 'TLE', 'RE']
res = dict()
for x in judge:
    res[x] = 0

n = int(input())
for _ in range(n):
    s = input()
    res[s] += 1
for x in judge:
    print(x+' x '+str(res[x]))

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
  
for s in ('AC', 'WA', 'TLE', 'RE'):
  print(s + ' x ' + str(dic[s]))

Submission status: Accepted

Solution code:
n = int(input())
d = dict(AC=0, WA=0, TLE=0, RE=0)
for i in range(n):
  s = str(input())
  if s == 'AC':
    d['AC'] += 1
  elif s == 'WA':
    d['WA'] += 1
  elif s == 'TLE':
    d['TLE'] += 1
  elif s == 'RE':
    d['RE'] += 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']))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
slist=''
for i in range(n):
    slist += input()
print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(slist.count('AC'),slist.count('WA'),slist.count('TLE'),slist.count('RE')))

Submission status: Accepted

Solution code:
x=int(input(''))
y=[0]*x
for i in range(x):
  y[i]=input('')
a=0
w=0
t=0
r=0
for i in range(x):
  if y[i]=='AC':
    a=a+1
  elif y[i]=='WA':
    w=w+1
  elif y[i]=='TLE':
    t=t+1
  else:
    r=r+1
print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}'.format(a,w,t,r))

Submission status: Accepted

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

ma = {}
ma['AC'] = 0
ma['WA'] = 0
ma['TLE'] = 0
ma['RE'] = 0
for i in range(N):
    s = input()
    if s in ma:
        ma[s] += 1


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

Submission status: Accepted

Solution code:
N = int(input())

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

for roop in range(N):
    judge = input()
    if judge == "AC":
        count["AC"] += 1
    elif judge == "WA":
        count["WA"] += 1
    elif judge == "TLE":
        count["TLE"] += 1
    elif judge == "RE":
        count["RE"] += 1
for roop2 in count.keys():
    print(roop2 + " x " + str(count[roop2]))

Submission status: Accepted

Solution code:
"""
atcoder : 173B
auther : Jay Saha
handel : ponder2000
date : 15/07/2020
"""

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

n = int(input())
for _ in range(n):
    ans[input()] += 1
print(f"AC x {ans['AC']}")
print(f"WA x {ans['WA']}")
print(f"TLE x {ans['TLE']}")
print(f"RE x {ans['RE']}")

Submission status: Accepted

Solution code:
from collections import Counter

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

ctr = Counter(s)

for k in ["AC", "WA", "TLE", "RE"]:
    print(f"{k} x {ctr[k]}")

Submission status: Accepted

Solution code:
from collections import Counter

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

ctr = Counter(s)

print(f"AC x {0 if ctr.get('AC') is None else ctr.get('AC')}")
print(f"WA x {0 if ctr.get('WA') is None else ctr.get('WA')}")
print(f"TLE x {0 if ctr.get('TLE') is None else ctr.get('TLE')}")
print(f"RE x { 0 if ctr.get('RE') is None else ctr.get('RE')}")

Submission status: Accepted

Solution code:
n = int(input())

cases = ['AC', 'WA', 'TLE', 'RE']
ans = [0, 0, 0, 0]
for _ in range(n):
    s = input()
    for i, case in enumerate(cases):
        if s == case:
            ans[i] += 1

for i in range(4):
    print("{} x {}".format(cases[i], ans[i]))

Submission status: Accepted

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

print('WA x ', end = '')
print(c['WA'])

print('TLE x ', end = '')
print(c['TLE'])

print('RE x ', end = '')
print(c['RE'])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import bisect
import copy
import collections
import heapq
import itertools
import math
import numpy as np
from operator import itemgetter
import scipy.misc
import sys

"""
#### 入力例 ####
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())
"""


N=int(input())
S = [input() for n in range(N)]
s_counter = collections.Counter(S)
def main():
    cases = ["AC", "WA", "TLE", "RE"]
    for case in cases:
        cnt = 0
        if case in s_counter.keys():
            cnt =s_counter[case]
        print(case+" x "+str(cnt))
        
    return
    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())

list = []
for i in range(N):
    list.append(str(input()))
a = list.count("AC")
b = list.count("WA")
c = list.count("TLE")
d = list.count("RE")

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

Submission status: Accepted

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

dic = {'AC':0,'WA':0,'TLE':0,'RE':0}
for s in S:
    if s in dic.keys():
        dic[s] += 1

for key,value in zip(dic.keys(),dic.values()):
    print(key+' x '+str(value))

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

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

n=int(input())
for _ in range(n):
    dic[input().rstrip()]+=1

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

Submission status: Accepted

Solution code:
N=int(input())

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


a = list.count("AC")
b = list.count("WA")
c = list.count("TLE")
d = list.count("RE")

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:
n = int(input())
S = [input() for _ in range(n)]

num_ac, num_wa, num_tle, num_re = 0, 0, 0, 0

for s in S:
    if s == 'AC':
        num_ac += 1
    elif s == 'WA':
        num_wa += 1
    elif s == 'TLE':
        num_tle += 1
    else:
        num_re += 1

print(f'AC x {num_ac}')
print(f'WA x {num_wa}')
print(f'TLE x {num_tle}')
print(f'RE x {num_re}')

Submission status: Accepted

Solution code:

iAC = 0
iWA = 0
iTLE = 0
iRE = 0

N = int(input())
for i in range(N):
    S = input()
    if S == "AC":
        iAC += 1
    elif S == "WA":
        iWA += 1
    elif S == "TLE":
        iTLE += 1
    elif S == "RE":
        iRE += 1

print("AC x {}".format(iAC))
print("WA x {}".format(iWA))
print("TLE x {}".format(iTLE))
print("RE x {}".format(iRE))

Submission status: Accepted

Solution code:
i = int(input())
case = [input() for c in range(i)]
ans = [0,0,0,0]
ac = case.count("AC")
wa = case.count("WA")
tle = case.count("TLE")
re= case.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):
    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 = [str(input()) for _ in range(n)]

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

for i in s:
    if i == 'AC':
        dic['AC'] += 1
    elif i == 'WA':
        dic['WA'] += 1
    elif i == 'TLE':
        dic['TLE'] += 1
    else:
        dic['RE'] += 1

for i in dic:
    # print(i)
    print("{0} x {1}".format(i, dic[i]))

Submission status: Accepted

Solution code:
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
  elif s == 'RE':
    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))

Submission status: Accepted

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

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

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

for key, value in result.items():
    print(f'{key} x {value}')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans_list = [0,0,0,0]

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

for i in range(len(ans_list)):
    if i == 0:
        print('AC x ' + str(ans_list[i]))
    elif i == 1:
        print('WA x ' + str(ans_list[i]))
    elif i == 2:
        print('TLE x ' + str(ans_list[i]))
    else:
        print('RE x ' + str(ans_list[i]))

Submission status: Accepted

Solution code:
import sys


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


def main():
    N = int(input())
    di = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    di = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N=int(input())

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

for v in ["AC", "WA", "TLE", "RE"]:
    print(f"{v} x {s.count(v)}")

Submission status: Accepted

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for n in range(0,N):
  S = input()
  if S == 'AC':
    ac = ac + 1
  elif S == 'WA':
    wa = wa + 1
  elif S == 'TLE':
    tle = tle + 1
  elif S == 'RE':
    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())  # nは入力回数
m = [input() for _ in range(n)]

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

Submission status: Accepted

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

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

for s in S:
    if s=='AC':
        AC+=1
    if s=='WA':
        WA+=1
    if s=='TLE':
        TLE+=1
    if s=='RE':
        RE+=1
print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(AC,WA,TLE,RE))

Submission status: Accepted

Solution code:
N = int(input())

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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



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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
Sn = [input()for i in range(1,n+1)]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = list(input() for i in range(n))
print('AC x ',s.count('AC'))
print('WA x ',s.count('WA'))
print('TLE x ',s.count('TLE'))
print('RE x ',s.count('RE'))

Submission status: Accepted

Solution code:
import collections

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
'''Template Starts'''

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


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


sys.setrecursionlimit(20000000)

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


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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
from sys import stdin


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

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict

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

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

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

Submission status: Accepted

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

for i in range(n):

  if x[i]=='AC':
    L[0]=L[0]+1
  elif x[i]=='WA':
    L[1]=L[1]+1
  elif x[i]=='TLE':
    L[2]=L[2]+1
  else:
    L[3]=L[3]+1


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

Submission status: Accepted

Solution code:
from collections import Counter
def main():
    N = int( input())
    S = [ input() for _ in range(N)]
    C = Counter(S)
    print("AC", "x", C["AC"])
    print("WA", "x", C["WA"])
    print("TLE", "x", C["TLE"])
    print("RE", "x", C["RE"])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ac = 0
wa = 0
tle = 0
re = 0
for t in range(int(input())):
    s = input()
    if "AC" in s:
        ac += 1
    elif "WA" in s:
        wa += 1
    elif "TLE" in s:
        tle += 1
    else:
        re += 1
print("AC x ", ac)
print("WA x ", wa)
print("TLE x ", tle)
print("RE x ", re)

Submission status: Accepted

Solution code:
N = int(input())
Si = [input() for i in range(N)]

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
AC = 0
TLE = 0
WA = 0
RE = 0
for i in range(n):
    s = input()
    if s == 'AC':
        AC += 1
    if s == 'WA':
        WA += 1
    if s == 'TLE':
        TLE += 1
    if s == 'RE':
        RE += 1
print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))

Submission status: Accepted

Solution code:
n = int(input())
hashtable = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(n):
    create = input()
    if create in hashtable:
        hashtable[create] += 1
for i in hashtable.keys():
    print(i, end=" x ")
    print(hashtable.get(i))

Submission status: Accepted

Solution code:
num = int(input())
ac=0
wa=0
tle=0
re =0
for n in range(num):
  str1 =input()
  if str1=="AC":
    ac +=1
  elif str1=="WA":
    wa+=1
  elif str1=="TLE":
    tle+=1
  elif str1 == "RE":
    re +=1

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

Submission status: Accepted

Solution code:
import collections

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = [input() for v in range(N)]
for v in ["AC", "WA", "TLE", "RE"]:
    print("{0} x {1}".format(v, s.count(v)))

Submission status: Accepted

Solution code:
N = int(input())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
AC  = 0
WA = 0 
TLE = 0
RE = 0
for _ in range(n):
    key = input()
    if key == 'AC':
        AC += 1
    elif key == 'RE':
        RE += 1
    elif key == 'WA':
        WA += 1
    else:
        TLE += 1
print('AC x',AC)
print('WA x',WA)
print('TLE x',TLE)
print('RE x',RE)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
# 文字列の入力
s = [input() for i in range(n)]
# 数え上げ
C0 = s.count('AC')
C1 = s.count('WA')
C2 = s.count('TLE')
C3 = s.count('RE')
# 出力
print("AC x {}".format(C0))
print("WA x {}".format(C1))
print("TLE x {}".format(C2))
print("RE x {}".format(C3))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    tmp = input()
    if tmp == "AC":
        ac += 1
    elif tmp == "WA":
        wa += 1
    elif tmp == "TLE":
        tle += 1
    else:
        re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))