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:
a = 0
w = 0
t = 0
r = 0
n = int(input())
for i in range(n):
    s = str(input())
    if s == 'AC':
        a = a + 1
    elif s == 'WA':
        w = w + 1
    elif s == 'TLE':
        t = t + 1
    elif s == 'RE':
        r = r + 1
print('AC x ' + str(a))
print('WA x ' + str(w))
print('TLE x ' + str(t))
print('RE x ' + str(r))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2問目
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
    else:
        RE += 1
print("AC x", AC)
print("WA x", WA)
print("TLE x", TLE)
print("RE x", RE)

Submission status: Accepted

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


def main():
  N = int(input())
  # set_ = set(['AC', 'WA', 'TLE', 'RE'])
  # cnt = 0
  AC = 0
  WA = 0
  TLE = 0
  RE = 0
  for i in range(N):
    j = input()[:-1]
    if j == 'AC':
      AC += 1
    elif j == 'WA':
      WA += 1
    elif j == 'TLE':
      TLE += 1
    elif j == 'RE':
      RE += 1

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


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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
#####################################

n=int(input())
D=[0]*4
for i in  range(n):
    s=input()
    if s=="AC":
        D[0]+=1
    elif s=="WA":
        D[1]+=1
    elif s=="TLE":
        D[2]+=1
    else:
        D[3]+=1
print("AC x",D[0])
print("WA x",D[1])
print("TLE x",D[2])
print("RE x",D[3])

Submission status: Accepted

Solution code:
N = int(input())
count = [0]*4
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
    else:
        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())
q = [input() for i in range(N)]
print('AC x',q.count('AC'))
print("WA x",q.count('WA'))
print("TLE x",q.count("TLE"))
print("RE x",q.count("RE"))

Submission status: Accepted

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

for i in range(n):
    a = str(input())
    if a == 'AC':
        ac += 1
    if a == 'WA':
        wa += 1
    if a == 'TLE':
        tle += 1
    if a == '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())
ans = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(n):
    s = input()
    ans[s] += 1
for k, v in ans.items():
    print(f"{k} x {v}")

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    N = int(input())
    dic = {"AC": 0, "WA":0, "TLE": 0, "RE": 0}
    for _ in range(N):
        S = input().rstrip('\n')
        dic[S] += 1
    print("AC x " + str(dic["AC"]))
    print("WA x " + str(dic["WA"]))
    print("TLE x " + str(dic["TLE"]))
    print("RE x " + str(dic["RE"]))



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#関数リスト
import sys
input = sys.stdin.readline

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


n = I()
a = 0
b = 0
c = 0
d = 0

for i in range(n):
    temp = input().rstrip()
    if temp == "AC":
        a+=1
    elif temp == "WA":
        b+=1
    elif temp == "TLE":
        c+=1
    elif temp == "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:
#!/usr/bin/env python
"""AtCoder Beginner Contest 173: B - 
https://atcoder.jp/contests/abc173/tasks/abc173_b
"""


def main():
    N = int(input())
    d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
    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']))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

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

