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:
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())
S = []
for i in range(N):
    S.append(input())
    
print('AC x %s'%(S.count('AC')))
print('WA x %s'%(S.count('WA')))
print('TLE x %s'%(S.count('TLE')))
print('RE x %s'%(S.count('RE')))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

def main():
    N = int(input())
    S = []
    for _ in range(N):
        S.append(input())
    c = Counter(S)
    for x in ('AC', 'WA', 'TLE', 'RE'):
        print(f'{x} x {c[x]}')
    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict

n = int(input())
dic = defaultdict(lambda: 0)

for _ in range(n):
    judge = input()
    dic[judge] += 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']}")

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())
ac, wa, tle, re = 0, 0, 0, 0

for i in range(N):
    c = input()
    if c == "AC":
        ac += 1
    elif c == "WA":
        wa += 1
    elif c == "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())
S=[]
AC=0
WA=0
TLE=0
RE=0
for i in range(N):
  s=input()
  if s=="AC":AC+=1
  if s=="TLE":TLE+=1
  if s=="WA":WA+=1
  if s=="RE":RE+=1
print("AC","x",AC)
print("WA","x",WA)
print("TLE","x",TLE)
print("RE","x",RE)

Submission status: Accepted

Solution code:
N = int(input())
results = {"AC":0,
           "WA":0,
           "TLE":0,
           "RE":0}
for _ in range(N):
    result = input()
    results[result] += 1
for key in results.keys():
    print(key + " x " + str(results[key]))

Submission status: Accepted

Solution code:
N = int(input())
AC, WA, TLE, RE = 0, 0, 0, 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(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, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

    for _ in range(n):
        str_list.append(s_input())
    
    co_list = Counter(str_list)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    N = int(readline())
    judge_dic = {"AC":0,"WA":0, "TLE":0, "RE":0}
    for _ in range(N):
        S = input()
        for k in judge_dic.keys():
            if k == S:
                judge_dic[k] += 1
    print("AC x {0}".format(judge_dic["AC"]))
    print("WA x {0}".format(judge_dic["WA"]))
    print("TLE x {0}".format(judge_dic["TLE"]))
    print("RE x {0}".format(judge_dic["RE"]))


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:

from collections import deque



# for #!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
from bisect import bisect_left as bl
from math import log2,ceil
from heapq import heappush, heappop
from itertools import permutations 
def main():
    # for t in range(int(input())):
        n = int(input())
        d = dict()
        for i in range(n):
            s = input()
            if s in d:
                d[s]+=1
            else:
                d[s]=1
        l = ['AC', 'WA', 'TLE', 'RE']
        for k in l:
            if k in d:
                print(k, "x", d[k], sep = " ")
            else:
                print(k, "x", 0, sep = " ")
            # heappush(h, l[i])

        


        
        




# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections


def main():
    N = input_ints()
    S = []

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

    c = collections.Counter(S)

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


def input_ints():
    line_list = input().split()

    if len(line_list) == 1:
        return int(line_list[0])
    else:
        return map(int, line_list)


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


def input_int_tuple_list(n: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

Submission status: Accepted

Solution code:
n = int(input())

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

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
n = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(n):
    judge = input()
    if judge == "AC":
        AC += 1
    elif judge == "WA":
        WA += 1
    elif judge == "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:
ans = {'AC':0,'WA':0,'TLE':0,'RE':0}
n = int(input())
for i in range(n):
  a = input()
  ans[a] += 1
for i in ans.keys():
  print(i + ' x '+ str(ans[i]))

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
    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:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions  import gcd
#input=sys.stdin.readline
import bisect
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:
import sys
from operator import itemgetter

sys.setrecursionlimit(10**9)
input = sys.stdin.readline

def ii(): return int(input())
def mi(): return map(int, input().split())
def lmi(): return list(map(int, input().split()))
def lmif(n): return [list(map(int, input().split())) for _ in range(n)]
def ss(): return input().split()

def main():
    n = ii()

    ac = 0
    wa = 0
    tle = 0
    re = 0
    for s in [input().rstrip() for _ in range(n)]:
        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)

    return

main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect


def zz():
    return list(map(int, sys.stdin.readline().split()))


def z():
    return int(sys.stdin.readline())


def S():
    return sys.stdin.readline()


def C(line):
    return [sys.stdin.readline() for _ in range(line)]


N = z()
AC, WA, TLE, RE = 0, 0, 0, 0
for i in range(N):
    tmp = S()
    tmp = tmp[:-1]
    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:
N = int(input())
D = {"AC":0,"WA":0,"TLE":0,"RE":0}
for n in range(N):
    D[input()] += 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())
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(N):
    d[input()]+=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())

l = []
for _ in range(n):
    s = str(input())
    l.append(s)
    
