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:
def readinput():
    n=int(input())
    s=[]
    for _ in range(n):
        s.append(input())
    return n,s

def main(n,s):
    ac=0
    wa=0
    tle=0
    re=0
    for ret in s:
        if ret=='AC':
            ac+=1
        elif ret=='WA':
            wa+=1
        elif ret=='TLE':
            tle+=1
        elif ret=='RE':
            re+=1
    print('AC x {}'.format(ac))
    print('WA x {}'.format(wa))
    print('TLE x {}'.format(tle))
    print('RE x {}'.format(re))

if __name__=='__main__':
    n,s=readinput()
    main(n,s)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N = int(input())
ans = [0,0,0,0]
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
    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]))

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

Submission status: Accepted

Solution code:
import sys
def Ii():return int(sys.stdin.readline())
def Mi():return map(int,sys.stdin.buffer.readline().split())
def Li():return list(map(int,sys.stdin.buffer.readline().split()))

n = Ii()
ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
  ip = input()
  if ip == 'AC':
    ac += 1
  elif ip == 'WA':
    wa += 1
  elif ip == '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)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, Ss):
    cntAC, cntWA, cntTLE, cntRE = 0, 0, 0, 0
    cntJudge = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
    for S in Ss:
        cntJudge[S] += 1
    print('AC x ' + str(cntJudge['AC']))
    print('WA x ' + str(cntJudge['WA']))
    print('TLE x ' + str(cntJudge['TLE']))
    print('RE x ' + str(cntJudge['RE']))


if __name__ == '__main__':
    # S = input()
    N = int(input())
    # N, M = map(int, input().split())
    # As = [int(i) for i in input().split()]
    # Bs = [int(i) for i in input().split()]
    Ss = [input() for _ in range(N)]
    solve(N, Ss)

Submission status: Accepted

Solution code:
N = int(input())
s = list()
for _ in range(N):
  s.append(input())
for result in ("AC","WA","TLE","RE"):
	print(f"{result} x {s.count(result)}")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

for _ in range(N):
    S = input()
    results[S] += 1

#print(results)

for result, num in results.items():
    print(result,"x", num)

Submission status: Accepted

Solution code:
ans = [0,0,0,0]
N = int(input())
for i in range(N):
    S = input()
    if S == "AC":
        ans[0] += 1
    if S == "WA":
        ans[1] += 1
    if S == "TLE":
        ans[2] += 1
    if S == "RE":
        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 = ['']*N
for T in range(0,N):
    S[T] = input()
print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(S.count('AC'),S.count('WA'),S.count('TLE'),S.count('RE')))

Submission status: Accepted

