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:
# -*- coding: utf-8 -*-
# input
# 配列のinput
n = int(input())
temp_array = []
addlist = temp_array.append
for i in range(n):
    addlist(input())
print('AC x '+str(temp_array.count('AC')))
print('WA x '+str(temp_array.count('WA')))
print('TLE x '+str(temp_array.count('TLE')))
print('RE x '+str(temp_array.count('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
  elif s == 'WA':
    C1 += 1
  elif s == 'TLE':
    C2 += 1
  else:
    C3 += 1
print('AC x ' + str(C0))
print('WA x ' + str(C1))
print('TLE x ' + str(C2))
print('RE x ' + str(C3))

Submission status: Accepted

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

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("AC x", d["AC"])
print("WA x", d["WA"])
print("TLE x", d["TLE"])
print("RE x", d["RE"])

Submission status: Accepted

Solution code:

def b():
    n = int(input())
    AC=0
    WA=0
    TLE=0
    RE=0
    while n:
        n-=1
        t= input()
        if t=='AC':
            AC+=1
        elif t=='WA':
            WA+=1
        elif t=='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)
b()

Submission status: Accepted

Solution code:
n = int(input())
judge = list(input() for _ in range(n))
ac = wa = tle = re = 0
for i in judge:
  if i == 'AC':
    ac = ac + 1
  elif i == 'WA':
    wa = wa + 1
  elif i == 'TLE':
    tle = tle + 1
  elif i == '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())
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())
judges = [input() for s in range(n)]

ac = wa = tle = re = 0
for judge in judges:
  if (judge == "AC"):
    ac += 1
  elif (judge == "WA"):
    wa += 1
  elif (judge == "TLE"):
    tle += 1
  elif (judge == "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())

result = []

for i in range(N):
    result.append(input())

count = [0,0,0,0]

for s in result:
    if s == "AC":
        count[0] += 1
    if s == "WA":
        count[1] += 1
    if s == "TLE":
        count[2] += 1
    if s == "RE":
        count[3] += 1

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

Submission status: Accepted

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

print('AC x ', 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):
    ss = input()
    s.append(ss)
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)]

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

for k in s:
    res[k] = res[k] + 1

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

Submission status: Accepted

Solution code:
N = int(input())

ACcount = 0 
WAcount = 0
TLEcount = 0
REcount = 0
for i in range(N):
	S=input()

	if S == "AC":
		ACcount = ACcount + 1
	elif S == "WA":
		WAcount = WAcount + 1
	elif S == "TLE":
		TLEcount = TLEcount + 1
	elif S == "RE":
		REcount = REcount + 1

print("AC x", ACcount)
print("WA x", WAcount)
print("TLE x", TLEcount)
print("RE x", REcount)

Submission status: Accepted

Solution code:
N = int(input())
S = []
C = [0,0,0,0]

for n in range(N):
    S.append(input())

for n in range(N):
    if S[n] == "AC":
        C[0] += 1
    elif S[n] == "WA":
        C[1] += 1
    elif S[n] == "TLE":
        C[2] += 1
    else:
        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:

d=dict()
d["AC"]=0
d["WA"]=0
d["TLE"]=0
d["RE"]=0
t=int(input())
while t:
	t-=1
	s=input()
	d[s]+=1
#print(d)
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())
result_list = []
for i in range(N):
	result_list.append(input())
count_ac = result_list.count("AC")
count_wa = result_list.count("WA")
count_tle = result_list.count("TLE")
count_re = result_list.count("RE")

print("AC x {}".format(count_ac))
print("WA x {}".format(count_wa))
print("TLE x {}".format(count_tle))
print("RE x {}".format(count_re))

Submission status: Accepted

Solution code:

# ABC173
# B Judge Status Summary
N = int(input())
S = [input() for i in range(N)]
print("AC x", S.count("AC"))
print("WA x", S.count("WA"))
print("TLE x", S.count("TLE"))
print("RE x", S.count("RE"))

