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:
size = int(input())
arr = [str(input()) for i in range(size)]
x = arr.count("AC")
y = arr.count("WA")
z = arr.count("TLE")
w = arr.count("RE")
print("AC x ",x)
print("WA x ",y)
print("TLE x ",z)
print("RE x ",w)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
data = [input() for _ in range(n)]
a = data.count("AC")
b = data.count("WA")
c = data.count("TLE")
d = data.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())
#A = [input() for i in range(n)]
C = [0,0,0,0]

for i in range(n):
    s = input()
    if s == "AC":
        C[0] +=1
    elif s == "WA":
        C[1] += 1
    elif s == "TLE":
        C[2] += 1
    else:
        C[3] += 1 
print('AC x '+str(C[0]))
print('WA x '+str(C[1]))
print('TLE x '+str(C[2]))
print('RE x '+str(C[3]))

Submission status: Accepted

Solution code:
dic = {}
dic['AC']=0
dic['WA']=0
dic['TLE']=0
dic['RE']=0
for I in range(int(input())):
    s = input()
    dic[s]+=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:
try:
    N = int(input())
    
    if N>=1 and N<=10**5:
        dic = {'AC':0,'WA':0,'TLE':0,'RE':0}
        
        while N>0:
            
            case = input()
            
            if case in dic:
                dic[case] +=1
            
            N-=1
        for key in dic:
            print(key," x ",dic[key])
        
        
except Exception as e:
    print(e)

Submission status: Accepted

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

AC = s.count("AC")
WA = s.count("WA")
TLE = s.count("TLE")
RE = s.count("RE")

AC2 = "AC x " + str(AC)
WA2 = "WA x " + str(WA)
TLE2 = "TLE x " + str(TLE)
RE2 = "RE x " + str(RE)

list = [AC2,WA2,TLE2,RE2]
list_n = "\n".join(list)
print(list_n)

Submission status: Accepted

Solution code:

n = int(input())

s = [input() for _ in range(n)]
ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
	if s[i] == 'AC':
		ac += 1
	elif s[i] == 'WA':
		wa += 1
	elif s[i] == 'TLE':
		tle += 1
	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())
c1=0
c2=0
c3=0
c4=0
s1='AC'
s2='WA'
s3='TLE'
s4='RE'
for _ in range(n):
	str1=str(input())
	if(str1=='AC'):
		c1=c1+1
	elif(str1=='WA'):
		c2=c2+1
	elif(str1=='TLE'):
		c3=c3+1
	elif(str1=='RE'):
		c4=c4+1
s1=s1+' ' + 'x' + ' ' + str(c1)
s2=s2+' ' + 'x' + ' ' + str(c2)
s3=s3+' ' + 'x' + ' ' + str(c3)
s4=s4+' ' + 'x' + ' ' + str(c4)

print(s1)
print(s2)
print(s3)
print(s4)

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for i in range(N)]
CA= 0
CW= 0
CT=0
CR=0
for i in S:
  if i == "AC":
    CA += 1
  elif i == "WA":
    CW += 1
  elif i == "TLE":
    CT += 1
  elif i == "RE":
    CR += 1
  else:
    pass
  
print("AC x %d" % (CA))
print("WA x %d" % (CW))
print("TLE x %d" % (CT))
print("RE x %d" % (CR))

Submission status: Accepted

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

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


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

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

Submission status: Accepted

Solution code:
import collections

def resolve():
    N = int(input())
    S = [input() for i in range(N)]
    # 値と出現個数のリスト
    S_counter_dict = collections.Counter(S)
    result_list = ["AC", "WA", "TLE", "RE"]
    for result in result_list:
        if result in S_counter_dict.keys():
            print("{result} x {count}"
            .format(result=result, count=S_counter_dict[result]))
        else:
            print("{result} x 0".format(result=result))

resolve()

Submission status: Accepted

Solution code:
x=int(input())
cac=0
cwa=0
ctle=0
cre=0

for i in range(0,x):
    moji=input()
    if(moji=='AC'):
        cac+=1
    if(moji=='WA'):
        cwa+=1
    if(moji=='TLE'):
        ctle+=1
    if(moji=='RE'):
        cre+=1