Solution code:
N=int(input())
S=[]
for i in range(N):
    S+=[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:
from collections import defaultdict
def main():
    N = int(input())
    c = defaultdict(int)

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
dic = {}
dic["AC"] = 0
dic["WA"] = 0
dic["TLE"] = 0
dic["RE"] = 0

for i in range(N):
    inp = input()
    dic[inp] += 1

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

Submission status: Accepted

Solution code:
# Begin Header {{{
from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations, combinations_with_replacement
# }}} End Header
# _________コーディングはここから！！___________
t = defaultdict(int)
n = int(input())
for i in range(n):
    s = input()
    t[s]+=1
print("AC x "+str(t["AC"]))
print("WA x "+str(t["WA"]))
print("TLE x "+str(t["TLE"]))
print("RE x "+str(t["RE"]))

Submission status: Accepted

Solution code:
N = int(input())

ans = dict()
ans['AC'] = 0
ans['WA'] = 0
ans['TLE'] = 0
ans['RE'] = 0
for i in range(N):
    S = input()
    ans[S] += 1
        
print("AC x", ans['AC'])
print("WA x", ans['WA'])
print("TLE x", ans['TLE'])
print("RE x", ans['RE'])

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    n = int(input())
    a = [input() for i in range(n)]

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

    for i_a in a:
        for j_C, j_num in C.items():
            if i_a == j_C:
                C[j_C] = j_num + 1

    for j_C, j_num in C.items():
        print('%s x %s' % (j_C, j_num))
    return


if __name__ == "__main__":
    main()
    sys.exit(0)

Submission status: Accepted

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

    for k, v in d.items():
        print(k, 'x', v)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math
import collections
from collections import deque 
from functools import reduce

# input = sys.stdin.readline
n = int(input())
rs = list(input() for i in range(n))

cn = collections.Counter(rs)

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

Submission status: Accepted

Solution code:
num = int(input())
pattern = {"AC":0, "WA":1, "TLE":2, "RE":3}
result = [0, 0, 0, 0]
for i in range(num):
  si = input()
  result[pattern[si]] += 1

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

Submission status: Accepted

Solution code:
ls = [0]*4
n = int(input())

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

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

Submission status: Accepted

Solution code:
n = int(input())
dict = {}
dict["AC"] = 0
dict["WA"] = 0
dict["TLE"] = 0
dict["RE"] = 0
for _ in range(n):
    s = input()
    dict[s] = dict.get(s, 0) + 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:
from collections import Counter

n = int(input())
counts = Counter([input() for _ in range(n)])

print(f'AC x {counts["AC"]}')
print(f'WA x {counts["WA"]}')
print(f'TLE x {counts["TLE"]}')
print(f'RE x {counts["RE"]}')

Submission status: Accepted

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

print('AC','x',lis.count('AC'))
print('WA','x',lis.count('WA'))
print('TLE','x',lis.count('TLE'))
print('RE','x',lis.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

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = int(input().strip())
    s_dict = {"AC": 0,
              "WA": 0,
              "TLE": 0,
              "RE": 0}

    for i in range(n):
        s = input().strip()
        s_dict[s] += 1
    print("AC x {}".format(s_dict["AC"]))
    print("WA x {}".format(s_dict["WA"]))
    print("TLE x {}".format(s_dict["TLE"]))
    print("RE x {}".format(s_dict["RE"]))

Submission status: Accepted

Solution code:
"""
AtCoder :: Beginner Contest 173 :: Judge Status Summary
https://atcoder.jp/contests/abc173/tasks/abc173_b
"""
import sys
from collections import defaultdict


def main():
    """Main program."""
    N = int(sys.stdin.readline())
    freq = defaultdict(int)
    for _ in range(N):
        status = sys.stdin.readline().strip()
        freq[status] += 1

    for status in ['AC', 'WA', 'TLE', 'RE']:
        print("{} x {}".format(status, freq[status]))



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
List = [str(input()) for i in range(N)]
c0=0
c1=0
c2=0
c3=0
for i in List:
    if i=='AC':
        c0+=1
    elif i=='WA':
        c1+=1
    elif i=='TLE':
        c2+=1
    elif i=='RE':
        c3+=1
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))

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())
count = [0, 0, 0, 0]
for i in range(N):
  s = input()
  if s == 'AC':
    count[0] += 1
  elif s == 'WA':
    count[1] += 1
  elif s == 'TLE':
    count[2] += 1
  elif s == 'RE':
    count[3] += 1

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

Submission status: Accepted

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

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:
def resolve():
    from collections import defaultdict

    d = defaultdict(int)
    n = int(input())
    for _ in range(n):
        s = input()
        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']))

resolve()

Submission status: Accepted

Solution code:
N = int(input())
c = [0, 0, 0, 0]
for i in range(N):
  add_s = input()
  if add_s == "AC": c[0] += 1
  elif add_s == "WA": c[1] += 1
  elif add_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:
N = int(input())
S = list(input() for _ in range(N))
ac = S.count("AC")
wa = S.count("WA")
tle = S.count("TLE")
re = 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())
r=[0,0,0,0]
for i in range(N):
  a=input()
  if a=="AC":
    r[0]+=1
  if a=="WA":
    r[1]+=1
  if a=="TLE":
    r[2]+=1
  if a=="RE":
    r[3]+=1
print("AC x",r[0])
print("WA x",r[1])
print("TLE x",r[2])
print("RE x",r[3])

Submission status: Accepted

Solution code:
N = int(input())

cnt_AC = 0
cnt_WA = 0
cnt_TLE = 0
cnt_RE = 0