Submission status: Accepted

Solution code:
n = int(input(''))
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
    else:
        None

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

Submission status: Accepted

Solution code:
num=int(input().rstrip())
cases=[]
for i in range(num):
    cases.append(input().rstrip())
target=['AC','WA','TLE','RE']
result=[0,0,0,0]
for j in range(len(target)):
    for i in range(len(cases)):
        if cases[i]==target[j]:
            result[j]=result[j]+1
for i in range(len(target)):
    print(target[i]+' x '+str(result[i]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
N=int(input())
ll=[]
for i in range(N):
    ll.append(input())
c=Counter(ll)
print("AC x {}".format(c['AC']))
print("WA x {}".format(c['WA']))
print("TLE x {}".format(c['TLE']))
print("RE x {}".format(c['RE']))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
AC, WA, TLE, RE = 0, 0, 0, 0
for i in range(N):
  temp = input()
  if temp == 'AC':
    AC += 1
  elif temp == 'WA':
    WA += 1
  elif temp == '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())
judge = [0]*n
for _ in range(n):
  judge[_] = input()
# print(judge.count('AC'))

ac, wa, tle, re = 0, 0, 0, 0
for c in judge:
  if c=='AC':
    ac += 1
  elif c=='WA':
    wa += 1
  elif c=='TLE':
    tle += 1
re = n - (ac+wa+tle)
# print(ac, wa, tle, re)
judges = [ac, wa, tle, re]
judge_c = ["AC","WA","TLE","RE"]
for i in range(len(judge_c)):
  print(f'{judge_c[i]} x {judges[i]}')

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())
lst = "AC,WA,TLE,RE".split(',')
mp = {s : 0 for s in lst}
for i in range(N):
    S = input().strip()
    mp[S] += 1
for s in lst:
    print(f'{s} x {mp[s]}')

Submission status: Accepted

Solution code:
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
    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:
x=int(input())
b=0;
lst=[]
acs=0
was=0
res=0
tles=0
while(b<x):
    new=input()
    lst.append(new)
    b+=1
for c in lst:
    if(c=='AC'):
        acs+=1
    if(c=='WA'):
        was+=1
    if(c=='RE'):
        res+=1
    if(c=='TLE'):
        tles+=1
print('AC x '+str(acs))
print('WA x '+ str(was))
print('TLE x ' +str(tles))
print('RE x ' +str(res))

Submission status: Accepted

Solution code:
import datetime
import string
import re
import math

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

N = int(input())
for i in range(N):
    aDic[input()] += 1

for page in aDic:
    print(page + ' x ' + str(aDic[page]))

Submission status: Accepted

Solution code:
n = int(input())
ans_list = [['AC',0],['WA',0],['TLE',0],['RE',0]]
for i in range(0,n):
    s = str(input())
    for j in range(0,4):
        if ans_list[j][0] == s:
            ans_list[j][1] += 1

for j in range(0,4):
    print(ans_list[j][0],'x',ans_list[j][1])

Submission status: Accepted

Solution code:
n = int(input())
s = ""
ac=0
wa=0
tle=0
re=0

for i in range(n):
    s = input()

    if s == 'AC':
        ac = ac+1
    elif s == 'TLE':
        tle = tle+1
    elif s == 'WA':
        wa = wa+1
    elif s == 'RE':
        re = re+1

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

Submission status: Accepted

Solution code:
def B():
    n, *s = open(0).read().split()
    import collections
    c = collections.Counter(s)
    ret_l = ["AC","WA","TLE","RE"]
    for t in ret_l:
        print(t +  " x " + str(c[t]))
B()

Submission status: Accepted

Solution code:
def B():
    n = int(input())
    s = []
    for _ in range(n):
        s.append(input())
    import collections
    c = collections.Counter(s)
    ret_l = ["AC","WA","TLE","RE"]
    for t in ret_l:
        print(t +  " x " + str(c[t]))
B()

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
#template
N = int(input())
li = [0]*N
for i in range(N):
    li[i] = input()
from collections import Counter
dic = Counter(li)
keys = ["AC","WA","TLE","RE"]
for key in keys:
    print(key,"x",str(dic[key]))

Submission status: Accepted

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

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:
dic = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
n = int(input())
for i in range(n):
    si = input()
    dic[si] += 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:
re=0
tle=0
wa=0
ac=0
ip=[]
n=int(input())
for i in range(n):
  ip.append(input())
for i in range(n):
  if ip[i]=="AC":
    ac=ac+1
  if ip[i]=="TLE":
    tle=tle+1
  if ip[i]=="WA":
    wa=wa+1
  if ip[i]=="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:
from collections import defaultdict
case = defaultdict(int)
N = int(input())
for _ in range(N):
  case[input()] += 1
lst = ['AC', 'WA', 'TLE', 'RE']
for i in lst:
  print(i, 'x', case[i])

Submission status: Accepted

Solution code:
n = int(input())
ac = wa = tle = re = 0
while n > 0:
    j = input()
    if j == 'AC':
        ac += 1
    if j == 'WA':
        wa += 1
    if j == 'TLE':
        tle += 1
    if j == 'RE':
        re += 1
    n -= 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

N = int(input())
mem = defaultdict()
mem["AC"] = 0
mem["WA"] = 0
mem["TLE"] = 0
mem["RE"] = 0
for i in range(N):
    inp = input()
    mem[inp] += 1
print("AC x " + str(mem["AC"]))
print("WA x " + str(mem["WA"]))
print("TLE x " + str(mem["TLE"]))
print("RE x " + str(mem["RE"]))

Submission status: Accepted

Solution code:
n = int(input())

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

for i in range(n):
  r = input()
  di[r] += 1
 
for i in di.keys():
  print("{} x {}".format(i,di[i]))

Submission status: Accepted

Solution code:
N = int(input())

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

c = [s.count('AC'),s.count('WA'),s.count('TLE'),s.count('RE')]
d = ['AC','WA','TLE','RE']

for i in range(4):
    print(d[i]+' '+'x'+' '+str(c[i]) )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict

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

kind = ["AC","WA","TLE","RE"]
d = defaultdict(int)
for i in range(N):
    d[S[i]] += 1

for i in range(len(kind)):
    print("{} x {}".format(kind[i],d[kind[i]]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

count = Counter(s)

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

Submission status: Accepted

Solution code:
N = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for i in range(0, N):
  val = input()
  if val == "AC":
      c0 += 1
  elif val == "WA":
      c1 += 1
  elif val == "TLE":
      c2 += 1
  else :
      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=[]
cnt=[0 for i in range(4)]
for i in range(N):
    s.append(input())

for i in range(N):
    if s[i]=="AC":
        cnt[0]+=1
    elif s[i]=="WA":
        cnt[1]+=1
    elif s[i]=="TLE":
        cnt[2]+=1
    elif s[i]=="RE":
        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())
lst=[input() for i in range(n)]

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

Submission status: Accepted

Solution code:
def main(istr, ostr):
    n = int(istr.readline())
    types = ["AC", "WA", "TLE", "RE"]
    counts = dict((t, 0) for t in types)
    for i in range(n):
        t = istr.readline().strip()
        counts[t] += 1
    for k, v in counts.items():
        print(f"{k} x {v}", file=ostr)


if __name__ == "__main__":
    import sys

    main(sys.stdin, sys.stdout)

Submission status: Accepted

Solution code:
n=int(input())
list=[input() for i in range(n)]
ans_AC=len([1 for x in list if x=="AC"])
ans_WA=len([1 for x in list if x=="WA"])
ans_TLE=len([1 for x in list if x=="TLE"])
ans_RE=len([1 for x in list if x=="RE"])
print("AC x "+str(ans_AC))
print("WA x "+str(ans_WA))
print("TLE x "+str(ans_TLE))
print("RE x "+str(ans_RE))

Submission status: Accepted

Solution code:
n=int(input())
lst_s=list()

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

for i in range(n):
    s=input().upper()
    lst_s.append(s)

for s in lst_s:
    for verdict in verdicts:
        if s == verdict:
            verdicts[s] += 1

for verdict in verdicts:
    print(verdict, "x", verdicts[verdict])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
mo = 10**9+7

def main():
    N = II()
    ans = [0,0,0,0]
    for i in range(N):
        S = IS()
        if S == 'AC': ans[0]+=1
        elif S == 'WA': ans[1]+=1
        elif S == 'TLE': ans[2]+=1
        elif S == '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]))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
  string = input()
  if string == 'AC':
    ac += 1
  elif string == 'WA':
    wa += 1
  elif string == '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())
result = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for i in range(n):
  s = input()
  result[s] += 1
print('AC x',result['AC'])
print('WA x',result['WA'])
print('TLE x',result['TLE'])
print('RE x',result['RE'])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
A = [str(input()) for _ in range(n)]
# print(n,A)
kindl = ["AC","WA","TLE","RE"]

for i in range(4):
    countkindl = A.count(kindl[i])
    print(kindl[i] + " x " + str(countkindl))

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

N = I()
#H,N = LI()
# 頻度 counter
S = [_S() for _ in range(N)]
c = collections.Counter(S)

result = ['AC', 'WA', 'TLE', 'RE']
for j in result:
    print(j + ' x ' + str(c[j]))

Submission status: Accepted

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


def main():
    n = int(input())
    s = [input() for i in range(n)]
    for i in ["AC", "WA", "TLE", "RE"]:
        print(i + " x " + str(s.count(i)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter

N,S = int(input()),[]
for _ in range(N):
	S.append(input())
c = 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 i in range(n)]
for v in ['AC', 'WA', 'TLE', 'RE']:
    print('{0} x {1}'.format(v, s.count(v)))

Submission status: Accepted

Solution code:
from collections import defaultdict
N = int(input())
S = [input() for _ in range(N)]
d = defaultdict(int)
for s in S:
    d[s] += 1

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N=int(input())
res=[0]*4
for i in range(N):
    moji=input()
    if moji == 'AC':
        res[0] += 1
    elif moji == 'WA':
        res[1] += 1
    if moji == 'TLE':
        res[2] += 1
    if moji == '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:
import sys

N = int(input())
S = sys.stdin.readlines()
C = [0] * 4

for i in range(N):
  if S[i].rstrip() == 'AC':
    C[0] += 1
    continue
  if S[i].rstrip() == 'WA':
    C[1] += 1
    continue
  if S[i].rstrip() == 'TLE':
    C[2] += 1
    continue
  if S[i].rstrip() == 'RE':
    C[3] += 1
    continue

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = int(input())

c1, c2, c3, c4 = 0, 0, 0, 0
for i in range(t):
	s = input()
	if s == 'AC':
		c1 += 1
	elif s == 'TLE':
		c2 += 1
	elif s == 'WA':
		c3 += 1
	else:
		c4 += 1
print('AC x', c1)
print('WA x', c3)
print('TLE x', c2)
print('RE x', c4)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
def main():
	N = int(input())
	S = [input() for i in range(N)]
	testcase = ['AC','WA','TLE','RE']
	for v in testcase:
		print(v, ' x ', S.count(v))


if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

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

for i in judge_list:
    judge_dict[i] = judge_dict[i] + 1

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

Submission status: Accepted

Solution code:
from collections import Counter

cnt = Counter()
num = int(input())
for ans in [input() for i in range(num)]:
    cnt[ans] += 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:
dic={}

n=int(input())

for i in range(n):
  x=input()
  if x in dic:
    dic[x]=dic[x]+1
  else:
    dic[x]=1

print("AC x {}".format(dic.get("AC",0)))
print("WA x {}".format(dic.get("WA",0)))
print("TLE x {}".format(dic.get("TLE",0)))
print("RE x {}".format(dic.get("RE",0)))

Submission status: Accepted

Solution code:
N = int(input())
C = [0 for _ in range(4)]
result = ["AC", "WA", "TLE", "RE"]

for _ in range(N):
  S = input()
  for i in range(4):
    if S == result[i]:
      C[i] += 1
      break

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

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
var = [str(input()) for i in range(N)]

judges = ['AC', 'WA', 'TLE', 'RE']
for j in judges:
    print('{} x {}'.format(j, (np.array(var) == j).sum()))

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.8.2)

import math
import statistics
import numpy as np
import queue
import itertools
import functools 

status = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(int(input())):
	s = input()
	status[s] += 1

for st in status:
  print('{} x {}'.format(st, status[st]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for i 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:
ac=0
wa=0
tle=0
re=0
for _ in range(int(input())):
  s=input()
  if(s=="AC"):
    ac+=1
  if s=="WA":
    wa+=1
  if s=="TLE":
    tle+=1
  if s=="RE":
    re+=1
print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Submission status: Accepted

Solution code:
import sys
N = int(input())
base = ['AC','WA','TLE','RE']
array = [ input() for a in range(N) ]

if not ( 1 <= N <= 10**5 ): sys.exit()
for I in array:
    if I not in base: sys.exit()

for I in base:
    print(I+' x '+str(array.count(I)))

Submission status: Accepted

Solution code:
import sys
N = int(input())
array = [ input() for a in range(N) ]
base = ['AC','WA','TLE','RE']

for I in base:
    print(I+' x '+str(array.count(I)))

Submission status: Accepted

Solution code:
import math
def gcd(a,b): 
    if(b==0): 
        return a 
    else: 
        return gcd(b,a%b) 

    
n = int(input())
d = {'AC':0, 'WA': 0, 'TLE': 0, 'RE': 0 }
for i in range(n):
    s = str(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:
a = ["AC", "WA", "TLE", "RE"]
ans = [0]*4
n = int(input())
l = [input() for _ in range(n)]
for i in l:
    for j in range(4):
        if i == a[j]:
            ans[j] += 1

for k in range(4):
    print(a[k] + " x " + str(ans[k]))

Submission status: Accepted

Solution code:
n = int(input())

x = [input() for i in range(n)]

print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}'.format(x.count('AC'), x.count('WA'), x.count('TLE'), x.count('RE')))

Submission status: Accepted

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

n = int(input())

x = [input().rstrip() for i in range(n)]

print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}'.format(x.count('AC'), x.count('WA'), x.count('TLE'), x.count('RE')))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - Judge Status Summary


def main(n, s):
    result_table = {
        'AC': 0,
        'WA': 0,
        'TLE': 0,
        'RE': 0
    }
    for i in s:
        result_table[i] += 1
    return result_table


if __name__ == "__main__":
    n = int(input())
    s = []
    for i in range(n):
        s.append(input())
    results = main(n, s)
    for key, value in results.items():
        print(f"{key} x {value}")

Submission status: Accepted

Solution code:
n = int(input())
a = []

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

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:

n = int(input())

res = [0,0,0,0]
for _ in range(n):
    tmp = input()
    if tmp == "AC":
        res[0] +=1
    elif tmp == "WA":
        res[1] +=1
    elif tmp == "TLE":
        res[2] +=1
    elif tmp == "RE":
        res[3] +=1

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

Submission status: Accepted

Solution code:
AC = WA = TLE = RE = 0
N = int(input()) #1行目のNを取得する

s = [input() for i in range(N)] #複数行の数値の入力を取得

for v in s:
    if(v == "AC"):
        AC+=1
    elif(v == "WA"):
        WA+=1
    elif(v == "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())
S = [input() for i in range(N)]
for v in ['AC', 'WA', 'TLE', 'RE']:
	print('{0} x {1}'.format(v, S.count(v)))