print('AC x ',cac)
print('WA x' ,cwa)
print('TLE x ',ctle)
print('RE x' ,cre)

Submission status: Accepted

Solution code:
N = int(input())
out = ["AC","WA","TLE","RE"]
output = [0]*4

for _ in range(N):
    S = input()
    if S == out[0]:
        output[0] += 1
    elif S == out[1]:
        output[1] += 1
    elif S == out[2]:
        output[2] += 1
    else:
        output[3] += 1

for i in range(4):
    print(out[i],"x",output[i])

Submission status: Accepted

Solution code:
A = int(input())

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


for i in range(A):
  B = input()
  
  if B == "AC":
    AC+=1
  elif B == "WA":
    WA+=1
  elif B == "TLE":
    TLE+=1
  elif B == "RE":
    RE+=1

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

Submission status: Accepted

Solution code:
N = int(input())
out = ["AC","WA","TLE","RE"]
output = [0]*4

for _ in range(N):
    S = input()
    if S == out[0]:
        output[0] += 1
    elif S == out[1]:
        output[1] += 1
    elif S == out[2]:
        output[2] += 1
    else:
        output[3] += 1

print(out[0],"x",output[0])
print(out[1],"x",output[1])
print(out[2],"x",output[2])
print(out[3],"x",output[3],end="")

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

N = getN()
S = defaultdict(int)
alta = [input() for i in range(N)]
for i in alta:
    if i == "AC":
        S[i] += 1
for i in alta:
    if i == "WA":
        S[i] += 1
for i in alta:
    if i == "TLE":
        S[i] += 1
for i in alta:
    if i == "RE":
        S[i] += 1

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

Submission status: Accepted

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

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

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


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

Submission status: Accepted

Solution code:
a = int(input())
s = []
for i in range(0,a) :
    d = input()
    s.append(d)
    

c1 = 0
c2 = 0
c3 = 0
c4 = 0

for i in range(0,len(s)) :
    if s[i] == "AC" :
        c1 += 1
    elif s[i] == "WA" :
        c2 += 1
    elif s[i] == "TLE" :
        c3 += 1
    elif s[i] == "RE" :
        c4 += 1
print("AC x",str(c1))
print("WA x",str(c2))
print("TLE x",str(c3))
print("RE x",str(c4))

Submission status: Accepted

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


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

print("AC x {}\nWA x {}\nTLE x {}\nRE x {}".format(a,w,t,r))

Submission status: Accepted

Solution code:
num = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(num):
    cmd = input()
    if cmd == "AC":
        ac += 1
    elif cmd == "WA":
        wa += 1
    elif cmd == "TLE":
        tle+= 1
    elif cmd == "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
r = ""

for i in range(n):
  r = str(input())
  if r == "AC":
    AC += 1
  elif r == "WA":
    WA += 1
  elif r == "TLE":
    TLE += 1
  elif r == "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:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(N):
    S=ns()
    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:
ac = 0
wa = 0
tle =0
re = 0
n = int(input())
for i in range(n):
  s = input()
  if s == "AC":
    ac = ac + 1
  elif s == "WA":
    wa = wa + 1
  elif s == "TLE":
    tle = tle + 1
  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:
n=int(input())
counta=0
countb=0
countc=0
countd=0
for _ in range(n):
    s=input()
    if "AC" in s:
        counta+=1
    elif "WA" in s:
        countb+=1
    elif "TLE" in s:
        countc+=1
    elif "RE" in s:
        countd+=1
print("AC","x",counta)
print("WA","x",countb)
print("TLE","x",countc)
print("RE","x",countd)

Submission status: Accepted

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

for j in range(n):
  if k[j] == 'AC':
    ac += 1
  elif k[j] == 'WA':
    wa += 1
  elif k[j] == 'TLE':
    tle += 1
  elif k[j] == 'RE':
    re += 1
    
print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Submission status: Accepted

Solution code:
a=0
b=0
c=0
d=0
i = 0
N = int(input()) #1行目のNを取得する
s = [input() for i in range(N)] #複数行の数値の入力を取得
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())
s = [input() for _ in range(n)]

ac = wa = tle = re = 0