for i in d.keys():
	print(i+' x '+str(d[i]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
t=int(input())
l=[]
for i in range(t):
    l.append(input())
z=Counter(l)
print("AC x "+str(z["AC"]))
print("WA x "+str(z["WA"]))
print("TLE x "+str(z["TLE"]))
print("RE x "+str(z["RE"]))

Submission status: Accepted

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

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

for i in range(N):
    if s[i] == 'AC':
        m[0] += 1
    if s[i] == 'WA':
        m[1] += 1
    if s[i] == 'TLE':
        m[2] += 1
    if s[i] == 'RE':
        m[3] += 1

print('AC x ' + str(m[0]))
print('WA x ' + str(m[1]))
print('TLE x ' + str(m[2]))
print('RE x ' + str(m[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 ' + 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
    else:
        ans[3] += 1
for i in range(4):
    if i == 0:
        print(f"AC x {ans[i]}")
    elif i == 1:
        print(f"WA x {ans[i]}")
    elif i == 2:
        print(f"TLE x {ans[i]}")
    else:
        print(f"RE x {ans[i]}")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(n):
    result = input()
    if result == "AC":
        count[0] += 1
    elif result == "WA":
        count[1] += 1
    elif result == "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:
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',dic['AC']])
print(*['WA','x',dic['WA']])
print(*['TLE','x',dic['TLE']])
print(*['RE','x',dic['RE']])

Submission status: Accepted

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

def main():
    N = int(readline())

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

    for _ in range(N):
        s = readline().strip()
        d[s] += 1

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

D = {}
D['AC'] = 0
D['WA'] = 0
D['TLE'] = 0
D['RE'] = 0

for k in range(N):
  D[S[k]] += 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())
AC = 0
WA = 0
TLE = 0
RE = 0

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

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

Submission status: Accepted

Solution code:
import sys
import time
import math
from collections import deque
import heapq
import itertools
from decimal import Decimal
import bisect
from operator import itemgetter
MAX_INT = int(10e18)
MIN_INT = -MAX_INT
mod = 1000000000+7
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

d = [0]*4
for i in range(N):
  if s[i] == "AC":
    d[0] += 1
  elif s[i] == "WA":
    d[1] += 1
  elif s[i] == "TLE":
    d[2] += 1
  else:
    d[3] += 1

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

Submission status: Accepted

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

# from math import gcd
from fractions 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

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

c = Counter(S)

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

for i in counts:
    print(i + " x " + str(c[i]))

Submission status: Accepted

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

A = S.count('AC')
B = S.count('WA')
C = S.count('TLE')
D = S.count('RE')
print('AC x '+str(A))
print('WA x '+str(B))
print('TLE x '+str(C))
print('RE x '+str(D))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

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

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 '+ 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())
AC =[]
WA =[]
TLE =[]
RE =[]

for i in range(N):
    s = str(input())
    if s == "AC":
        AC.append(s)
    elif s == "WA":
        WA.append(s)
    elif s == "TLE":
        TLE.append(s)
    elif s =="RE":
        RE.append(s)
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:
N = int(input())
S = [input() for i in range(N)]

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

for i in S:
  if i == 'AC':
    ac += 1
  elif i == 'WA':
    wa += 1
  elif i == 'TLE':
    tle += 1
  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 = []
a = ["AC","WA","TLE","RE"]

for i in range(n):
    s.append(str(input()))

for i in a:
    print(i + " x " + str(s.count(i)))

Submission status: Accepted

Solution code:
import collections
N = int(input())
S = [input() for _ in range(N)]
c = collections.Counter(S)
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())
s = [input() for _ in range(n)]

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

for k, v in cnt.items():
    print(f"{k} x {v}")

Submission status: Accepted

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

N = int(readline())

ans =[0, 0, 0, 0]

for i in range(N):
  si = readline().strip()
  if si == "AC":
    ans[0] += 1
  elif si == "WA":
    ans[1] += 1
  elif si == "TLE":
    ans[2] += 1
  elif si == "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())
C = [input() for i in range(N)]


ACcnt = C.count("AC")
WAcnt = C.count("WA")
TLEcnt = C.count("TLE")
REcnt = C.count("RE")

print('AC x ' + str(ACcnt))
print('WA x ' + str(WAcnt))
print('TLE x ' + str(TLEcnt))
print('RE x ' + str(REcnt))

Submission status: Accepted

Solution code:

def solve():
    N = int(input())
    S = [input() for N in range(N)]
    snames = ["AC", "WA", "TLE", "RE"]
    score = {"AC": 0, "TLE": 0, "WA": 0, "RE": 0}


    for st in S:
        score[st] += 1

    for sname in snames:
        print(sname + " x " + str(score[sname]))

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
c = [0, 0, 0, 0]
for i in range(N):
    s = str(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 ', c[0])
print('WA x ', c[1])
print('TLE x ', c[2])
print('RE x ', c[3])

Submission status: Accepted

Solution code:
class Counter(dict):
    def __missing__(self, i):
        return 0

n = int(input())

answers = Counter()

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

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

Submission status: Accepted

Solution code:
from collections import Counter
lst=[]
for i in range(int(input())):
  lst.append(input())
dic=dict(Counter(lst))
for i in ['AC','WA','TLE','RE']:
  try:
    print(f'{i} x {dic[i]}')
  except KeyError:
    print(f'{i} x 0')

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

Submission status: Accepted

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

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

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:
N = int(input())
count = [0]*4

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

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

for _ in range(n):
    in_test = input()
    out_set[in_test] += 1

for key in out_set:
    print(f'{key} x {out_set[key]}')

Submission status: Accepted

Solution code:
tcase=['AC','WA','TLE','RE']
tcount=[0,0,0,0]

n=int(input())
for i in range(n):
    c=input()
    for t in range(4):
        if tcase[t]==c:
            tcount[t]+=1
            break

for i in range(4):
    print(tcase[i],'x',tcount[i])

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:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')

file = 0

def solve():
    



    # for _ in range(ii()):

    n=ii()
    m={}
    a=["AC","WA","TLE","RE"]
    m['WA']=0
    m['TLE']=0
    m["AC"]=0
    m["RE"]=0
    for i in range(n):
        s=si()
        m[s]+=1
    for i in a:
        print(i,end=" x ")
        print(m[i])












  
















if __name__ =="__main__":

    if(file):

        if path.exists('input1.txt'):
            sys.stdin=open('input1.txt', 'r')
            sys.stdout=open('output1.txt','w')
        else:
            input=sys.stdin.readline
    solve()

Submission status: Accepted

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

for i in range(n):
  c = str(input())
  d[c]+=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())
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"])

Submission status: Accepted

Solution code:
n = int(input())
s = dict()
s["AC"]=0
s["WA"]=0
s["TLE"]=0
s["RE"]=0

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

a = ["AC", "WA", "TLE", "RE"]
for i in a:
    print(i + " x " + str(s[i]))

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 {0}'.format(ans[0]))
print('WA x {0}'.format(ans[1]))
print('TLE x {0}'.format(ans[2]))
print('RE x {0}'.format(ans[3]))

Submission status: Accepted

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

for i in dic:
    print("%s x %d" % (i, dic[i]))

Submission status: Accepted

Solution code:
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    N = II()
    s = ["0"]*N
    for i in range(N):
        s[i] = input()
    ac = str(s.count("AC"))
    wa = str(s.count("WA"))
    tle = str(s.count("TLE"))
    re = str(s.count("RE"))


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

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
n = int(input())
ss = []
t = ['AC', 'WA', 'TLE', 'RE']
ans = [0, 0, 0, 0]
for i in range(n):
    ss.append(input())

for s in ss:
    if s == t[0]:
        ans[0] += 1
    elif s == t[1]:
        ans[1] += 1
    elif s == t[2]:
        ans[2] += 1
    elif s == t[3]:
        ans[3] += 1


for j, c in zip(t, ans):
    print(j, " x ", c)

Submission status: Accepted

Solution code:
n = int(input())
l =[input() for _ in range(n)]
a=0
b=0
c=0
d=0
for i in l:
    if i == "AC":
        a += 1
    if i == "WA":
        b += 1
    if i == "TLE":
        c += 1
    if i == "RE":
        d += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N=int(input())
string_list=[input() for i in range(N)]
C0=0
C1=0
C2=0
C3=0
for i in string_list:
    if i=='AC':
        C0+=1
    elif i=='WA':
        C1+=1
    elif i=='TLE':
        C2+=1
    elif i=='RE':
        C3+=1

print('AC','','x','',C0)
print('WA','','x','',C1)
print('TLE','','x','',C2)
print('RE','','x','',C3)

Submission status: Accepted

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

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:
def main():
    n = int(input())
    S = [input() for _ in range(n)]
    dic = {}
    dic["AC"] = 0
    dic["WA"] = 0
    dic["TLE"] = 0
    dic["RE"] = 0
    for s in S:
        if s in dic:
            dic[s] += 1
        else:
            dic[s] = 1
    print(f"AC x {dic['AC']}")
    print(f"WA x {dic['WA']}")
    print(f"TLE x {dic['TLE']}")
    print(f"RE x {dic['RE']}")
    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N=int(input())
c0,c1,c2,c3=0,0,0,0
for i in range(N):
  s=input()
  if s=="AC":
    c0=c0+1
  elif s=="WA":
    c1=c1+1
  elif s=="TLE":
    c2=c2+1
  else:
    c3=c3+1
print("AC x", c0)
print("WA x", c1)
print("TLE x", c2)
print("RE x", c3)

Submission status: Accepted

Solution code:
from collections import defaultdict
dic = defaultdict(lambda :0)

N = int(input())
for i in range(N):
    dic[input()] += 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:
#<B>
N = int(input())
test = []
for i in range(N):
    s = input()
    test.append(s)

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

Submission status: Accepted

Solution code:
n=int(input())
Ac=0
Wa=0
Tle=0
Re=0
for _ in range(n):
    s=input()
    if s=='AC':
        Ac+=1
    elif s=='WA':
        Wa+=1
    elif s=='TLE':
        Tle+=1
    elif s=='RE':
        Re+=1
print('AC x {}'.format(Ac))
print('WA x {}'.format(Wa))
print('TLE x {}'.format(Tle))
print('RE x {}'.format(Re))

Submission status: Accepted

Solution code:
n = int(input())
ac = []
wa = []
tle = []
re = []
for _ in range(n):
    i = input()
    if i == "WA":
        wa.append(i)
    elif i == "AC":
        ac.append(i)
    elif i == "TLE":
        tle.append(i)
    else:
        re.append(i)

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

Submission status: Accepted

Solution code:
n = int(input())
arr = [input() for i in range(n)]
acnum = arr.count('AC')
wanum = arr.count('WA')
tlenum = arr.count('TLE')
renum = arr.count('RE')
print('AC x',str(acnum))
print('WA x',str(wanum))
print('TLE x',str(tlenum))
print('RE x',str(renum))

Submission status: Accepted

Solution code:
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    uinp = input()
    if uinp == "AC":
        AC += 1
    elif uinp == "WA":
        WA += 1
    elif uinp == "TLE":
        TLE += 1
    elif uinp == "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_count = 0
wa_count = 0
tle_count = 0
re_count = 0
for i in range(n):
    s = input()
    if s == 'AC':
        ac_count += 1
    elif s == 'WA':
        wa_count += 1
    elif s == 'TLE':
        tle_count += 1
    else:
        re_count += 1

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

Submission status: Accepted

Solution code:
n = int(input())

sn = []
for i in range(n):
  sn.append(input())

d = {"AC":0,"WA":0,"TLE":0,"RE":0}  
for s in sn:
  if s in d:
    d[s] += 1
    
for di in d.items():
  print(di[0],"x",di[1] )

Submission status: Accepted

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


def readstr():
    return input().strip()


def readint():
    return int(input())


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


def readstrs():
    return input().split()


def main():
    N = readint()
    s = [readstr() for _ 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')}")


if __name__ == "__main__":
    main()

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')

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:
import sys, math, itertools, collections, bisect 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
N=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(N):
  IN=input()
  if IN=='AC':
    AC+=1
  if IN=='WA':
    WA+=1
  if IN=='TLE':
    TLE+=1
  if IN=='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())
c0=c1=c2=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", c0)
print("WA x", c1)
print("TLE x", c2)
print("RE x", c3)

Submission status: Accepted

Solution code:
# AtCoder
N = int(input())
lst = [input() for _ in range(N)]
ac = 0
wa = 0
tle = 0
re = 0


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

Submission status: Accepted

Solution code:
import collections
n = int(input())
ss = [input() for _ in range(n)]
ctr = collections.Counter(ss)
print('%s x %d' % ('AC', ctr['AC']))
print('%s x %d' % ('WA', ctr['WA']))
print('%s x %d' % ('TLE', ctr['TLE']))
print('%s x %d' % ('RE', ctr['RE']))

Submission status: Accepted

Solution code:
N=int(input())
num_AC=0
num_WA=0
num_TLE=0
num_RE=0
for i in range(N):
    S=input()
    if S=="AC":
        num_AC+=1
    elif S=="WA":
        num_WA+=1
    elif S=="TLE":
        num_TLE+=1
    else:
        num_RE+=1
print("AC x ",num_AC)
print("WA x ",num_WA)
print("TLE x ",num_TLE)
print("RE x ",num_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
    elif 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:
if __name__ == '__main__':
    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)