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(''))
l=[]

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for cnt in range(n):
    if s[cnt] == "AC":
        cnt_ac += 1
    elif s[cnt] == "WA":
        cnt_wa += 1
    elif s[cnt] == "TLE":
        cnt_tle += 1
    else:
        cnt_re += 1

print("AC x ", cnt_ac)
print("WA x ", cnt_wa)
print("TLE x ", cnt_tle)
print("RE x ", cnt_re)

Submission status: Accepted

Solution code:
N = int(input())

AC = 0
WA = 0
TLE = 0
RE = 0
for _ in range(N):
    tmp = input()
    if tmp == "AC":
        AC += 1
    elif tmp == "WA":
        WA += 1
    elif tmp == "TLE":
        TLE += 1
    else:
        RE += 1

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

Submission status: Accepted

Solution code:
def readInt():
    return list(map(int, input().split()))

ac = 0
wa = 0
tle = 0
re = 0
n = int(input())
for i in range(n):
    s = input()
    if s=='AC':
        ac += 1
    elif s=='WA':
        wa += 1
    elif s=='TLE':
        tle += 1
    else:
        re += 1
print('AC x {}'.format(ac))
print('WA x {}'.format(wa))
print('TLE x {}'.format(tle))
print('RE x {}'.format(re))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())
S = [input() for n in range(N)]
S = np.array(S)

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

S = [input() for _ in range(n)]#tate




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

A = []

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

cnt = [0,0,0,0]

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

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

Submission status: Accepted

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

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

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:
#B
N = int(input())


AC = 0
WA = 0
TLE = 0
RE = 0
for _ in range(N):
    judge = input()
    if judge == 'AC':
        AC += 1
    elif judge == 'WA':
        WA += 1
    elif judge == 'TLE':
        TLE += 1
    elif judge == 'RE':
        RE += 1

print(f'AC x {AC}')
print(f'WA x {WA}')
print(f'TLE x {TLE}')
print(f'RE x {RE}')

Submission status: Accepted

Solution code:
N = int(input())
words = []
for i in range(N):
    w = input()
    words.append(w)
ac_len = words.count('AC')
wa_len = words.count('WA')
tl_len = words.count('TLE')
re_len = words.count('RE')
print(f'AC x {ac_len}')
print(f'WA x {wa_len}')
print(f'TLE x {tl_len}')
print(f'RE x {re_len}')

Submission status: Accepted

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

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

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 = AC + 1
    elif S == 'WA':
        WA = WA + 1
    elif S == 'TLE':
        TLE = TLE + 1
    else:
        RE = RE + 1

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

Submission status: Accepted

Solution code:
n = int(input())
cnt = [0]*4
for i in range(n):
    s = input()
    if s == 'AC':
        cnt[0] += 1
    elif s == 'WA':
        cnt[1] += 1
    elif s == 'TLE':
        cnt[2] += 1
    else:
        cnt[3] += 1

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

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 " + 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 = [list(str(input())) for i in range(N)]

AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    if S[i][0] == 'A':
        AC += 1
    elif S[i][0] == 'W':
        WA += 1
    elif S[i][0] == 'T':
        TLE += 1
    else:
        RE += 1

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

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

Submission status: Accepted

Solution code:
n = int(input())
count = [0, 0, 0, 0]
for _ in range(n):
    s = input()
    if s == "AC":
        count[0] += 1
    elif s == "WA":
        count[1] += 1
    elif s == "TLE":
        count[2] += 1
    else:
        count[3] += 1

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

Submission status: Accepted

Solution code:
n = int(input())
s = []
for i in range(n):
    s.append(input())
#s = list(map(int, input().split()))
a =0
b=0
c=0
d=0
for i in range(n):
    if s[i] == "AC":
        a += 1
    elif s[i] == "WA":
        b += 1
    elif s[i] == "TLE":
        c += 1
    elif s[i] == "RE":
        d += 1

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

Submission status: Accepted

Solution code:
from collections import Counter

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

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

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

Submission status: Accepted

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

ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    if s[i] == 'AC':
        ac += 1
    elif s[i] == 'WA':
        wa += 1
    elif s[i] == 'TLE':
        tle += 1
    else:
        re += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

if __name__ == "__main__":
    main()

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

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

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

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

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 k,v in dic.items():
    print(k + " x " + str(v))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

result  = [0,0,0,0]