for si in s:
  if si == 'AC':
    ac += 1
  elif si == 'WA':
    wa += 1
  elif si == 'TLE':
    tle += 1
  elif si == '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())
ac = wa = tle = re = 0
for i in range(n):
  m = input()
  if m == 'AC': ac += 1
  elif m == 'WA': wa += 1
  elif m == '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=[0]*4
for i 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 {}".format(ans[0]))
print("WA x {}".format(ans[1]))
print("TLE x {}".format(ans[2]))
print("RE x {}".format(ans[3]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque, Counter
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    n = II()
    s = SR(n)
    c = Counter(s)
    print("AC x", c["AC"])
    print("WA x", c["WA"])
    print("TLE x", c["TLE"])
    print("RE x", c["RE"])
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    c = [0,0,0,0]
    for i in range(n):
        s = input()
        if s == 'AC':
            c[0] += 1
        elif s  == 'WA':
            c[1] += 1
        elif s == 'TLE':
            c[2] += 1
        elif s == 'RE':
            c[3] += 1
    print("AC x {}".format(c[0]))
    print("WA x {}".format(c[1]))
    print("TLE x {}".format(c[2]))
    print("RE x {}".format(c[3]))

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
def sol():
    n=int(input())
    AC=WA=TLE=RE=0
    for i in range(n):
        p=input()
        if(p=="AC"):
            AC+=1
        elif(p=="WA"):
            WA+=1
        elif(p=="TLE"):
            TLE+=1
        elif(p=="RE"):
            RE+=1
    print("AC x "+str(AC))
    print("WA x "+str(WA))
    print("TLE x "+str(TLE))
    print("RE x "+str(RE))
if(__name__=='__main__'):
    sol()

Submission status: Accepted

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

for e in l:
    if e == "AC":
        AC += 1
    elif e == "WA":
        WA += 1
    elif e == "TLE":
        TLE += 1
    else:
        RE += 1

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

Submission status: Accepted

Solution code:
N = int(input())
a = [input() for i in range(N)]
ac = a.count('AC')
wa = a.count('WA')
tle = a.count('TLE')
re = a.count('RE')


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

Submission status: Accepted

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

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

for judge, count in judge_count.items():
    print(f'{judge} x {count}')

Submission status: Accepted

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

cnt = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for si in S:
  cnt[si] += 1
  
for key, val in cnt.items():
  print('{} x {}'.format(key, val))

Submission status: Accepted

Solution code:
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    a = input()
    if a == "AC":
        AC += 1
    elif a == "WA":
        WA += 1
    elif a == "TLE":
        TLE += 1
    elif a == "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:
i = int(input())
v=[]
ac =0
wa =0
tle=0
re =0
for _ in range(0, i):
    v.append(input())


for value in v:
    if value == 'AC':
        ac += 1
    elif value == 'WA':
        wa += 1
    elif value == 'TLE':
        tle += 1
    elif value == 'RE':
        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:
C=["AC","WA","TLE","RE"]
N, = map(int, input().split())
from collections import defaultdict
D = defaultdict(int)
for _ in range(N):
    s = input().strip()
    D[s] += 1
for c in C:
    print(c+" x "+str(D[c]))

Submission status: Accepted

Solution code:
N = int(input())
ans = ['AC', 'WA', 'TLE', 'RE']
d = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}

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

for a in ans:
    print(a, 'x', d[a])

Submission status: Accepted

Solution code:
N = int(input())
S = ['AC', 'WA', 'TLE', 'RE']
a = 0
b = 0
c = 0
d = 0
for i in range(N):
    user = input()
    if user == 'AC':
        a += 1
    elif user == 'WA':
        b += 1
    elif user == 'TLE':
        c += 1
    elif user == 'RE':
        d += 1
print(f"AC x {a}\nWA x {b}\nTLE x {c}\nRE x {d}")

Submission status: Accepted

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

ac = judge_list.count('AC')
wa = judge_list.count('WA')
tle = judge_list.count('TLE')
re = judge_list.count('RE')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

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:
import sys
n = int(input())

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

for i in sys.stdin.readlines():
    result[i.rstrip()] += 1

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

Submission status: Accepted

Solution code:
N = int(raw_input())
A = [raw_input() for _ in xrange(N)]

for c in ['AC', 'WA', 'TLE', 'RE']:
  ct = A.count(c)
  print "{} x {}".format(c, ct)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    s = [input() for _ in range(n)]
    ans = ""
    ans += "AC x " + str(s.count("AC")) + "\n"
    ans += "WA x " + str(s.count("WA")) + "\n"
    ans += "TLE x " + str(s.count("TLE")) + "\n"
    ans += "RE x " + str(s.count("RE")) + "\n"
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
C = [ 0 for i in range(4) ]
s2num = {"AC":0, "WA":1, "TLE":2, "RE":3}
num2s = {0:"AC", 1:"WA", 2:"TLE", 3:"RE"}
# read
for i in range(N):
    num = s2num[ input() ]
    C[num] += 1
    #print(num)
# print
for i in range(4):
    print("{} x {}".format( num2s[i], C[i] ))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
Ss = [input() for i in range(1,N+1)]
Cs=[]
Results=["AC","WA","TLE","RE"]
for st in Results:
    Cs.append(Ss.count(st))
for i in range(0,4):
    print(str(Results[i])+ " x " +str(Cs[i]))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
N = int(input())  # nは入力回数
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)]
a1 = str(S.count("AC"))
a2 = str(S.count("WA"))
a3 = str(S.count("TLE"))
a4 = str(S.count("RE"))
print("AC x " + a1)
print("WA x " + a2)
print("TLE x " + a3)
print("RE x " + a4)

