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:
l = [0,0,0,0]
for i in range(int(input())):
  data  = input()
  if data == 'AC':
    l[0] += 1
  elif data == 'WA':
    l[1] += 1
  elif data == 'TLE':
    l[2] += 1
  else:
    l[3] += 1
print('AC x {}'.format(l[0]))
print('WA x {}'.format(l[1]))
print('TLE x {}'.format(l[2]))
print('RE x {}'.format(l[3]))

Submission status: Accepted

Solution code:
n=int(input())
s=[]
for i in range(n):
    s.append(input())
a=[0]*4
for i in range(n):
    if s[i]=='AC':
        a[0]+=1
    elif s[i]=='WA':
        a[1]+=1
    elif s[i]=='TLE':
        a[2]+=1
    else:
        a[3]+=1
print("AC x {}".format(a[0]))
print("WA x {}".format(a[1]))
print("TLE x {}".format(a[2]))
print("RE x {}".format(a[3]))

Submission status: Accepted

Solution code:
N = int(input())
ans = {"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(N):
  temp = input()
  ans[temp] += 1
for i in ans.keys():
  print(i + " x " + str(ans[i]))

Submission status: Accepted

Solution code:
n = int(input())
a= [input() for i in range(n)]

ca=a.count('AC')
cw=a.count('WA')
ct=a.count('TLE')
cr=a.count('RE')
print('AC x',ca)
print('WA x',cw)
print('TLE x',ct)
print('RE x',cr)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    S = []
    for _ in range(N):
        S.append(input())
    answers = solve(N, S)
    print('\n'.join(answers))


def solve(N, S):
    counter = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE':0}
    for judge in S:
        counter[judge] += 1

    return [f'{k} x {v}' for k, v in counter.items()]


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
s = []
for _ in range(n):
    s.append(input()) 
    
ac = str(s.count("AC"))
wa = str(s.count("WA"))
tle = str(s.count("TLE"))
re = str(s.count("RE"))

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

Submission status: Accepted

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

C = [0,0,0,0]
judge = ['AC','WA','TLE','RE']

for i in range(N):
    for j in range(4):
        if judge[j]==S[i]:
            C[j]=C[j]+1

for k in range(4):
    print(f'{judge[k]} x {C[k]}')

Submission status: Accepted

Solution code:
N = int(input())
S = []
for _ in range(N):
    S.append(input())
ac=0
wa=0
tle=0
re=0
for i in S:
    if i =='AC':
        ac+=1
    elif i=='TLE':
        tle+=1
    elif i=='WA':
        wa+=1
    elif i=='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())
ac = 0
wa = 0
tel = 0
re = 0
for y in range(0,n):
  x = input()
  if x[0] == 'A':
    ac += 1
  elif x[0] == 'W':
    wa += 1
  elif x[0] == 'T':
    tel += 1
  else:
    re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tel))
print("RE x " + str(re))

Submission status: Accepted

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for x in range(N):
    ia = input()
    if ia == "AC":
        ac += 1
    elif ia == "WA":
        wa += 1
    elif ia == "TLE":
        tle += 1
    elif ia == "RE":
        re += 1
    else:
        break

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

Submission status: Accepted

Solution code:
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:
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', c0)
print('WA x', c1)
print('TLE x', c2)
print('RE x', c3)

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for _ in range(N)]
d = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for s in S:
    d[s] += 1
for k, v in d.items():
    print(f"{k} x {v}")

Submission status: Accepted

Solution code:
n = int(input())
s = []
for i in range(n):
    s.append(input())
ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
    if s[i] == 'AC':
        ac += 1
    elif s[i] == 'WA':
        wa += 1
    elif s[i] == 'TLE':
        tle += 1
    elif s[i] == '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:
from collections import defaultdict
n=int(input())
d=defaultdict(int)
for _ in range(n):
    s=input()
    d[s] += 1
print("AC x %d" % d["AC"])
print("WA x %d" % d["WA"])
print("TLE x %d" % d["TLE"])
print("RE x %d" % d["RE"])

Submission status: Accepted

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

Submission status: Accepted

Solution code:

times = int(input())  
n = [input() for i in range(times)]
acount=0
wacount=0
tlecount=0
recount=0
for item in n:
    if item == 'AC':
        acount += 1
    elif item == 'WA':
        wacount += 1
    elif item == 'TLE':
        tlecount += 1
    elif item == 'RE':
        recount += 1

print('AC x '+ str(acount))
print('WA x '+str(wacount))
print('TLE x '+str(tlecount))
print('RE x '+str(recount))

Submission status: Accepted

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

for a in a:
    if a=="AC":
        AC+=1
    if a=="WA":
        WA+=1
    if a=="TLE":
        TLE+=1
    if a=="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())
s = [input() for _ in range(n)]

c = collections.Counter(s)

print("AC x {}\nWA x {}\nTLE x {}\nRE x {}".format(c["AC"], c["WA"], c["TLE"], c["RE"]))

Submission status: Accepted

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

print("AC", "x", output_list.count("AC"), "\n",
     "WA", "x", output_list.count("WA"), "\n",
     "TLE", "x", output_list.count("TLE"), "\n",
     "RE", "x", output_list.count("RE"), "\n",)

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 {}'.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())
ac=str("AC x")
wa=str("WA x")
tle=str("TLE x")
re=str("RE x")
a=0;b=0;c=0;d=0
for i in range(n):
    p=input()
    if(p=="AC"):
        a+=1
    if(p=="WA"):
        b+=1
    if (p == "TLE"):
        c += 1
    if (p == "RE"):
        d += 1