for i in range(n):
    s = input()
    if s == "AC":
        result[0] += 1
    elif s == "WA":
        result[1] += 1
    elif s == "TLE":
        result[2] += 1
    elif s == "RE":
        result[3] += 1


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

Submission status: Accepted

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

import collections

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

Submission status: Accepted

Solution code:
wa = {}
wa["AC"] = 0
wa["WA"] = 0
wa["TLE"] = 0
wa["RE"] = 0

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

Submission status: Accepted

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

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

    return
resolve()

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for i in range(N)]
ac = 0
wa = 0
tle = 0
re = 0
for s in S:
    if s == "AC":
        ac += 1
    if s == "TLE":
        tle += 1
    if s == "WA":
        wa += 1
    if s == "RE":
        re += 1
print("AC x {0}".format(ac))
print("WA x {0}".format(wa))
print("TLE x {0}".format(tle))
print("RE x {0}".format(re))

Submission status: Accepted

Solution code:
n = int(input())

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

#print(L)

for i in range(n):
    a = input()
    
    if a == 'AC':
        L[0] += 1
    if a == 'WA':
        L[1] += 1
    if a == 'TLE':
        L[2] += 1
    if a == 'RE':
        L[3] += 1

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

Submission status: Accepted

Solution code:
#!/usr/local/bin/python3
# coding: utf-8
import numpy as np
#!/usr/local/bin/python3
# coding: utf-8
import numpy as np
hairu = int(input())
ac = 0
wa = 0
re = 0
tle = 0

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

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

Submission status: Accepted

Solution code:
import collections


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

# print(S)

c = collections.Counter(S)
# print(c)

ac = c["AC"]
wa = c["WA"]
tle = c["TLE"]
re = c["RE"]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
AC,WA,TLE,RE = 0,0,0,0

for _ in range(N):
    s = input()
    if s == 'AC':
        AC += 1
    elif s == 'WA':
        WA += 1
    elif s == 'TLE':
        TLE += 1
    else:
        RE += 1

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
n = int(input())
cnt_ac = 0
cnt_wa = 0
cnt_tle = 0
cnt_re = 0
for _ in range(n):
    s = input()
    if s == 'AC':
        cnt_ac += 1
    elif s == 'TLE':
        cnt_tle += 1
    elif s == 'WA':
        cnt_wa += 1
    else:
        cnt_re += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

n = int(input())

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

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

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

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

Submission status: Accepted

Solution code:
n=int(input())

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

for _ in range(n):
    aaa=input()
    if aaa=='AC':
        ac+=1
    elif aaa=='WA':
        wa+=1
    elif aaa=='TLE':
        tle+=1
    elif aaa=='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 _ 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())
box=[0]*4
for i in range(N):
    S=str(input())
    if S=="AC":
        box[0]+=1
    elif S=="WA":
        box[1]+=1
    elif S=="TLE":
        box[2]+=1
    else:
        box[3]+=1
print("AC x ",box[0])
print("WA x ",box[1])
print("TLE x ",box[2])
print("RE x ",box[3])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict

N = int(input())
d = defaultdict(int)
for i in range(N):
    tmp = input()
    d[tmp] += 1

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

print(f'''AC x {ls[0]}
WA x {ls[1]}
TLE x {ls[2]}
RE x {ls[3]}''')

Submission status: Accepted

Solution code:
m = {}
m['AC'] = 0
m['WA'] = 0
m['TLE'] = 0
m['RE'] = 0

for __ in range(int(input())):
  m[input()] += 1

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

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:
from collections import Counter

N = int(input())
C = [0 for i in range(4)]
S = [input() for i in range(N)]

S_co = Counter(S)

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

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for _ in range(N)]
cli = [0] * 4
cli[0] = S.count('AC')
cli[1] = S.count('WA')
cli[2] = S.count('TLE')
cli[3] = S.count('RE')
print(f'AC x {cli[0]}')
print(f'WA x {cli[1]}')
print(f'TLE x {cli[2]}')
print(f'RE x {cli[3]}')

Submission status: Accepted

Solution code:
n=int(input())  #数値入力 「N」だけの入力のとき

s=[""]*n
c0=0
c1=0
c2=0
c3=0
for i in range(n):
    si=input()
    if si=="AC":
        c0+=1
    elif si=="WA":
        c1+=1
    elif si=="TLE":
        c2+=1
    elif si=="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())
