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: Wrong Answer

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 =="WA":
        WA+=1
    elif i=="AC":
        AC+=1
    elif i=="TLE":
        TLE+=1
    else:
        RE+=1
print("AC x　"+str(AC))
print("WA x "+str(WA))
print("TLE x",TLE)
print("RE x",RE)

Submission status: Wrong Answer

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','×',ac)
print('WA','×',wa)
print('TLE','×',tle)
print('RE','×',re)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = 0
b = 0
c = 0
d = 0
for n in range(N):
    s = input()
    if s == 'AC':
        a += 1
    if s == 'WA':
        b += 1
    if s == 'TLE':
        c += 1
    if s == 'RE':
        d += 1
print('AC × {}'.format(a))
print('WA × {}'.format(b))
print('TLE × {}'.format(c))
print('RE × {}'.format(d))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
#pyrival orz
import os
import sys
from io import BytesIO, IOBase

"""
    for _ in range(int(input())):
    n,m=map(int,input().split())
    n=int(input())
    a = [int(x) for x in input().split()]
"""

def main():
    from collections import defaultdict
    ans=defaultdict(int)
    for _ in range(int(input())):
        ans[input()]+=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']))
    


# 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")

# endregion

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

for i, j in T.items():
    print(str(i) +" × " +str(j))

Submission status: Wrong Answer

Solution code:
from collections import Counter
n = int(input())
a = [input() for i in range(n)]
b = Counter(a)
b.setdefault("AC", 0)
b.setdefault("WA", 0)
b.setdefault("TLE", 0)
b.setdefault("RE", 0)
for i in b.keys():
    print(i + " x " + str(b[i]))

Submission status: Wrong Answer

