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())
a=[]
ca =0
cb =0
cc =0
cd=0
for i in range(N):
  a.append(input())
ca = a.count('AC')
cb = a.count('WA')
cc = a.count('TLE')
cd = a.count('RE')
print('AC','x',ca)
print('WA','x',cb)
print('TLE','x',cc)
print('RE','x',cd)

Submission status: Accepted

Solution code:
n= int(input())

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

l=[]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 range(n):
    if s[i] == "AC":
        ac += 1
    elif s[i] == "WA":
        wa += 1
    elif s[i] == "TLE":
        tle += 1
    elif s[i] == "RE":
        re += 1
    else:
        pass
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

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())
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:
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:
d = {"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(int(input())):
  s = input()
  d[s] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
t = int(input())
d = dict()
d['TLE'] = 0
d['AC'] = 0
d['WA'] = 0
d['RE'] = 0
while t > 0:
    s = input()
    if s == 'TLE':
        d['TLE'] += 1
    elif s == 'WA':
        d['WA'] += 1
    elif s == 'RE':
        d['RE'] += 1
    elif s == 'AC':
        d['AC'] += 1
    t-=1
print('AC', 'x' ,d['AC'])
print('WA', 'x' ,d['WA'])
print('TLE', 'x' ,d['TLE'])
print('RE', 'x' ,d['RE'])

Submission status: Accepted

Solution code:
N = int(input())
S = list()
AC = 0
WA = 0
TLE = 0
RE = 0
for x in range(0,N):
	S.append(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import *

# def solve():


# for _ in range(int(input())):
#     solve()
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:
#!/usr/bin/python
# -*- Coding: utf-8 -*-

n = int(input())
s_li = [input() for x in range(n)]

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N=int(input())
S=''
for _ in range(N):
  S+=input()
print(f"AC x {S.count('AC')}")
print(f"WA x {S.count('WA')}")
print(f"TLE x {S.count('TLE')}")
print(f"RE x {S.count('RE')}")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections

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

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

Submission status: Accepted

Solution code:
import sys
import collections

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, collections
N = int(input())
S = [str(input()) for _ in range(N)]
d = collections.Counter(S)
for k in 'AC WA TLE RE'.split():
    print(f'{k} x {d[k]}')

Submission status: Accepted

Solution code:
count = int(input())
test_str = ['AC', 'WA', 'TLE', 'RE']
result_str = []
flag_list = [0,0,0,0]

for num in range(count):
    result_str.append(input())

for num in range(count):
    for n in range(4):
        if result_str[num] == test_str[n]:
            flag_list[n] = flag_list[n] + 1

for n in range(4):
    print("{} x {}".format(test_str[n], flag_list[n]))

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
    else:
        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:
from collections import Counter
N=int(input())
a=[]
for i in range(N):
  a.append(input())
c = Counter(a)

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

Submission status: Accepted

Solution code:
test = int(input())
l = []
for i in range(test):
    l.append(str(input()))
wrong = l.count('WA')
accepted = l.count('AC')
tle = l.count('TLE')
re = l.count('RE')
print('AC x', str(accepted))
print('WA x', str(wrong))
print('TLE x', str(tle))
print('RE x', str(re))

Submission status: Accepted

Solution code:
import sys
N = int(input())
s = [input() for i in range(N)]
    
a = s.count("AC")
b = s.count("WA")
c = s.count("TLE")
d = s.count("RE")
 
print("AC"+" x "+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, WA, TLE, RE = 0, 0, 0, 0
while n != 0:
  i = input()
  if i == 'AC':
  	AC += 1
  elif i == 'WA':
    WA += 1
  elif i == 'TLE':
    TLE += 1
  elif i == 'RE':
    RE += 1
  n -= 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())

cnt_dict = {"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(N):
    s = input()
    cnt_dict[s] += 1

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

Submission status: Accepted

Solution code:
dic={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(int(input())) :
  dic[input()]+=1
for key,val in dic.items() :
  print(key+" x " +str(val))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections
N=int(input())
lis = [input() for i in range(N)]
lis2=["AC", "WA", "TLE", "RE" ]
for w in lis2:
    ans=collections.Counter(lis)
    print("{} x {}".format(w,ans[w]))

Submission status: Accepted

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

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

for st in s:
    if st == 'AC':
        n_ac += 1
    if st == 'WA':
        n_wa += 1
    if st == 'TLE':
        n_tle += 1
    if st == 'RE':
        n_re += 1

print(f'AC x {n_ac}')
print(f'WA x {n_wa}')
print(f'TLE x {n_tle}')
print(f'RE x {n_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:
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    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")))
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
N = int(input())
S = [""] * N

for c in range(N):
	S[c] = input()

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

for c in S_:
	print("{} x {}".format(c, S.count(c)))

Submission status: Accepted

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

N=int(readline())

from collections import defaultdict
dic = defaultdict(int)

for i in range(N):
  dic[readline().rstrip()] += 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:
import sys

def main():
	N = int(input())
	L = [input() for i in range(N)]
	print('AC x {0}'.format(L.count('AC')))
	print('WA x {0}'.format(L.count('WA')))
	print('TLE x {0}'.format(L.count('TLE')))
	print('RE x {0}'.format(L.count('RE')))
	

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
n = int(input())
kekka = []
for i in range(1, n+1):
  a = input()
  kekka.append(a)
  
print('AC x ' + str(kekka.count("AC")))
print('WA x ' + str(kekka.count("WA")))
print('TLE x ' + str(kekka.count("TLE")))
print('RE x ' + str(kekka.count("RE")))

Submission status: Accepted

Solution code:
n = int(input())

c_ac = 0
c_wa = 0
c_tle = 0
c_re = 0

for i in range(n):
    s = input()
    if s == "AC":
        c_ac += 1
    elif s == "WA":
        c_wa += 1
    elif s == "TLE":
        c_tle += 1
    else:
        c_re += 1

print("AC x", c_ac)
print("WA x", c_wa)
print("TLE x", c_tle)
print("RE x", c_re)

Submission status: Accepted

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

ans = [0,0,0,0]

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

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

Submission status: Accepted

Solution code:
n = int(input())
c = [0, 0, 0, 0]
for i in range(n):
  judge = input()
  if judge == 'AC':
    c[0] = c[0] + 1
  if judge == 'WA':
    c[1] = c[1] + 1
  if judge == 'TLE':
    c[2] = c[2] + 1
  if judge == 'RE':
    c[3] = 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())
d = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
  d[input()] += 1
for i in d.keys():
  print(i,"x",d[i])

Submission status: Accepted

Solution code:
N = int(input())
SAC = 0
SWA = 0
STLE = 0
SRE = 0
for i in range(N):
  tmp = input()
  if tmp == 'AC':
    SAC += 1
  elif tmp == 'WA':
    SWA += 1
  elif tmp == 'TLE':
    STLE += 1
  elif tmp == 'RE':
    SRE += 1

print("AC x " + str(SAC))
print("WA x "+ str(SWA))
print("TLE x "+str(STLE))
print("RE x "+str(SRE))

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
N=int(input())
S = [input() for _ in range(N)]
dic = dd(int)
for s in S:
    dic[s] += 1
print('AC x '+str(dic['AC']))
print('WA x '+str(dic['WA']))
print('TLE x '+str(dic['TLE']))
print('RE x '+str(dic['RE']))

Submission status: Accepted

Solution code:
n = int(input())
A = [list(map(str, input().split())) for _ in range(n)]

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

Submission status: Accepted

Solution code:
N=int(input())
a=0
b=0
c=0
d=0

#print(N)
for i in range(N):
    #print(i)
    j=str(input())
    if j=="AC":
      a+=1
    elif j=="WA":
      b+=1
    elif j=="TLE":
      c+=1
    elif j=="RE":
      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:
n = int(input())
a = 0
w = 0
t = 0
r = 0
for i in range(n):
    result = input()
    if result == "AC":
        a += 1
    elif result == "WA":
        w += 1
    elif result == "TLE":
        t += 1
print ("AC x "+ str(a))
print ("WA x "+ str(w))
print ("TLE x "+ str(t))
print ("RE x "+ str(n -(a + w + t)))

Submission status: Accepted

Solution code:
n = int(input())
cAC, cWA, cTLE, cRE = 0, 0, 0, 0
for i in range(n):
  s = str(input())
  if s == 'AC':
    cAC += 1
  elif s == 'WA':
    cWA += 1
  elif s == 'TLE':
    cTLE += 1
  else:
    cRE += 1
print("AC x", cAC)
print("WA x", cWA)
print("TLE x", cTLE)
print("RE x", cRE)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

n = int(readline())
s = read().rstrip().decode('utf-8')

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

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())

import collections

n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)
print(f'AC x {c["AC"]}')
print(f'WA x {c["WA"]}')
print(f'TLE x {c["TLE"]}')
print(f'RE x {c["RE"]}')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
n = list(input() for i in range(N))
a= 0
b=0
c=0
d=0
for i in n:
    if i == "AC":
        a = a+1
    elif i=="WA":
        b = b+1
    elif i=="TLE":
        c = c+1
    elif i== "RE":
        d = 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 defaultdict
n = int(input())
d = defaultdict(int)
for i in range(n):
    d[input()] += 1

for i in ['AC', 'WA', 'TLE', 'RE']:
    print('{} x {}'.format(i, d[i]))

Submission status: Accepted

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

judgelist=['AC', 'WA', 'TLE', 'RE']

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

for i in S:
    if i == judgelist[0]:
        AC+=1
    elif i == judgelist[1]:
        WA+=1
    elif i == judgelist[2]:
        TLE+=1
    elif i == judgelist[3]:
        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)]