Submission status: Accepted

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

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

for i in range(N):
        if  cnt[i] == 'AC':
                ac+=1
        elif cnt[i] == 'WA':
                wa+=1
        elif cnt[i] == 'TLE':
                tle+=1
        else :
                re+=1
print('AC x ',ac)
print('WA x ',wa)
print('TLE x ',tle)
print('RE x ',re)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)


def main(input, print):
    n = int(input())
    ac = 0
    wa = 0
    tle = 0
    re = 0
    for i in range(n):
        s = input().strip()
        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))


if __name__ == '__main__':
    main(sys.stdin.readline, print)

Submission status: Accepted

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

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:
n = int(input())
a = 0
b = 0
c = 0
d = 0
for k in range(n):
  judge = input()
  if judge == "AC":
    a += 1
  elif judge == "WA":
    b += 1
  elif judge == "TLE":
    c += 1
  else:
    d += 1
print("AC x " + str(a))
print("WA x " + str(b))
print("TLE x " + str(c))
print("RE x " + str(d))

Submission status: Accepted

Solution code:
n=int(input())
a = [input() for i in range(n)]
A=str(a.count("AC"))
B=str(a.count("WA"))
C=str(a.count("TLE"))
D=str(a.count("RE"))
print("AC x "+ A)
print("WA x "+ B)
print("TLE x "+ C)
print("RE x "+ D)

Submission status: Accepted

Solution code:
#coding: utf-8
i = 0
AC = 0
WA = 0
TLE = 0
RE = 0
num = int(input())
#print(num)
while i <num:
  line = input()
  #print(line)
  if line == "AC":
    AC += 1
  if line == "WA":
    WA += 1
  if line == "TLE":
    TLE += 1
  if line == "RE":
    RE += 1
  i += 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())
C = [0]*4

for n in range(N):
    data = input()
    if "AC" == data:
        C[0] += 1
    elif "WA" == data:
        C[1] += 1
    elif "TLE" == data:
        C[2] += 1
    elif "RE" == data:
        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())
l = []
for i in range(n):
    l.append(input())
count = [0, 0, 0, 0]
for i in range(len(l)):
    if l[i] == 'AC':
        count[0] += 1
    elif l[i] == 'WA':
        count[1] += 1
    elif l[i] == 'TLE':
        count[2] += 1
    else:
        count[3] += 1
print('AC x ' + str(count[0]))
print('WA x ' + str(count[1]))
print('TLE x ' + str(count[2]))
print('RE x ' + str(count[3]))

Submission status: Accepted