print("AC x",l.count("AC"))
print("WA x",l.count("WA"))
print("TLE x",l.count("TLE"))
print("RE x",l.count("RE"))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a=[0]*4
for i in range(len(S)):
    if S[i]=='AC':
        a[0]=a[0]+1
    elif S[i]=='WA':
        a[1]=a[1]+1
    elif S[i]=='TLE':
        a[2]=a[2]+1
    elif( S[i]=='RE'):
        a[3]=a[3]+1

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

Submission status: Accepted

Solution code:
from collections import defaultdict

N = int(input())
d = defaultdict(int)

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

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

Submission status: Accepted

Solution code:
N = int(input())
keys = ['AC', 'WA', 'TLE', 'RE']

dic = {k : 0 for k in keys}

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


for k in keys:
    print(f'{k} x {dic[k]}')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

S_counter = Counter(S)

print('AC x {}'.format(S_counter.get('AC', 0)))
print('WA x {}'.format(S_counter.get('WA', 0)))
print('TLE x {}'.format(S_counter.get('TLE', 0)))
print('RE x {}'.format(S_counter.get('RE', 0)))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for key, val in result.items():
    print(f"{key} x {result[key]}")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter
n = int(input())
s = [input() for i in range(n)]
c = Counter(s)
for i in ("AC","WA","TLE","RE"):
    print(f"{i} x {c[i]}")

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
N=int(input())
S=[input() for i in range(N)]
a=0
w=0
t=0
r=0

for i in range(N):
    if S[i]=="AC":
        a+=1
    elif S[i]=="WA":
        w+=1
    elif S[i]=="TLE":
        t+=1
    elif S[i]=="RE":
        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:
# -*- coding: utf-8 -*-
# B

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

N = int(input())
d = defaultdict(int)
for i in range(N):
    s = input()[:-1]
    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']}")

Submission status: Accepted

Solution code:
n = int(input())
ac,wa,tle,re = 0,0,0,0
for _ 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:
def m():
    N = int(input())
    S = [input() for _ in range(N)]
    import collections
    c = collections.Counter(S)
    print('AC x', c.get('AC', 0))
    print('WA x', c.get('WA', 0))
    print('TLE x',c.get('TLE', 0))
    print('RE x', c.get('RE', 0))

m()

Submission status: Accepted

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
  aaa = input()
  if aaa == 'AC':
    ac += 1
  elif aaa == 'WA':
    wa += 1
  elif aaa == '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())
result = []
tmp = ""

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

print("AC x", end=" ")
print(result.count("AC"))
print("WA x", end=" ")
print(result.count("WA"))
print("TLE x", end=" ")
print(result.count("TLE"))
print("RE x", end=" ")
print(result.count("RE"))

Submission status: Accepted

Solution code:
n=int(input())
s=[input() for i in range(n)]
s_ac=s.count('AC')
s_wa=s.count('WA')
s_tle=s.count('TLE')
s_re=s.count('RE')
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())
d = {}
for i in range(n):
	s = input()
	if s not in d:
		d[s] = 1
	else:
		d[s]+=1

if "AC" not in d:
	d["AC"] = 0
print("AC x {}".format(d["AC"]))
if "WA" not in d:
	d["WA"] = 0
print("WA x {}".format(d["WA"]))
if "TLE" not in d:
	d["TLE"] = 0
print("TLE x {}".format(d["TLE"]))
if "RE" not in d:
	d["RE"] = 0