for n in range(N):
    tmp = input()
    if(tmp == 'AC'):
        cnt_AC += 1
    elif(tmp == 'WA'):
        cnt_WA += 1
    elif(tmp == 'TLE'):
        cnt_TLE += 1
    elif(tmp == 'RE'):
        cnt_RE += 1

print('AC x ' + str(cnt_AC))
print('WA x ' + str(cnt_WA))
print('TLE x ' + str(cnt_TLE))
print('RE x ' + str(cnt_RE))

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()
    S = [SS() for _ in range(N)]

    result = ('AC', 'WA', 'TLE', 'RE')
    cnt = collections.Counter(S)

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from pprint import pprint
# import math
import collections

n = int(input())
# n, k = map(int, input().split(' '))
# a = list(map(int, input().split(' ')))
s = []
for i in range(n):
    s.append(input())

c = collections.Counter
ans = c(s)

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

for c in case:
    if c in ans.keys():
        res = ans[c]
    else:
        res = 0
    print(c, 'x', res)

Submission status: Accepted

Solution code:
import sys
from collections import Counter
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()

N = I()
S_list = [S() for i in range(N)]

counter = Counter()
for ss in S_list:
    counter[ss] += 1

for ss in ["AC", "WA", "TLE", "RE"]:
    print("{} x {}".format(ss, counter[ss]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

RE = ["AC","WA","TLE","RE"]
cnt = [0,0,0,0]

for i in range(N):
    re = input()
    for j in range(4):
        if re == RE[j]:
            cnt[j] += 1

for j in range(4):
    print(RE[j] + " x " + str(cnt[j]))

Submission status: Accepted

Solution code:
import sys
#sys.setrecursionlimit(2147483647)
input = sys.stdin.readline

if __name__ == '__main__':
  n=int(input())
  C={'AC':0,'WA':0,'TLE':0,'RE':0}
  for _ in range(n):
    s=input().strip("\n")
    C[s]+=1
  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())
count = []
for i in range(4):
    count.append(0)

for i in range(N):
    type = input()
    if type == 'AC':
        count[0] += 1
    elif type == 'WA':
        count[1] +=1    
    elif type == 'TLE':
        count[2] += 1
    elif type == 'RE':
        count[3] += 1

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

Submission status: Accepted

Solution code:
N = int(input())
S = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(N):
    S[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:
from collections import Counter
n = int(input().strip())
L = [input().strip() for _ in range(n)]


cnt=Counter(L)
for x in ["AC", "WA", "TLE", "RE"]:
    print(x+" x "+str(cnt[x]))

Submission status: Accepted

Solution code:
n=int(input())
li=["AC","WA","TLE","RE"]
out=[0]*4
for i in range(n):
  x=input()
  for (j,k)in zip(range(4),li):
    if x==k:
      out[j]+=1
      break
for (x,y)in zip(li,out):
  print("{} x {}".format(x,y))

Submission status: Accepted

Solution code:
from collections import defaultdict
v = defaultdict(int)
for _ in range(int(input())):
    v[input()]+=1
print('AC x',v['AC'])
print('WA x',v['WA'])
print('TLE x',v['TLE'])
print('RE x',v['RE'])

Submission status: Accepted

Solution code:
def resolve():
  N = int(input())
  result = {
    'AC': 0,
    'WA': 0, 
    'TLE': 0,
    'RE': 0
  }
  for i in range(N):
    result[input()] += 1
  print('AC x', result['AC'])
  print('WA x', result['WA'])
  print('TLE x', result['TLE'])
  print('RE x', result['RE'])

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
num = (int)(input())
ans = [0, 0, 0, 0]
for i in range(num):
  temp = input()
  if temp == "AC":
    ans[0] += 1
  elif temp == "WA":
    ans[1] += 1
  elif temp == "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:

def main():
  n = int(input())
  ss = [input() for _ in range(n)]
  
  from collections import Counter
  
  cc = Counter(ss)
  
  kk = ["AC", "WA", "TLE", "RE"]
  
  for k in kk:
    if k in cc:
      print(f"{k} x {cc[k]}")
    else:
      print(f"{k} x 0")


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):
  result = input()
  if result == "AC":
    ac += 1
  elif result == "WA":
    wa += 1
  elif result == "TLE":
    tle += 1
  else:
    re += 1

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

Submission status: Accepted

Solution code:
N = int(input())

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

C = [0] * 4

for s in S:
    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:
N=int(input())
S=[]
for i 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())
a=0
w=0
t=0
r=0
for i in range(N):
  s=input()
  if s=='AC':
    a+=1
  elif s=='WA':
    w+=1
  elif s=='TLE':
    t+=1
  else:
    r+=1