Solution code:
import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s)
print("AC x " + str(s["AC"]))
print("WA x " + str(s["WA"]))
print("ATLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()

"""========main code==============="""

a=ii()
lol=["AC","WA","TLE","RE"]
d=defaultdict(int)
for _ in range(a):
    p=input()
    d[p]+=1
for i in lol:
    print(i,"X",d[i])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = [0] * n
for i in range(n):
    s[i] = input()
print('AC × ' + str(s.count('AC')))
print('WA × ' + str(s.count('WA')))
print('TLE × ' + str(s.count('TLE')))
print('RE × ' + str(s.count('RE')))

Submission status: Wrong Answer

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 {}'.format(Ac))
print('WA x {}'.format(Wa))
print('TLE x {}'.format(Tle))
print('RE x {}'.format(Re))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = []
for i in range(n):
  s_ = input()
  s.append(s_)
  
res = ['AC', 'WA', 'TLE', 'RE']
for i in res:
  print(i,'×', s.count(i))

Submission status: Wrong Answer

Solution code:
n=int(input())
s=[input() for _ in range(n)]
c0=0
c1=0
c2=0
c3=0
for i in s:
  if i=="AC":
    c0+=1
  elif i=="WA":
    c1+=1
  elif i=="TLE":
    c2+=1
  elif i=="RE":
    c3+=1
print("AC"+" "+"×"+" "+str(c0))
print("WA"+" "+"×"+" "+str(c1))
print("TLE"+" "+"×"+" "+str(c2))
print("RE"+" "+"×"+" "+str(c3))

Submission status: Wrong Answer

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(f"AC x {ac}")
print(f"WA x {wa}")
print(f"TLE x {tle}")
print(f"RE x {re}")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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 × " + str(AC))
print("WA × " + str(WA))
print("TLE × " + str(TLE))
print("RE × " + str(RE))

Submission status: Wrong Answer

Solution code:
AC = 0
WA = 0
TLE = 0
RE = 0

N = int(input())
for _ in range(N):
    S = input()
    if S == 'AC':
        AC += 1
    elif S == 'WA':
        WA += 1
    elif S == 'TLE':
        TLE += 1
    else:
        WA += 1

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

Submission status: Wrong Answer

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 ×",d[0])
print("WA ×",d[1])
print("TLE ×",d[2])
print("RE ×",d[3])

Submission status: Wrong Answer

Solution code:
N = int(input())

AC_n = 0
WA_n = 0
TLE_n = 0
RE_n = 0

for i in range(N):
    ans = input()
    if (ans == "AC"):
        AC_n += 1
    elif(ans == "WA"):
        WA_n += 1
    elif(ans == "TLE"):
        TLE_n += 1
    elif(ans == "RE"):
        RE_n += 1

print(f'AC × {AC_n}')
print(f'WA × {WA_n}')
print(f'TLE × {TLE_n}')
print(f'RE × {RE_n}')

Submission status: Wrong Answer

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 × '+str(ans[0]))
print('WA × '+str(ans[1]))
print('TLE × '+str(ans[2]))
print('RE × '+str(ans[3]))

Submission status: Wrong Answer

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


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


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

Submission status: Wrong Answer

Solution code:
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def str_inp():
    '''
    文字列をリストとして読み込む
    '''
    return list(input()[:-1])


n = inp()
ans = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(n):
    s = input()[:-1]
    print(s)
    ans[s] += 1

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

Submission status: Wrong Answer

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 == "WA":
        RE += 1
print("AC x", ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    N = int(_in[0])  # type:int
    S_arr = []
    for i in range(N):
        _ = _in[i+1]
        S_arr.append(_)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    c_arr = [0] * 4
    for S in S_arr:
        if S == 'AC':
            c_arr[0] += 1
        elif S == 'WA':
            c_arr[1] += 1
        elif S == 'TLE':
            c_arr[2] += 1
        else:
            c_arr[3] += 1
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(f'AC x{c_arr[0]}')
    print(f'WA x{c_arr[1]}')
    print(f'TLE x{c_arr[2]}')
    print(f'RE x{c_arr[3]}')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math
import heapq
from collections import defaultdict, deque
from decimal import *
def r():
    return int(input())
def rm():
    return map(int,input().split())
def rl():
    return list(map(int,input().split()))

ac=0;wa=0;tle=0;re=0
for _ in range(r()):
    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: Wrong Answer

Solution code:
n = int(input())
a, b, c, d = 0, 0, 0, 0
for i in range(n):
    s = input()
    if s == 'AC': a -= -1
    if s == 'WA': b -= -1
    if s == 'TLE': c -= -1
    if s == 'RE': d -= -1
print('AC *', a)
print('WA *', b)
print('TLE *', c)
print('RE *', d)

Submission status: Wrong Answer

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 tle=="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: Wrong Answer

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

Submission status: Wrong Answer

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

from collections import Counter
c=Counter(s)

print( "AC × "+str(c["AC"]) )
print( "WA × "+str(c["WA"]) )
print( "TLE × "+str(c["TLE"]) )
print( "RE × "+str(c["RE"]) )

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
#import numpy as np
#import functools
#import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm
#import collections as C #most_common
#import math
#import sympy

N = int(input())
#A,B= map(int,input().split())
#P = list(map(int,input().split()))
#S = str(input())
#T = str(input())
a=0
b=0
c=0
d=0
for i in range(N):
    S = str(input())
    if S=='AC':
        a+=1
    elif S=='WA':
        b+=1
    elif S=='TLE':
        c+=1
    else:
        d+=1

print('AC ×',a)
print('WA ×',b)
print('TLE ×',c)
print('RE ×',d)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
c1,c2,c3,c4=0,0,0,0
for i in range(n):
  s=input()
  if(s=='AC'):
    c1+=1
  elif(s=='WA'):
    c2+=1
  elif(s=='TLE'):
    c3+=1
  else:
    c4+=1
print('AC X',c1)
print('WA X',c2)
print('TLE X',c3)
print('RE X',c4)

Submission status: Wrong Answer

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

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: Wrong Answer

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("TLE x", S.count("RE"))

Submission status: Wrong Answer

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 ✕ "+str(ac))
print("WA ✕ "+str(wa))
print("TLE ✕ "+str(tle))
print("RE ✕ "+str(re))

Submission status: Wrong Answer

Solution code:
#

import sys
input=sys.stdin.readline

def main():
    N=int(input())
    r=["AC","WA","TLE","RE"]
    c=[0]*4
    for i in range(N):
        s=input().strip("\n")
        c[r.index(s)]+=1
    for i in range(4):
        print(r[i],"×",c[i])
    
    
    
if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
from bisect import bisect,bisect_right,bisect_left

def get_int():
    return int(stdin.readline().strip())


def get_tuple():
    return map(int, stdin.readline().split())


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

n = get_int()
dic = defaultdict(int)
for _ in range(n):
    st = input()
    dic[st] += 1
for val in ['AC','WA','TLE','RE']:
    print(val+" * "+str(dic[val]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict as d
from itertools import combinations as c
from string import ascii_lowercase as a

n = int(input())
dd = d(int)
for i in range(n):
	e = input()
	dd[e] += 1
print('AC x', dd['AC'])
print('WA x', dd['AC'])
print('TLE x', dd['AC'])
print('RE x', dd['AC'])

Submission status: Wrong Answer

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
    elif S == "RE":
        r += 1
print("AC","x",a)
print("WA","x",w)
print("TLE","x",t)
print("RA","x",r)

Submission status: Wrong Answer

Solution code:
wa = {}

for _ in range(int(input())):
  st = input()
  if st not in wa.keys():
    wa[st] = 0
  else:
    wa[st] += 1
  print(st," x ",wa[st])

Submission status: Wrong Answer

Solution code:
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

    N = II()
    r = []
    for i in range(N):
        r.append(input())
    r = Counter(r)
    print('AC *',r['AC'])
    print('WA *',r['WA'])
    print('TLE *',r['TLE'])
    print('RE *',r['RE'])


    
main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

list = []
for i in range(N):
    list.append(str(input()))
    a = list.count("AC")
    b = list.count("WA")
    c = list.count("TLE")
    d = list.count("RE")

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

i = 1
AC = 0
WA = 0
TLE = 0
RE = 0
list = []
for i in range(N):
    list.append(str(input()))
    a = list.count("AC")
    b = list.count("WA")
    c = list.count("TLE")
    d = list.count("RE")

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

i = 1
AC = 0
WA = 0
TLE = 0
RE = 0
list = []
for i in range(N):
    list.append(str(input()))
    a = list.count("AC")
    b = list.count("WA")
    c = list.count("TLE")
    d = list.count("RE")

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

Submission status: Time Limit Exceeded

Solution code:
n= int(input())


l=[]

for i in range(n):
    l.append(input())
    l.sort()

ac=l.count('AC')
tle=l.count('TLE')
wa=l.count('WA')
re=l.count('RE')
print('AC x '+ str(ac))
print('WA x '+ str(wa))
print('TLE x '+ str(tle))
print('RE x '+ str(re))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

r = []

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

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

for j in r:
  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: Time Limit Exceeded

Solution code:
input_n = input()
N = int(input_n)

check_list = ['AC', 'WA', 'TLE', 'RE']
count_list = [0, 0, 0, 0]

for i in range(N):
    flag = 0
    Si = input()
    while flag<4:
        if Si==check_list[flag]:
            count_list[flag] += 1
        else:
            flag += 1

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

Submission status: Accepted

Solution code:
# listじゃなくてdict使いたい
n = int(input())
j = [0] * 4
moji = ["AC", "WA", "TLE", "RE"]
for i in range(n):
    s=input()
    if s == "AC":
        j[0] += 1
    elif s=="WA":
        j[1] += 1
    elif s=="TLE":
        j[2] += 1
    elif s == "RE":
        j[3] += 1
for k in range(4):
    print(f"{moji[k]} x {j[k]}")

Submission status: Accepted

Solution code:
N=int(input())

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

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

    if S=="AC":
        item["AC"]+=1
    elif S=="WA":
        item["WA"]+=1
    elif S=="TLE":
        item["TLE"]+=1
    else:
        item["RE"]+=1

print("AC x",end=" ")
print(item["AC"])

print("WA x",end=" ")
print(item["WA"])

print("TLE x",end=" ")
print(item["TLE"])

print("RE x",end=" ")
print(item["RE"])

Submission status: Accepted

Solution code:
N = int(input())
AC, WA, TLE, RE = 0, 0, 0, 0
for i in range(N):
  S = input()
  if S == 'AC':
    AC += 1
  elif S == 'WA':
    WA += 1
  elif S == 'TLE':
    TLE += 1
  elif S == 'RE':
    RE += 1
print('AC x {}\nWA x {}\nTLE x {}\nRE x {}\n'.format(AC, WA, TLE, RE))

Submission status: Accepted

Solution code:
N=int(input())
ac=0
wa=0
tle=0
re=0
for _ in range(N):
  s=input()
  if 'AC'==s:
     ac+=1
  elif 'WA'==s:
    wa+=1
  elif 'TLE'==s:
    tle+=1
  elif 'RE'==s:
    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())
a=[0]*4
b=["AC","WA","TLE","RE"]
for i in range(n):
    s=input()
    for j in range(4):
        if s == b[j]:
            a[j]+=1
for i in range(4):
    print(b[i]+" x "+str(a[i]))

Submission status: Accepted

Solution code:
count = int(input())
lists = []

for i in range(count):
  new = input()
  lists.append(new)

ac_count = lists.count('AC')
wa_count = lists.count('WA')
tle_count = lists.count('TLE')
re_count = lists.count('RE')

print("AC x " + str(ac_count))
print("WA x " + str(wa_count))
print("TLE x " + str(tle_count))
print("RE x " + str(re_count))

Submission status: Accepted

Solution code:
N = int(input())
con = [input() for i in range(N)]
C = [0,0,0,0]
for s in con:
    if(s == "AC"):
        C[0] +=1
    if(s == "WA"):
        C[1] +=1
    if(s == "TLE"):
        C[2] +=1
    if(s == "RE"):
        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:
res = []

n = int(input())

for i in range(n):
    r = input()
    res.append(r)

ac = res.count("AC")
wa = res.count("WA")
tle = res.count("TLE")
re = res.count("RE")

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

Submission status: Accepted

Solution code:

n = int(input())
AC,WA,TLE,RE = 0,0,0,0

for x in range(n):
    s = input()
    if s == 'AC':
        AC = AC + 1
    elif s == 'WA':
        WA = WA + 1
    elif s == 'TLE':
        TLE = TLE + 1
    elif s == 'RE':
        RE = RE + 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    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))    

resolve()

Submission status: Accepted

Solution code:
N = int(input())
S = [input() for n in range(N)]
assert len(S) == N
counts = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

for s in S:
  counts[s] += 1

for key in ['AC', 'WA', 'TLE', 'RE']:
	print('{} x {}'.format(key, counts[key]))

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 {}'.format(AC))
print('WA x {}'.format(WA))
print('TLE x {}'.format(TLE))
print('RE x {}'.format(RE))

Submission status: Accepted

Solution code:
n=int(input())
a,w,t,r=0,0,0,0
for i in range(n):
  g=input()
  if g=='AC':
    a+=1
  if g=='WA':
    w+=1
  if g=='TLE':
    t+=1
  if g=='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:
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:
N = int(input())
judge = {"AC":0, "WA":0, "TLE":0, "RE":0}
 
for _ in range(N):
    j_input = input()
    for j in judge.keys():
        if j_input == j:
            judge[j] += 1
 
for j in judge.keys():
    print(j , end = " x ")
    print(judge[j])

Submission status: Accepted

Solution code:

n = int(input())

d = {"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(n):
    st = input()
    d[st] += 1

for x,y in d.items():
    print(x,"x",y)

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 i in dic:
  print(i, 'x', dic[i])

Submission status: Accepted

Solution code:
from sys import stdin

input = stdin.readline
from collections import Counter

def solve():
    n = int(input())
    verdict = [ inp for inp in stdin.read().splitlines()]
    c = Counter(verdict)
    print(f'AC x {c["AC"]}')
    print(f'WA x {c["WA"]}')
    print(f'TLE x {c["TLE"]}')
    print(f'RE x {c["RE"]}')


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())
C = 0
D = 0
E = 0
F = 0
S = ''

for i in range(N):
    S = input()
    if S == 'AC':
        C += 1
    elif S == 'WA':
        D += 1
    elif S == 'TLE':
        E += 1
    elif S == 'RE':
        F += 1
print('AC x '+ str(C), 'WA x ' + str(D),  'TLE x ' + str(E),  'RE x ' + str(F), sep='\n')

Submission status: Accepted

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

for i in range(n):
    s = input()
    if s == 'AC':
        ac += 1
    elif s == 'WA':
        wa += 1
    elif s == 'TLE':
        tle += 1
    else:
        re += 1

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

Submission status: Accepted

Solution code:
N = int(input())
ans_ac = 0
ans_wa = 0
ans_tle =0
ans_re =0

for i in range(N):
    S = input()
    if S == 'AC':
        ans_ac += 1
    elif S == 'WA':
        ans_wa += 1
    elif S == 'TLE':
        ans_tle += 1
    else:
        ans_re += 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:
N=int(input())
S=[input()for _ in range(N)]
from collections import*
C=Counter(S)
print('AC','x',C['AC'])
print('WA','x',C['WA'])
print('TLE','x',C['TLE'])
print('RE','x',C['RE'])

Submission status: Accepted

Solution code:
N = int(input())

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

def f(s):
  c = len([x for x in data if x in s])
  print(f"{s} x {c}")
  
f("AC")
f("WA")
f("TLE")
f("RE")

Submission status: Accepted

Solution code:
import collections
n = int(input())
s = [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:
N = int(input())

S = [""]*N

Dict={}

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


for i in range(N):
    S[i] = str(input())
    
for  j in S:
    if j in  Dict:
        temp = Dict[j]
        Dict[j] = temp + 1
    else:
        Dict[j] = 1
        
if "AC" in Dict:
    ac = Dict["AC"]
    
if "WA" in Dict:
    wa = Dict["WA"]
    
if "TLE" in Dict:
    tle = Dict["TLE"]
    
if "RE" in Dict:
    re = Dict["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())
li=[input() for _ in range(n)]
ac=li.count("AC")
wa=li.count("WA")
tle=li.count("TLE")
re=li.count("RE")
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Submission status: Accepted

Solution code:
n = int(input())

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

ac = c.count("AC")
wa = c.count("WA")
tle = c.count("TLE")
re = c.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())
ans = [input() for i in range(n)]

cA = ans.count("AC")
print(f"AC x {cA}")
cW = ans.count("WA")
print(f"WA x {cW}")
cT = ans.count("TLE")
print(f"TLE x {cT}")
cR = ans.count("RE")
print(f"RE x {cR}")