Solution code:
N = int(input())
S_s = [input() for _ in range(N)]
AC = len(list(filter(lambda x:x=='AC', S_s)))
WA = len(list(filter(lambda x:x=='WA', S_s)))
TLE = len(list(filter(lambda x:x=='TLE', S_s)))
RE = len(list(filter(lambda x:x=='RE', S_s)))
print('AC x',AC)
print('WA x',WA)
print('TLE x',TLE)
print('RE x',RE)

Submission status: Accepted

Solution code:
N = int(input())
C0 = "AC"
C1 = "WA"
C2 = "TLE"
C3 = "RE"
list = []
for i in range(N):
    string = input()
    list.append(string)
print(f"{C0} x {list.count(C0)}")
print(f"{C1} x {list.count(C1)}")
print(f"{C2} x {list.count(C2)}")
print(f"{C3} x {list.count(C3)}")

Submission status: Accepted

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


def log(*args):
    print(*args, file=sys.stderr)


def main():
    n = int(input())
    s = []
    for _ in range(n):
        s.append(input().rstrip())
    c = Counter(s)
    for s in ["AC", "WA", "TLE", "RE"]:
        print("{} x {}".format(s, c[s]))
   


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(n):
    S = input()
    verdict[S.upper()] += 1
for i, j in verdict.items():
    print(f'{i} x {j}')

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for i in range(N)]
AC, WA, TLE, RE = 0, 0, 0, 0
AC = S.count("AC")
WA = S.count("WA")
TLE = S.count("TLE")
RE = S.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 _ in range(N)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())  
str_list = [input() for _ in range(n)]
AC = 0
WA = 0
TLE = 0
RE = 0

for i in range(n):
  if str_list[i] == 'AC':
    AC +=1
  elif str_list[i] == 'WA':
    WA += 1
  elif str_list[i] == 'TLE':
    TLE += 1
  elif str_list[i] == 'RE':
    RE += 1
print('AC x', AC)
print('WA x', WA)
print('TLE x', TLE)
print('RE x', RE)

Submission status: Accepted

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

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

c0=inp.count("AC")
c1=inp.count("WA")
c2=inp.count("TLE")
c3=inp.count("RE")

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

Submission status: Accepted

Solution code:
N = int(input()) 
s = [input() for i in range(N)] 
def count_ac (s):
    n = 0
    for i in range (0, N):
        if s[i] == "AC":
            n = n + 1
        else:
            n = n
    return n
def count_wa (s):
    n = 0
    for i in range (0, N):
        if s[i] == "WA":
            n = n + 1
        else:
            n = n
    return n
def count_tle (s):
    n = 0
    for i in range (0, N):
        if s[i] == "TLE":
            n = n + 1
        else:
            n = n
    return n
def count_re (s):
    n = 0
    for i in range (0, N):
        if s[i] == "RE":
            n = n + 1
        else:
            n = n
    return n
C0 = count_ac (s)
C1 = count_wa (s)
C2 = count_tle (s)
C3 = count_re (s)
t = [0, 0, 0, 0]
t[0] = "AC x " + str(C0)
t[1] = "WA x " + str(C1)
t[2] = "TLE x " + str(C2)
t[3] = "RE x " + str(C3)
for i in t:
    print(i)

Submission status: Accepted

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

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

for i in range(n):
  s.append(input())
  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())
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:
import numpy as np

n = int(input())

sum = np.zeros(4, dtype=np.int)

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

AC = S.count('AC')
WA = S.count('WA')
TLE = S.count('TLE')
RE = S.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())
a = [input() for i in range(n)]

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

Submission status: Accepted

Solution code:
n=int(input())
ans={'AC' : 0, 'WA' : 0, 'TLE' : 0, 'RE' : 0}
for i in range(n):
  s=input()
  ans[s]+=1
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())
Cac = 0
Cwa = 0
Ctle = 0
Cre = 0
for cnt in range(N):
    Si = input()
    if Si == 'AC':
        Cac = Cac + 1
    elif Si == 'WA':
        Cwa = Cwa + 1
    elif Si == 'TLE':
        Ctle = Ctle + 1
    elif Si == 'RE':
        Cre = Cre + 1

print('AC', 'x', Cac)
print('WA', 'x', Cwa)
print('TLE', 'x', Ctle)
print('RE', 'x', Cre)

Submission status: Accepted

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

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