print("RE x {}".format(d["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
    if s == "WA":
        ans[1] += 1
    if s == "TLE":
        ans[2] += 1
    if s == "RE":
        ans[3] += 1

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

Submission status: Accepted

Solution code:
n = int(input())
ac, wa, tle, re = 0, 0, 0, 0
for _ 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 {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))

Submission status: Accepted

Solution code:
a=int(input())
li=[0,0,0,0]#ac,wa,tle,re
for i in range(a):
  str=input()
  if str=="AC":
    li[0]+=1
  elif str=="WA":
    li[1]+=1
  elif str=="TLE":
    li[2]+=1
  elif str=="RE":
    li[3]+=1
    
print("AC x",li[0])
print("WA x",li[1])
print("TLE x",li[2])
print("RE x",li[3])

Submission status: Accepted

Solution code:
n=int(input())
ca=0
cw=0
ct=0
cr=0
for x in range(n):
    a=input()
    if a=='AC':
        ca+=1
    elif a=="WA":
        cw+=1
    elif a=="TLE":
        ct+=1
    else:
        cr+=1
ca='AC x '+str(ca)
cw='WA x '+str(cw)
ct='TLE x '+str(ct)
cr='RE x '+str(cr)
print(ca)
print(cw)
print(ct)
print(cr)

Submission status: Accepted

Solution code:
from collections import defaultdict
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())
    S = [input() for _ in [0] * N]

    ans = defaultdict(int)
    for s in S:
        ans[s] += 1
    for s in ('AC', 'WA', 'TLE', 'RE'):
        print(s, 'x', ans[s])


main()

Submission status: Accepted

Solution code:
from collections import Counter
def resolve():
    N = int(input())
    lst = [input() for i in range(N)]
    cc = Counter(lst)
    if "AC" in cc:
        print("AC x "+str(cc["AC"]))    
    else:
        print("AC x 0")

    if "WA" in cc:
        print("WA x "+str(cc["WA"]))    
    else:
        print("WA x 0")

    if "TLE" in cc:
        print("TLE x "+str(cc["TLE"]))    
    else:
        print("TLE x 0")

    if "RE" in cc:
        print("RE x "+str(cc["RE"]))    
    else:
        print("RE x 0")
resolve()

Submission status: Accepted

Solution code:
N = int(input())
A = [input() for n in range(N)]

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

Submission status: Accepted

Solution code:
import sys


if(__name__ == "__main__"):

    N = int( input().strip() )
    results=[0]*4 #AC, WA, TLE, RE
    for i in range(N):
        result = input().strip()
        if(result=="AC"):
            results[0] += 1
        elif(result=="WA"):
            results[1] += 1
        elif(result=="TLE"):
            results[2] += 1
        else:
            results[3] += 1
    Str = "AC x " + str(results[0])
    print(Str)

    Str = "WA x " + str(results[1])
    print(Str)

    Str = "TLE x " + str(results[2])
    print(Str)

    Str = "RE x " + str(results[3])
    print(Str)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = collections.Counter(S)

anss = ['AC','WA','TLE','RE']
for ans in anss:
    print(ans + ' x ' + str(cnt[ans]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
n = int(input()) 
S = [input() for _ in range(n)]
c = collections.Counter(S)
print("AC x " + str(c["AC"]))
print("WA x " + str(c["WA"]))
print("TLE x " + str(c["TLE"]))
print("RE x " + str(c["RE"]))

Submission status: Accepted

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

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

for k in dic.keys():
    print(f"{k} x {dic[k]}")

Submission status: Accepted

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    n = input_int()
    s_list = [input() for i in range(n)]

    import collections
    counter = collections.Counter(s_list)

    for s in ["AC", "WA", "TLE", "RE"]:
        print(s + " x " + str(counter.get(s, 0)))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

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

for key in count.keys():
  print(f'{key} x {count[key]}')

Submission status: Accepted

Solution code:
b={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(int(input())):
    a=input()
    b[a]+=1
for key,val in b.items():
    print(key,'x',val)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#
# Author: Tetsuya Ishikawa <tiskw111@gmail.com>
# Date  : July 05, 2020
##################################################### SOURCE START #####################################################

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

N = int(input().strip())

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

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

##################################################### SOURCE FINISH ####################################################
# vim: expandtab tabstop=4 shiftwidth=4 fdm=marker

Submission status: Accepted

Solution code:
N=int(input())


acc=0
waa=0
tlee=0
ree=0

for i in range(N):
    t=input()
    if t=='AC':
        acc+=1
    elif t=='WA':
        waa+=1
    elif t=='TLE':
        tlee+=1
    else:
        ree+=1


print('AC x '+str(acc))
print('WA x '+str(waa))
print('TLE x '+str(tlee))
print('RE x '+str(ree))

Submission status: Accepted

Solution code:
import sys
import math as mt
#input=sys.stdin.buffer.readline  
t=1
#t=int(input())
for _ in range(t):
    n=int(input())
      
    #x,y,n=map(int,input().split())
    #l=list(map(int,input().split()))
    l=['AC', 'WA', 'TLE','RE']
    d={}
    for i in l:
        d[i]=0
    for i in range(n):
        s=input()
        d[s]+=1
    for i in l:
        print(i,'x',d[i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')
n = I()
d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(n):
    s = S()
    d[s] += 1
for k, v in d.items():
    print(f'{k} x {v}')

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os
import collections

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve(test_def_name=""):
    # 数値取得サンプル
    #   1行1項目
    #   1行2項目 x, y = map(int, input().split())
    #   1行N項目 x = list(map(int, input().split()))
    #   N行1項目 x = [int(input()) for i in range(n)]
    #   N行N項目 x = [list(map(int, input().split())) for i in range(n)]

    # 文字取得サンプル
    #   1行1項目 x = input()
    #   1行1項目(1文字ずつリストに入れる場合) x = list(input())
    n = int(input())
    s_s = [input() for i in range(n)]

    a_counter = collections.Counter(s_s)

    for i in ["AC", "WA", "TLE", "RE"]:
        print(i + " x " + str(a_counter.get(i, 0)))


# テストクラス
class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """6
AC
TLE
AC
AC
WA
TLE"""
        output = """AC x 3
WA x 1
TLE x 2
RE x 0"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC"""
        output = """AC x 10
WA x 0
TLE x 0
RE x 0"""
        self.assertIO(test_input, output)

    # 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
    def tes_t_1original_1(self):
        test_input = """データ"""
        output = """データ"""
        self.assertIO(test_input, output)


# 実装orテストの呼び出し
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main()

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
for i, j in s.items():
    print(f"{i} x {j}")