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

N = int(input())
ans = Counter()
for i in range(0, N):
    c = str(input())
    ans[c] += 1
print('AC x {}'.format(ans['AC']))
print('WA x {}'.format(ans['WA']))
print('TLE x {}'.format(ans['TLE']))
print('RE x {}'.format(ans['RE']))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N=int(input())
list =[input() for i in range(N)]
count_AC=0
count_WA=0
count_TLE=0
count_RE=0
for i in range(N):
    if list[i] == "AC":
        count_AC+=1
    elif list[i] == "WA":
        count_WA+=1
    elif list[i] == "TLE":
        count_TLE+=1
    elif list[i] == "RE":
        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())
s = [input() for _ in range(n)]
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 = []
AC = 0
WA = 0
TLE = 0
RE = 0
for _ in range(n):
    s.append(input())
for i in range(len(s)):
    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 " + 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 _ in range(N):
    judge = input()
    if judge == "AC":
        ac += 1
    if judge == "WA":
        wa += 1
    if judge == "TLE":
        tle += 1
    if 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:
l={'AC':0,'WA':0,'TLE':0,'RE':0}

n=int(input())
for i in range(n):
  l[input()]+=1
for i in l:
  print(i,"x",l[i])

Submission status: Accepted

Solution code:
data = {'AC':0,'WA':0,'TLE':0,'RE':0}
N = int(input())
for i in range(N):
  inputSTR = input()
  data[inputSTR] = data[inputSTR] + 1
  
for key,value in data.items():
  print(key + ' x ' + str(value))

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

Submission status: Accepted

Solution code:
N = int(input())
list1=[]
for i in range(N):
  a = input()
  list1.append(a)  
  
a = list1.count('AC')
b = list1.count('WA')
c = list1.count('TLE')
d = list1.count('RE')
list2 = [a,b,c,d]
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())
d = {
	'AC': 0,
	'WA': 0,
	'TLE': 0,
	'RE': 0
}

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

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

Submission status: Accepted

Solution code:
n = int(input())
freq = {k: 0 for k in ['AC', 'WA', 'TLE', 'RE']}
for _ in range(n):
    freq[input()] += 1
for k, v in freq.items():
    print(f'{k} x {v}')

Submission status: Accepted

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

for k, v in ans.items():
    print(f'{k} x {v}')

Submission status: Accepted

Solution code:
n = int(input())
ac = 0
tle = 0
wa = 0
re = 0
for i in range(n):
    s = input()
    if s == 'AC':
        ac += 1
    elif s == 'TLE':
        tle += 1
    elif s == 'WA':
        wa += 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())
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:
number = int(input())
 
ac = 0
wa = 0
tle = 0
re = 0
for i in range(number):
  character = input()
  if character == 'AC':
    ac += 1
  if character == 'WA':
    wa += 1
  if character == 'TLE':
    tle += 1
  if character == '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())
l = []
for i in range(n):
    a = input()
    l.append(a)
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:
types = ['AC', 'WA', 'TLE', 'RE']
cntLn = [0] * 4
N = int(input())
for i in range(N):
    tmp = input()
    try:
        idx = types.index(tmp)
        cntLn[idx] += 1
    except ValueError as err:
        print("This is value error. -> ", err)
        exit()
for num, value in enumerate(types):
    print(value, "x", str(cntLn[num]))

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())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
  s = input()
  if s == 'AC':
    ac += 1
  elif s == 'WA':
    wa += 1
  elif s== 'TLE':
    tle += 1
  elif s== 'RE':
    re += 1
print('AC x '+str(ac)) 
print('WA x '+str(wa)) 
print('TLE x '+str(tle)) 
print('RE x '+str(re))

Submission status: Accepted

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

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

l = ["AC", "WA", "TLE", "RE"]
for i in range(4):
    print("{} x {}".format(l[i], j[i]))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#input
n = int(input())
AC, WA, TLE, RE = 0, 0, 0, 0
for _ in range(n):
    s = str(input())
    if s == "AC":
        AC += 1
    elif s == "WA":
        WA += 1
    elif s == "TLE":
        TLE += 1
    else:
        RE += 1

#output
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:
from sys import stdin,stdout
d={}
for _ in range(int(stdin.readline())):
    #n=int(stdin.readline())
    s=input()
    d[s]=d.get(s,0)+1
print('AC x',d.get('AC',0))
print('WA x',d.get('WA',0))
print('TLE x',d.get('TLE',0))
print('RE x',d.get('RE',0))

Submission status: Accepted

Solution code:
from collections import defaultdict

types = ['AC', 'WA', 'TLE', 'RE']
num = int(input())
categories = defaultdict(int)

for i in range(num):
    categories[input()] += 1

for i in types:
    print("{} x {}".format(i, categories[i]))

Submission status: Accepted