print(ac,a)
print(wa,b)
print(tle,c)
print(re,d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
ac_list=[input() for i in range(n)]
AC = ac_list.count('AC')
WA = ac_list.count('WA')
TLE = ac_list.count('TLE')
RE = ac_list.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:
number_of_traials = int(input())

AC_counter = 0
WA_counter = 0
TLE_counter = 0
RE_counter = 0

for i in range(number_of_traials):
    result = input()
    if result == "AC":
        AC_counter += 1
    elif result == "WA":
        WA_counter += 1
    elif result == "TLE":
        TLE_counter += 1
    elif result == "RE":
        RE_counter += 1

print("AC x {}".format(AC_counter))
print("WA x {}".format(WA_counter))
print("TLE x {}".format(TLE_counter))
print("RE x {}".format(RE_counter))

Submission status: Accepted

Solution code:
num_of_test = int(input())

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

for i in range(num_of_test):
  temp_input = input()
  acums[temp_input] += 1

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

Submission status: Accepted

Solution code:
ac_cnt = 0
wa_cnt = 0
tle_cnt = 0
re_cnt = 0

for _ in range(int(input())):
	res = input()
	if res == 'AC':
		ac_cnt += 1
	elif res == 'WA':
		wa_cnt += 1
	elif res == 'TLE':
		tle_cnt += 1
	else:
		re_cnt += 1

print("AC x {}".format(ac_cnt))
print("WA x {}".format(wa_cnt))
print("TLE x {}".format(tle_cnt))
print("RE x {}".format(re_cnt))

Submission status: Accepted

Solution code:
import sys

n = int(input())

list_input = [sys.stdin.readline()[:-1] for _ in range(n)]

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

Submission status: Accepted

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

a = str_list.count("AC")
w = str_list.count("WA")
t = str_list.count("TLE")
r = str_list.count("RE")

print("AC x",a)
print("WA x",w)
print("TLE x",t)
print("RE x",r)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
li = [0] * 4
N = int(input())
for i in range(N):
    result = input()
    if result == "AC":
        li[0] += 1
    if result == "WA":
        li[1] += 1 
    if result == "TLE":
        li[2] += 1
    if result == "RE":
        li[3] += 1
line = "AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}".format(li[0], li[1], li[2], li[3])
print(line)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

ans = "AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}".format(ac, wa, tle, re)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
a=[]
n=int(input())
for i in range(n):
    a.append(input())


c=Counter(a)

print("AC x {}".format(c["AC"]))

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

Submission status: Accepted

Solution code:
n = int(input())
sdic = {"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(n):
    s = input()
    sdic[s] += 1
ac = str(sdic["AC"])
print("AC x "+ac)
wa = str(sdic["WA"])
print("WA x "+wa)
tle = str(sdic["TLE"])
print("TLE x "+tle)
re = str(sdic["RE"])
print("RE x "+re)

Submission status: Accepted

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

result = ['AC', 'WA', 'TLE', 'RE']
C = [S.count(r) for r in result]

for (re, c) in zip(result, C):
    print(re + ' x ' + str(c))

Submission status: Accepted

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

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:
N=int(input())
d=dict()
for tt in range(N):
    s=input()
    if s not in d:
        d[s]=1
    else:
        d[s]+=1
for st in ["AC","WA","TLE","RE"]:
    if st not in d:
        print(st," x ",0)
    else:
        print(st," x ",d[st])

Submission status: Accepted

Solution code:
N = int(input())
#print(N)

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

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

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

Submission status: Accepted

Solution code:
n = int(input())
m = [input() for l in range(n)]
x = []
a = 0
b = 0
c = 0
d = 0
for i in range (0,n):
    if m[i] == "AC":
        a = a + 1
    if m[i] == "WA":
        b = b + 1
    if m[i] == "TLE":
        c = c + 1
    if m[i] == "RE":
        d = d + 1
t = [0,0,0,0]
t[0] = "AC x " +str(a)
t[1] = "WA x " +str(b)
t[2] = "TLE x " +str(c)
t[3] = "RE x " +str(d)
for i in t:
    print(i)

Submission status: Accepted

Solution code:
countac=0
countwa=0
counttle=0
countre=0
for _ in range(0, int(input())):
    n = input()
    if n=="AC":
        countac += 1
    elif n=="WA":
        countwa += 1
    elif n=="TLE":
        counttle += 1
    elif n=="RE":
        countre += 1
print("AC x ", countac)
print("WA x ", countwa)
print("TLE x ", counttle)
print("RE x ", countre)

Submission status: Accepted

Solution code:
ac,wa,tle,re = 0,0,0,0
N=int(input())
for _ in range(N):
  s=str(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 = []
for i in range(N):
  S.append(str(input()))
           

print('AC x %d' % S.count('AC'))
print('WA x %d' % S.count('WA'))
print('TLE x %d' % S.count('TLE'))
print('RE x %d' % S.count('RE'))

Submission status: Accepted

Solution code:
import math

n = int(input())
s = [str(input()) for i in range(n)]
ac_cnt = 0
wa_cnt = 0
tle_cnt = 0
re_cnt = 0
for i in range(n) :
    if(s[i] == 'AC') :
        ac_cnt = ac_cnt + 1
    if(s[i] == 'WA') : 
        wa_cnt = wa_cnt + 1 
    if(s[i] == 'TLE') :  
        tle_cnt = tle_cnt+1
    if(s[i] == 'RE') :
        re_cnt = re_cnt+1
print('AC x', ac_cnt)
print('WA x' ,wa_cnt)
print('TLE x' ,tle_cnt)
print('RE x' ,re_cnt)

Submission status: Accepted

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

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

for r in r_list:
  if r == sult[0]:
    a_list[0] += 1
  elif r == sult[1]:
    a_list[1] += 1
  elif r == sult[2]:
    a_list[2] += 1
  elif r == sult[3]:
    a_list[3] += 1

for i,o in enumerate(sult):
  print(o + " x " + str(a_list[i]))

Submission status: Accepted

Solution code:
n=int(input())
na,cnt=['AC','WA','TLE','RE'],[0,0,0,0]
while n:
  s=input()
  cnt[na.index(s)]+=1
  n-=1
for i in range(4):
  print(na[i],"x",cnt[i],sep=" ",end='\n')

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

def main():
    n = int(input())
    dic = defaultdict(int)
    for _ in range(n):
        dic[input()] += 1
    print('AC x',dic['AC'])
    print('WA x',dic['WA'])
    print('TLE x',dic['TLE'])
    print('RE x',dic['RE'])
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
a = [input() for i in range(N)]
 
countac = 0
countwa = 0
counttle = 0
countre = 0
for A in a:
  if A == "AC":
    countac += 1
  elif A == "WA":
    countwa += 1
  elif A == "TLE":
    counttle += 1
  elif A == "RE":
    countre += 1

print("AC x %d" % countac)
print("WA x %d" % countwa)
print("TLE x %d" % counttle)
print("RE x %d" % countre)

Submission status: Accepted

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

c0, c1, c2, c3 = [0, 0, 0, 0]

for s in S:
    if s == 'AC':
        c0 += 1
    elif s == 'WA':
        c1 += 1
    elif s == 'TLE':
        c2 += 1
    elif s == 'RE':
        c3 += 1

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

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())
s = [input() for i in range(n)]
ac = s.count("AC")
wa = s.count("WA")
tle = s.count("TLE")
re = s.count("RE")

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())

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

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

Submission status: Accepted

Solution code:
N=int(input())
test_case=[input() for _ in range(N)]
a=test_case.count('AC')
b=test_case.count('WA')
c=test_case.count('TLE')
d=test_case.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())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
    i = input()
    if i == 'AC':
        ac += 1
    elif i == 'WA':
        wa += 1
    elif i == 'TLE':
        tle += 1
    elif i == '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())
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:
from collections import defaultdict
n=int(input())
dic=defaultdict(int)
for i in range(n):
    x=input()
    if x in dic:
        dic[x]+=1
    else:
        dic[x]=1