a = s.count("AC")
b = s.count("WA")
c = s.count("TLE")
d = s.count("RE")
print("AC x {}".format(a))
print("WA x {}".format(b))
print("TLE x {}".format(c))
print("RE x {}".format(d))

Submission status: Accepted

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

print("AC x " + str(int(list.count('AC'))))
print("WA x " + str(int(list.count('WA'))))
print("TLE x " + str(int(list.count('TLE'))))
print("RE x " + str(int(list.count('RE'))))

Submission status: Accepted

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

print("AC x",A.count("AC"),"\nWA x",A.count("WA"), "\nTLE x",A.count("TLE"), "\nRE x",A.count("RE"))

Submission status: Accepted

Solution code:
from collections import Counter 

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

c = Counter(s)

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

Submission status: Accepted

Solution code:
def resolve():
	N = int(input())
	lst = [input() for _ in range(N)]
	print(f'AC x {lst.count("AC")}')
	print(f'WA x {lst.count("WA")}')
	print(f'TLE x {lst.count("TLE")}')
	print(f'RE x {lst.count("RE")}')
resolve()

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

ac = sum(x == "AC" for x in results) 
wa = sum(x == "WA" for x in results) 
tle = sum(x == "TLE" for x in results) 
re = sum(x == "RE" for x in results) 

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())
li = []
for i in range(n):
    li.append(input())