a=str(a)
w=str(w)
t=str(t)
r=str(r)
print('AC','x',a)
print('WA','x',w)
print('TLE','x',t)
print('RE','x',r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

D = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for i in range(N):
    x = input()
    if x == "AC":
        D["AC"] += 1 
    elif x == "WA":
        D["WA"] += 1
    elif x == "TLE":
        D["TLE"] += 1
    else:
        D["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 _ in range(N)]

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

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

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

Submission status: Accepted

Solution code:
from collections import Counter
N = int(input())
d = {'AC':0,
     'WA':0,
     'TLE':0,
     'RE':0}
for key,value in Counter([input() for _ in range(N)]).items():
    d[key]=value

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

Submission status: Accepted

Solution code:
N = int(input())
S = tuple(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:
test = int(input())

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


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

    if n == "AC":
        ac += 1

    if n == "WA":
        wa += 1

    if n == "TLE":
        tle += 1

    if n == "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())
s_list=[input() for _ in range(n)]

AC_cnt = 0
WA_cnt = 0
TLE_cnt = 0
RE_cnt = 0

for i in range(n):
    if s_list[i] == 'AC':
        AC_cnt += 1
    elif s_list[i] == 'WA':
        WA_cnt += 1
    elif s_list[i] == 'TLE':
        TLE_cnt += 1
    elif s_list[i] == 'RE':
        RE_cnt += 1

print('AC x ' + str(AC_cnt))
print('WA x ' + str(WA_cnt))
print('TLE x ' + str(TLE_cnt))
print('RE x ' + str(RE_cnt))

Submission status: Accepted

Solution code:
n=int(input())
s=[0,0,0,0]
for i in range(n):
    si=input()
    if si=='AC':
        s[0]+=1
    elif si=='WA':
        s[1]+=1
    elif si=='TLE':
        s[2]+=1
    else:
        s[3]+=1
print(f'AC x {s[0]}')
print(f'WA x {s[1]}')
print(f'TLE x {s[2]}')
print(f'RE x {s[3]}')

Submission status: Accepted

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

print("AC x",s.count("AC"),sep=" ")
print("WA x",s.count("WA"),sep=" ")
print("TLE x",s.count("TLE"),sep=" ")
print("RE x",s.count("RE"),sep=" ")

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

Submission status: Accepted

Solution code:
t = int(input())

a = b = c = d = 0
for i in range(t):
    case = input()

    if case == 'AC':
        a += 1
    elif case == 'WA':
        b += 1
    elif case == 'TLE':
        c += 1
    elif case == 'RE':
        d += 1


print('AC x ' + str(a))
print('WA x ' + str(b))
print('TLE x ' + str(c))
print('RE x ' + str(d))

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())

C = np.zeros(4)
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', int(C[0]))
print('WA x', int(C[1]))
print('TLE x', int(C[2]))
print('RE x', int(C[3]))

Submission status: Accepted

Solution code:
N = int(input())

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

for _ in range(N):
    status = input()
    cnt[status] += 1
    
for k, v in cnt.items():
    print('{} x {}'.format(k,str(v)))

Submission status: Accepted

Solution code:
n=int(input())

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

for i in range(n):
  st=input()
  if st=="AC":
    c1+=1
  if st=="WA":
    c2+=1
  if st=="TLE":
    c3+=1
  if st=="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().rstrip())
Ss = []
for _ in range(N):
    Ss.append(input().rstrip())
# print(Ss)
print(f'AC x {Ss.count("AC")}')
print(f'WA x {Ss.count("WA")}')
print(f'TLE x {Ss.count("TLE")}')
print(f'RE x {Ss.count("RE")}')

Submission status: Accepted

Solution code:
N = int(input())
ans = [0, 0, 0, 0]
strings = ['AC', 'WA', 'TLE', 'RE']
for _ in range(N):
    curr = input()
    if curr == 'AC':
        ans[0] += 1
    elif curr == 'WA':
        ans[1] += 1
    elif curr == 'TLE':
        ans[2] += 1
    else:
        ans[3] += 1

for i in range(4):
    print(strings[i] + ' x ' + str(ans[i]))

Submission status: Accepted

Solution code:
cases = int(input())

ac_count = 0
wa_count = 0
tle_count = 0
re_count = 0

arr = []
for i in range(cases):
    x = input()
    if x == "AC":
        ac_count += 1
    elif x == "WA":
        wa_count += 1
    elif x == "TLE":
        tle_count += 1
    elif x == "RE":
        re_count += 1

print("AC x {0}".format(ac_count))
print("WA x {0}".format(wa_count))
print("TLE x {0}".format(tle_count))
print("RE x {0}".format(re_count))

Submission status: Accepted

Solution code:
from collections import Counter
from math import sqrt
import math

n = int(input())
a = []
b = ["AC" , "WA" , "TLE" , "RE"]
for i in range(n):
    a.append(input())
c = Counter(a)
for i in b:
    print(i , " x ",  c[i])

Submission status: Accepted

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

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

  for _ in range(N):
    S = input()

    if S in dic:
      dic[S] += 1

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

if __name__ == "__main__":
  main()

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(N):
	temp=input()
	if temp=="AC":
		cnt[0]+=1
	elif temp=="WA":
		cnt[1]+=1
	elif temp=="TLE":
		cnt[2]+=1
	else:
		cnt[3]+=1

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

Submission status: Accepted

Solution code:
n = int(input())
cnt = [0, 0, 0, 0]
for i in range(n):
  s = input()
  if s == "AC":
    cnt[0] += 1
  elif s == "WA":
    cnt[1] += 1
  elif s == "TLE":
    cnt[2] += 1
  elif s == "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())
a = ["null"]*N
for i in range(N):
  a[i] = input()
  
ac = 0
wa = 0
tle = 0
re = 0

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

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

Submission status: Accepted

Solution code:
N = int(input())
S = [0]*N
C = [0]*4
for i in range(N):
    S[i] = input()
    if S[i] =="AC":
        C[0] += 1
    elif S[i] =="WA":
        C[1] += 1
    elif S[i] =="TLE":
        C[2] += 1
    elif S[i] =="RE":
        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:
def INT():
    return int(input())

def MI():
    return map(int, input().split())

def LI():
    return list(map(int, input().split()))

from collections import  Counter
N = INT()
S = [input() for _ in range(N)]

S = Counter(S)
print(f"AC x {S['AC']}")
print(f"WA x {S['WA']}")
print(f"TLE x {S['TLE']}")
print(f"RE x {S['RE']}")

Submission status: Accepted

Solution code:
n=int(input())
ans=[0]*4
for i in range(n):
  x=input()
  if x=='AC':
    ans[0]+=1
  elif x=='WA':
    ans[1]+=1
  elif x=='TLE':
    ans[2]+=1
  elif x=='RE':
    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 _ 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())
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for i in range(N):
    S = input()
    if S == "AC":
        c0 += 1
    elif S == "WA":
        c1 += 1
    elif S == "TLE":
        c2 += 1
    elif S =="RE":
        c3 += 1
print("AC x " +str(c0))
print("WA x " +str(c1))
print("TLE x "+str(c2))
print("RE x "+str(c3))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = int(input())

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

for i in range(N):
    tmp = str(input())
    if tmp == 'AC':
        AC += 1
    elif tmp == 'WA':
        WA += 1
    elif tmp == 'TLE':
        TLE += 1
    elif tmp == 'RE':
        RE += 1

print('AC x', AC)
print('WA x', WA)
print('TLE x', TLE)
print('RE x', RE)

Submission status: Accepted

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

    for _ in range(n) :
        s.append(input())

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
S_list = []
for i in range(N):
    S_list.append(str(input()))

key_list = ["AC", "WA", "TLE", "RE"]
for key in key_list:
    print(key + " x " + str(S_list.count(key)))