print("AC x",dic["AC"])
print("WA x",dic["WA"])
print("TLE x",dic["TLE"])
print("RE x",dic["RE"])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
slist = [input() for i in range(n)]

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

for i in slist:
  if (i == 'AC'):
    ans[0] = ans[0] + 1
  if (i == 'WA'):
    ans[1] = ans[1] + 1
  if (i == 'TLE'):
    ans[2] = ans[2] + 1
  if (i == 'RE'):
    ans[3] = ans[3] + 1


for i in range(4):
  if(i == 0):
    print("AC x " + str(ans[i]))
  if(i == 1):
    print("WA x " + str(ans[i]))
  if(i == 2):
    print("TLE x " + str(ans[i]))
  if(i == 3):
    print("RE x " + str(ans[i]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S=[""]*N
for i in range(N):
  S[i]=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())
x = [input() for i in range(N)]
AC = 0
WA = 0
TLE = 0
RE = 0
for t in range(N):
    if x[t] == 'AC':
        AC += 1
    elif x[t] == 'WA':
        WA += 1
    elif x[t] == '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())
s = { "AC" : 0, "WA" : 0, "TLE" : 0, "RE" : 0 }
for i in range(n):
    s_in = input()
    s[s_in] += 1
print("AC x " + str(s["AC"]))
print("WA x " + str(s["WA"]))
print("TLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))

Submission status: Accepted

Solution code:
N = int(input())

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

# a, t, w, r = 0, 0, 0, 0

for i in range(N):
  s = input()
  if s == "AC":
    s_list["AC"] += 1
  elif s == "TLE":
    s_list["TLE"] += 1
  elif s == "WA":
    s_list["WA"] += 1
  else:
    s_list["RE"] += 1
    

print("AC x {}\nWA x {}\nTLE x {}\nRE x {}".format(s_list["AC"], s_list["WA"], s_list["TLE"], s_list["RE"]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    judges = [input() for _ in range(N)]
    
    res_dic = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
    for judge in judges:
        if judge in res_dic:
            res_dic[judge] += 1
        else:
            res_dic[judge] = 0
            
    for k, v in res_dic.items():
        print("{} x {}".format(k, v))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
ac, re, wa, tle = 0,0,0,0
for i in range(N):
  line = input()
  if line == "AC":
    ac += 1
  elif line == "TLE":
    tle += 1
  elif line == "WA":
    wa += 1
  elif line == "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:
# coding: utf-8
# 日本語を入力できるようにするために上記一文が必要


N = int( input())
S_LIST = []
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",C0)
print("WA x",C1)
print("TLE x",C2)
print("RE x",C3)

Submission status: Accepted

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0

for i in range(N):
    S = str(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())
judge = [input() for _ in range(n)]
ans = [0]*4
for i in judge:
    if i == "AC":
        ans[0] += 1
    elif i == "WA":
        ans[1] += 1
    elif i == "TLE":
        ans[2] += 1
    else:
        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]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S = []
for n 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())
x = ""
S = []
for i in range(N):
    x = input()
    S.append(x)
ans = [0]*4
for i in range(N):
    if S[i] == "AC":
        ans[0] += 1
    elif S[i] == "WA":
        ans[1] += 1
    elif S[i] == "TLE":
        ans[2] += 1
    elif S[i] == "RE":
        ans[3] += 1
print('AC x ',end='')
print(ans[0])
print('WA x ',end='')
print(ans[1])
print('TLE x ',end='')
print(ans[2])
print('RE x ',end='')
print(ans[3])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
N = int(input())
list = [''] * N
judge = [0] *4

#print(list)

#'''''''''
for i in range(0, N):
    list[i] = input()
    if list[i] == 'AC':
        judge[0] += 1
    elif list[i] == 'WA':
        judge[1] += 1
    elif list[i] == 'TLE':
        judge[2] += 1
    else:
        judge[3] += 1

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

Submission status: Accepted

Solution code:
import sys

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

data = sys.stdin.readlines()
data.pop(0)
for line in data:
    v = line.rstrip()
    if not "" == v:
        m[v] += 1

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

Submission status: Accepted

Solution code:
N = int(input())

import collections

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

S_count = collections.Counter(S_list)

if 'AC' in S_count:
    print('AC x {}'.format(S_count['AC']))
else:
    print('AC x 0')

if 'WA' in S_count:
    print('WA x {}'.format(S_count['WA']))
else:
    print('WA x 0')
if 'TLE' in S_count:
    print('TLE x {}'.format(S_count['TLE']))
else:
    print('TLE x 0')
if 'RE' in S_count:
    print('RE x {}'.format(S_count['RE']))
else:
    print('RE x 0')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
list1 = []
for i in range(n):
    get = input()
    list1.append(get)
print("AC x {}".format (list1.count("AC")))
print("WA x {}".format (list1.count("WA")))
print("TLE x {}".format (list1.count("TLE")))
print("RE x {}".format (list1.count("RE")))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

countAC=0
countWA=0
countTLE=0
countRE=0

for i in range(n):
    s=input()
    if s=="AC":
        countAC += 1
    elif s=="WA":
        countWA += 1
    elif s=="TLE":
        countTLE += 1
    else:
        countRE += 1

print("AC x " + str(countAC))
print("WA x " + str(countWA))
print("TLE x " + str(countTLE))
print("RE x " + str(countRE))

Submission status: Accepted

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

Submission status: Accepted

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

for key, value in ch.items():
  ch[key] = l.count(key)

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

Submission status: Accepted

Solution code:
N = int(input())
c = [input() for i in range(N)]
num_AC = c.count('AC')
print('AC x {}'.format(num_AC))
num_WA = c.count('WA')
print('WA x {}'.format(num_WA))
num_TLE = c.count('TLE')
print('TLE x {}'.format(num_TLE))
num_RE = c.count('RE')
print('RE x {}'.format(num_RE))

Submission status: Accepted

Solution code:
N = int(input())
S = list(str(input()) for _ in range(N))

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

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

Submission status: Accepted

Solution code:
number = int(input())
list1 = [0, 0, 0, 0]
list2 = ['AC', 'WA', 'TLE', 'RE']

for _ in range(number):
  word = input()
  if word == 'AC':
    list1[0] = list1[0] + 1
  elif word == 'WA':
    list1[1] = list1[1] + 1
  elif word == 'TLE':
    list1[2] = list1[2] + 1
  elif word == 'RE':
    list1[3] = list1[3] + 1
    
for i in range(len(list1)):
  print(list2[i], 'x',  list1[i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AC = 0
WA = 0
TLE = 0
RE = 0

N = int(input())
for _ in range(N):
    TMP = input()
    #print(TMP)
    if TMP == "AC":
        AC += 1
    elif TMP == "WA":
        WA += 1
    elif TMP == "TLE":
        TLE += 1
    elif 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:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
n = int(input())
s = [input()for _ 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 ", end = "")
print( ac)
print("WA" + " x ", end = "")
print( wa)
print("TLE" + " x ", end = "")
print( tle)
print("RE" + " x ", end = "")
print( re)