S = list(input() for _ in range(N))
J = ["AC", "WA", "TLE", "RE"]

for judge in J:
    print(judge + " x " + str(S.count(judge)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S = [0]*N
for i in range(N):
    S[i] = str(input())
result = ['AC','WA','TLE','RE']
resultnum = [0,0,0,0]
for i in range(N):
    if S[i] == result[0]:
        resultnum[0] += 1
    if S[i] == result[1]:
        resultnum[1] += 1
    if S[i] == result[2]:
        resultnum[2] += 1
    if S[i] == result[3]:
        resultnum[3] += 1
for i in range(4):
    print(str(result[i]) + ' x ' + str(resultnum[i]))

Submission status: Accepted

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

print(f'''AC x {c[0]}
WA x {c[1]}
TLE x {c[2]}
RE x {c[3]}''')

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    temp = input()
    if temp == "AC":
        AC = AC + 1
    if temp == "WA":
        WA = WA + 1
    if temp == "TLE":
        TLE = TLE + 1
    if temp == "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:
import random
from functools import lru_cache
import math

def solve():
    n = int(input())
    hmap = {'AC': 0, 'TLE': 0, 'WA': 0, 'RE': 0}
    
    for _ in range(n):
        s = input()
        hmap[s] += 1
    
    print('AC x', hmap.get('AC',0))
    print('WA x', hmap.get('WA',0))
    print('TLE x', hmap.get('TLE',0))
    print('RE x', hmap.get('RE',0))

t = 1
for _ in range(t):
    solve()

Submission status: Accepted

Solution code:
n = int(input())
a,b,c,d = 0,0,0,0
for i in range(n):
    tmp = input()
    if tmp == 'AC':
        a += 1
    if tmp == 'WA':
        b += 1
    if tmp == 'TLE':
        c += 1
    if tmp == '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())
S = [input()for _ in range(N)]

AC, WA, TLE, RE = (0,0,0,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(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 i in range(n):
    d[input()] += 1
for i in ['AC', 'WA', 'TLE', 'RE']:
    print(i+' x '+str(d[i]))

Submission status: Accepted

Solution code:
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
n=int(input())
count=0
flag=0
tag=0
bsdk=0
for i in range(n):
    s=input()
    if s=="AC":
        count=count+1
    elif s=="WA":
        flag=flag+1
    elif s=="TLE":
        tag=tag+1
    else:
        bsdk=bsdk+1
print("AC x",count)
print("WA x",flag)
print("TLE x",tag)
print("RE x",bsdk)

Submission status: Accepted

Solution code:
import collections
N = int(input())
S = [input() for _ in range(N)]
Scol = collections.Counter(S)

if 'AC' in Scol:
    AC = Scol['AC']
else:
    AC = 0

if 'WA' in Scol:
    WA = Scol['WA']
else:
    WA = 0

if 'TLE' in Scol:
    TLE = Scol['TLE']
else:
    TLE = 0

if 'RE' in Scol:
    RE = Scol['RE']
else:
    RE = 0

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())
List=[input() for i in range(N)]
a=0
b=0
c=0
d=0
for i in range(0,N):
    if List[i]=="AC":
        a+=1
    elif List[i]=="WA":
        b+=1
    elif List[i]=="TLE":
        c+=1
    else:
        d+=1
print("AC"+" x "+str(a))
print("WA"+" x "+str(b))
print("TLE"+" x "+str(c))
print("RE"+" x "+str(d))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# @Time    : 2020/7/5 19:54
# @Version : 1.1
# @Author  : Jade
# @File    : b.py
# @Software: PyCharm
#

def main():
    n = int(input())
    ac,wa,tle,re = 0,0,0,0
    for _ in range(n):
        text = input()
        if text == 'AC':
            ac += 1
        elif text == 'WA':
            wa += 1
        elif text == 'TLE':
            tle += 1
        else:
            re += 1
    print("AC x %d"%ac)
    print("WA x %d"%wa)
    print("TLE x %d"%tle)
    print("RE x %d"%re)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans = [0 for i in range (4)]
num = int(input())
for i in range (num):
    inp = input()
    if inp == 'AC':
        ans[0] += 1
    elif inp =='WA':
        ans[1] +=1
    elif inp == 'TLE':
        ans[2] += 1
    elif inp == 'RE':
        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]))