print('AC x {}'.format(li.count('AC')))
print('WA x {}'.format(li.count('WA')))
print('TLE x {}'.format(li.count('TLE')))
print('RE x {}'.format(li.count('RE')))

Submission status: Accepted

Solution code:
from collections import Counter

N = int(input())
S = [input() for _ in range(N)]
c = Counter(S)
print("\n".join("{} x {:d}".format(k, c[k]) for k in ["AC", "WA", "TLE", "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 {}\nWA x {}\nTLE x {}\nRE x {}".format(ac,wa,tle,re))

Submission status: Accepted

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

nAC = S.count('AC')
nWA = S.count('WA')
nTLE = S.count('TLE')
nRE = S.count('RE')

print('AC x', int(nAC))
print('WA x', int(nWA))
print('TLE x', int(nTLE))
print('RE x', int(nRE))

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 
    

p = str(d["AC"])
q = str(d["WA"])
r = str(d["TLE"])
s = str(d["RE"])

print("AC x " + p)
print("WA x " + q)
print("TLE x " + r)
print("RE x " + s)

Submission status: Accepted

Solution code:
def main():
    N=int(input())

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

if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

for i in range(N):
  judge=input()
  
  if judge == "AC":
    AC = AC + 1
  if judge == "WA":
    WA = WA + 1
  if judge == "TLE":
    TLE = TLE + 1
  if judge == "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())
eval_list = []
for i in range(N):
  eval_list.append(input())
print('AC x ' + str(eval_list.count('AC')))
print('WA x ' + str(eval_list.count('WA')))
print('TLE x ' + str(eval_list.count('TLE')))
print('RE x ' + str(eval_list.count('RE')))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for _ in range(N)]
# print(S) # ['AC', 'TLE', 'AC', 'AC', 'WA', 'TLE']
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())
ans=defaultdict(int)
for _ in range(n):
  s=str(input())
  c=ans.get(s)
  if c:
  	ans.update({s:c+1})
  else:
    ans.update({s:1})
print("AC x ",ans["AC"])
print("WA x ",ans["WA"])
print("TLE x ",ans["TLE"])
print("RE x ",ans["RE"])

Submission status: Accepted

Solution code:
N = int(input())

S = []
for i in range(N):
    S.append(input())
ac = S.count("AC")
wa = S.count("WA")
tle = S.count("TLE")
re = S.count("RE")

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

Submission status: Accepted

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

for k, v in j_dic.items():
    print(k,"x",v)

Submission status: Accepted

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