Solution code:
N = int(input())
L=[input() for i 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 sys
a=[]
l=0
C0=0
C1=0
C2=0
C3=0
names=["AC","WA","TLE","RE"] 
for i in sys.stdin:
  a.append(i.rstrip('\n'))
  if a[l]==names[0]:
    C0+=1
  elif a[l]==names[1]:
    C1+=1
  elif a[l]==names[2]:
    C2+=1
  elif a[l]==names[3]:
    C3+=1
  l+=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())
testcase = []
for n in range(n):
    testcase.append(input())
    
    
print("AC x ",testcase.count("AC"))
print("WA x ",testcase.count("WA"))
print("TLE x ",testcase.count("TLE"))
print("RE x ",testcase.count("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:
num = int(input())
ac = 0
tle = 0
wa = 0
re = 0
 
for i in range(num):
  word = input()
  if word == "AC":
    ac += 1
  if word == "TLE":
    tle += 1
  if word == "WA":
    wa += 1
  if word == "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:
mp1 = {}
mp2 = {}
cnt = [0] * 4

mp1['AC'] = 0
mp1['WA'] = 1
mp1['TLE'] = 2
mp1['RE'] = 3

mp2[0] = 'AC'
mp2[1] = 'WA'
mp2[2] = 'TLE'
mp2[3] = 'RE'

n = int(input())

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

for i in range(4):
	print(mp2[i], 'x', cnt[i])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

N = int(input())
L = [input() for _ in range(N)]
c = collections.Counter(L)
V = ["AC", "WA", "TLE", "RE"]
for v in V:
    print("{} x {}".format(v, c[v]))

Submission status: Accepted

Solution code:
N = int(input()) #1行目のNを取得する
AC=0
WA=0
TLE=0
RE=0
for i in range(N):
  word=input()
  if(word=='AC'):
    AC+=1
  elif(word=='WA'):
    WA+=1
  elif(word=='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 )

Submission status: Accepted

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

print("AC x %d" % str.count("AC"))
print("WA x %d" % str.count("WA"))
print("TLE x %d" % str.count("TLE"))
print("RE x %d" % str.count("RE"))

Submission status: Accepted

Solution code:
from itertools import groupby
n = int(input())
s = [input() for _ in range(n)]
print('AC x {}'.format(s.count('AC')))
print('WA x {}'.format(s.count('WA')))
print('TLE x {}'.format(s.count('TLE')))
print('RE x {}'.format(s.count('RE')))

Submission status: Accepted

Solution code:
n = int(input())

dic = {}
dic["AC"] = 0
dic["WA"] = 0
dic["TLE"] = 0
dic["RE"] = 0

for e in range(n):
	entrada = input()
	if entrada == "AC":
		dic["AC"] += 1
	elif entrada == "WA":
		dic["WA"] += 1
	elif entrada == "TLE":
		dic["TLE"] += 1
	elif entrada == "RE":
		dic["RE"] += 1
		
print("AC x %d"% dic["AC"])
print("WA x %d"% dic["WA"])
print("TLE x %d"% dic["TLE"])
print("RE x %d"% dic["RE"])

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    n=int(readline())
    li=[0]*4
    for i in range(n):
        tmp=readline().strip()
        if tmp=="AC":
            li[0]+=1
        elif tmp=="WA":
            li[1]+=1
        elif tmp=="TLE":
            li[2]+=1
        elif tmp=="RE":
            li[3]+=1
    
    for i in range(4):
        if i==0:
            print("AC x {}".format(li[0]))
        elif i==1:
            print("WA x {}".format(li[1]))
        elif i==2:
            print("TLE x {}".format(li[2]))
        elif i==3:
            print("RE x {}".format(li[3]))

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(0,N):
  j = str(input())
  if j == "AC":
    AC+=1
  elif j == "WA":
    WA+=1
  elif j == "TLE":
    TLE+=1
  else:
    RE+=1
print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))

Submission status: Accepted

Solution code:
from collections import Counter
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    N, *S = read().split() 
    
    d = Counter(S)
    for result in ['AC','WA','TLE','RE']:
        if result in d:
            print(f"{result} x {d[result]}")
        else:
            print(f"{result} x 0")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

for judge in judges:
    count = len([x for x in S if x == judge])
    print('{} x {}'.format(judge, count))

Submission status: Accepted

Solution code:
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(int(input())):
	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:
from collections import defaultdict

N = int(input())
dic = defaultdict(int)
for i in range(N):
    dic[input()] += 1
keys = ["AC", "WA", "TLE", "RE"]
for k in keys:
    print(k, "x", dic[k])

Submission status: Accepted

Solution code:
N = int(input())
nAC = 0
nWA = 0
nTLE = 0
nRE = 0
for i in range(N):
  S = input()
  if S == "AC":
    nAC += 1
  if S == "WA":
    nWA += 1
  if S == "TLE":
    nTLE += 1
  if S == "RE":
    nRE += 1
print("AC x %d" % nAC)
print("WA x %d" % nWA)
print("TLE x %d" % nTLE)
print("RE x %d" % nRE)

Submission status: Accepted

Solution code:
n=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(n):
    x=input()
    if(x=="AC"):
        AC+=1
    elif(x=="WA"):
        WA+=1
    if(x=="TLE"):
        TLE+=1
    if(x=="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_count = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

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

print('AC x ' + str(d_count['AC']))
print('WA x ' + str(d_count['WA']))
print('TLE x ' + str(d_count['TLE']))
print('RE x ' + str(d_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(f"AC x {c0}")
print(f"WA x {c1}")
print(f"TLE x {c2}")
print(f"RE x {c3}")

Submission status: Accepted

Solution code:
import math
import collections


def main():
  N = int(input())
  S = [input() for _ in range(N)]
  
  A = collections.Counter(S)
  
  
  print('AC x ' + str(A['AC']))
  print('WA x ' + str(A['WA']))
  print('TLE x ' + str(A['TLE']))
  print('RE x ' + str(A['RE']))
  
  
  
main()

Submission status: Accepted

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

n = int(input())

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

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


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

Submission status: Accepted

Solution code:
import sys
from collections import Counter

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

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

solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
from collections import Counter
def input(): return sys.stdin.readline().rstrip()

def main():
    list = []
    for _ in range(0, int(input())):
        list.append(input())
    counter = Counter(list)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
result = []
for i in range(0,(N)):
    A = input()
    if A:
        result.append(A)
AC = result.count("AC")
WA = result.count("WA")
TLE = result.count("TLE")
RE = result.count("RE")
print(f"AC x {AC}\nWA x {WA}\nTLE x {TLE}\nRE x {RE}\n")

Submission status: Accepted

Solution code:
n=int(input())
ac,wa,tle,re=0,0,0,0
for i in range(n):
  hoge=input()
  if(hoge=="AC"):
    ac+=1
  elif(hoge=="WA"):
    wa+=1
  elif(hoge=="TLE"):
    tle+=1
  elif(hoge=="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:
from collections import defaultdict as dc
d=dc(lambda:0)
st=['AC','WA','TLE','RE']
for n in range(int(input())):
    s=input()
    d[s]+=1
for n in st:
	print(n,'x',d[n])

Submission status: Accepted

Solution code:
import collections


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

C = collections.Counter(S)

WL = ['AC','WA','TLE','RE'] 
for s in WL:
    print(s + ' x ' + str(C[s]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
"""
N = int(input())
S = [0 for i in range(N)]
ans = {
    "AC":0,
    "WA":0,
    "TLE":0,
    "RE":0
}
for i in range(N):
    S[i] = str(input())
    ans[S[i]] += 1

for key in ans.keys():
    print(key + " x " + str(ans[key]))
"""
N = int(input())
S = []
for i in range(N):
    S.append(str(input()))

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

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

Submission status: Accepted

Solution code:
from collections import Counter
from sys import stdin
N = int(stdin.readline().rstrip())
S = Counter([stdin.readline().rstrip() for _ in range(N)])
for s in ['AC', 'WA', 'TLE', 'RE']:
    print(s + ' x ' + str(S[s]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())

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


for _ in range(0,n):
  x=input()
  if x=="AC":
    a+=1
  elif x=="WA":
    w+=1
  elif x=="TLE":
    t+=1
  else:
    r+=1
print("AC x " + str(a))
print("WA x " + str(w))
print("TLE x " + str(t))
print("RE x " + str(r))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
import numpy as np
results = np.array([0,0,0,0])
for i in range(N):
  result = input()
  if result == 'AC':
    results[0]=results[0]+1
  elif result == 'WA':
    results[1]=results[1]+1
  elif result == 'TLE':
    results[2]=results[2]+1
  elif result == 'RE':
    results[3]=results[3]+1
print("AC x "+str(results[0]))
print("WA x "+str(results[1]))
print("TLE x "+str(results[2]))
print("RE x "+str(results[3]))

Submission status: Accepted

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

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 = AC+1
  elif S[i] == 'WA':
    WA = WA+1
  elif S[i] == 'TLE':
    TLE = TLE+1
  else:
    RE = 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())
ans = [0, 0, 0, 0]
s = [input() for i in range(n)]
for j in s:
  if j == "AC":
    ans[0]+=1
  elif j == "WA":
    ans[1]+=1
  elif j == "TLE":
    ans[2]+=1
  elif j == "RE":
    ans[3]+=1
num = 0
for list1 in ["AC", "WA", "TLE", "RE"]:
  print(list1 + " x " + str(ans[num]))
  num += 1

Submission status: Accepted

Solution code:
import collections

def main():
    N = int(input())
    S = []
    [S.append(input()) for i in range(N)]
    c = collections.Counter(S)
    l = ["AC", "WA", "TLE", "RE"]
    
    for i in l:
        print(i, "x", c[i])

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
res = [input() for _ in range(n)]
cnt = ['AC', 'WA', 'TLE', 'RE']


for c in cnt:
    print(c, 'x', res.count(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ac = 0
wa = 0
tle = 0
re = 0
 
n = int(input())
 
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',ac)
print('WA','x',wa)
print('TLE','x',tle)
print('RE','x',re)

Submission status: Accepted

Solution code:
n = int(input())
S=[]
for i in range(n):
    s=input()
    S.append(s)
from collections import Counter
c0=c1=c2=c3=0
for i in S:
    if i=="AC":
        c0+=1
    elif i=="WA":
        c1+=1
    elif i=="TLE":
        c2+=1
    elif 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:
AC = 0
WA = 0
TLE = 0
RE = 0

a_list = [input() for j in range(int(input()))]

for a in a_list:
  if a == "AC":
    AC += 1
  elif a == "WA":
    WA += 1
  elif a == "TLE":
    TLE += 1
  else:
    RE += 1
  
print(f"AC x {AC}\nWA x {WA}\nTLE x {TLE}\nRE x {RE}")

Submission status: Accepted

Solution code:
n = int(input())
s = [input() for nesya in range(n)]
a,w,t,r = 0,0,0,0
for b in s:
  if b == 'AC':
    a += 1
  elif b == 'WA':
    w += 1
  elif b == 'TLE':
    t += 1
  else:
    r += 1
print('AC x '+str(a))
print('WA x '+str(w))
print('TLE x '+str(t))
print('RE x '+str(r))

Submission status: Accepted

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

N = int(input())

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

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

Submission status: Accepted

Solution code:
n=int(input())
acount,wcount,tcount,rcount=0,0,0,0
for _ in range(n):
    ans=input()
    if ans=="AC":
        acount+=1
    elif ans=="WA":
        wcount+=1
    elif ans=="TLE":
        tcount+=1
    else:
        rcount+=1
print(f"AC x {acount:}\nWA x {wcount:}\nTLE x {tcount:}\nRE x {rcount:}")

Submission status: Accepted

Solution code:
n = int(input())

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

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

print('AC x {}\nWA x {}\nTLE x {}\nRE x {}\n'.format(d['AC'], d['WA'], d['TLE'], d['RE']))

Submission status: Accepted

Solution code:
n = int(input())
ans = {}
for _ in range(n):
  s = input()
  if s in ans.keys():
    ans[s] += 1
  else:
    ans[s] = 1
for i in ['AC', 'WA', 'TLE', 'RE']:
  if not i in ans.keys():
    ans[i] = 0
  print('%s x %s ' %(i, ans[i]))

Submission status: Accepted

Solution code:
a = int(input())

B = []

for i in range(a):
    B.append(input())

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

for i in range(a):
    if B[i] == "AC":
        AC += 1
    elif B[i] == "TLE":
        TLE += 1
    elif B[i] == "WA":
        WA += 1
    elif B[i] == "RE":
        RE += 1

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

Submission status: Accepted

Solution code:
n=int(input())
a,b,c,d=0,0,0,0
for i in range(n):
    s=input()
    if s=='AC':
        a=a+1
    elif s=='WA':
        b=b+1
    elif s=='TLE':
        c=c+1
    else:
        d=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())
lst = ['AC', 'WA', 'TLE', 'RE']
dic = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(n):
  s = input()
  dic[s] += 1
for judge in lst:
  print(judge, 'x', dic[judge])

Submission status: Accepted

Solution code:
N = int(input())
l = []
for i in range(0,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:
dic = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for i in range(int(input())):
    s = input()
    dic[s] += 1
print("AC x {}".format(dic["AC"]))
print("WA x {}".format(dic["WA"]))
print("TLE x {}".format(dic["TLE"]))
print("RE x {}".format(dic["RE"]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
testc=int(input())
ac=0
wa=0
tle=0
re=0
i=0
while(i<testc):
	t=input()
	if(t=="AC"):
		ac+=1
	elif(t=="WA"):
		wa+=1
	elif(t=="TLE"):
		tle+=1
	else:
		re+=1
	i+=1
print("AC x" , ac)
print("WA x" , wa)
print("TLE x" , tle)
print("RE x" , re)

Submission status: Accepted

Solution code:
dic = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(int(input())):
  res = input()
  dic[res] += 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 = 0
S = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

try:
  N = int(input())
  for i in range(N):
      result = input()
      for k in S:
          if k == result:
              S[k] += 1
except:
  pass

for k in S:
    print('%s x %d' % (k, S[k]))