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:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')


def main():
    N = I()
    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", "×", AC)
    print("WA", "×", WA)
    print("TLE", "×", TLE)
    print("RE", "×", RE)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S = []
for s in range(N):
  S.append(input())
print('AC', end=' ') 
print('×', end=' ')
print(S.count('AC'))

print('WA', end=' ') 
print('×', end=' ')
print(S.count('WA'))

print('TLE', end=' ') 
print('×', end=' ')
print(S.count('TLE'))

print('RE', end=' ') 
print('×', end=' ')
print(S.count('RE'))

Submission status: Wrong Answer

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

for i in range(n):
  judge = input()
  if judge == 'AC':
    list[0] += 1
  elif judge == 'WA':
    list[1] += 1
  elif judge == 'TLE':
    list[2] += 1
  elif judge == 'RE':
    list[3] += 1
    
print( 'AC x {}'.format(list[0]) )
print( 'WA x {}'.format(list[1]) )
print( 'TLE x {}'.format(list[2]) )
print( 'RE x 0'.format(list[3]) )

Submission status: Wrong Answer

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

print("AC ×", list.count("AC"))
print("WA ×", list.count("WA"))
print("TLE ×", list.count("TLE"))
print("RE ×", list.count("RE"))

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(n):
    moji=input()
    if moji =='AC':
        AC+=1
    elif moji =='WA':
        WA+=1
    elif moji =='TLE':
        TLE+=1
    else:
        RE+=1
A=[AC,WA,TLE,RE]
B=['AC','WA','TLE','RE']
for i in range(4):
    q=A[i]
    print(B[i],end='')
    print(' × ',end='')
    print(q)

Submission status: Wrong Answer

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

print('AC × {}'.format(A.count('AC')))
print('WA × {}'.format(A.count('WA')))
print('TLE × {}'.format(A.count('TLE')))
print('RE × {}'.format(A.count('RE')))

Submission status: Wrong Answer

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 × {}\nWA × {}\nTLE × {}\nRE × {}".format(AC,WA,TLE,RE))

Submission status: Wrong Answer

Solution code:
from collections import Counter
n=int(input())
s=[input() for i in range(n)]
print("AC","×",s.count("AC"))
print("WA","×",s.count("WA"))
print("TLE","×",s.count("TLE"))
print("RE","×",s.count("RE"))

Submission status: Wrong Answer

Solution code:
from collections import Counter
import sys

sys.setrecursionlimit(10 ** 6)

mod = 1000000007
inf = int(1e18)

dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft



def main():
    n = int(input())
    s = [input() for i in range(n)]
    r = {}
    for x in s:
        r[x] = r.get(x, 0) + 1

    for i in ['AC', 'WA', "TLE", "E"]:
        print("{} x {}".format(i, r.get(i, 0)))

main()

Submission status: Wrong Answer

Solution code:
score = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
N = int(input())
for _ in range(N):
    result = input()
    if result == 'AC':
        score[result] += 1
    elif result == 'WA':
        score[result] += 1
    elif result == 'TLE':
        score[result] += 1
    elif result == 'RE':
        score[result] += 1
for i in score.keys():
    print(i, '×', score[i])

Submission status: Wrong Answer

Solution code:
N = int(input())
judge = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(N):
  judge[input()] += 1
print('AC X ' + str(judge['AC']))
print('WA X ' + str(judge['WA']))
print('TLE X ' + str(judge['TLE']))
print('RE X ' + str(judge['RE']))

Submission status: Wrong Answer

Solution code:
num = int(input())
test = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(num):
    result = input()
    for j in test.keys():
        if result == j:
            test[result] += 1
for i in test:
    print(i, '×', str(test[i]))

Submission status: Wrong Answer

Solution code:
n = int(input())

j = list()
for _ in range(n):
    string = input()
    j.append(string)

ac = j.count("AC")
wa = j.count("WA")
tel = j.count("TEL")
re = j.count("RE")
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TEL x " + str(tel))
print("RE x " + str(re))

Submission status: Wrong Answer

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

numAC = 0
numWA = 0
numTLE = 0
numRE = 0

for i in s:
    if i == "AC":
        numAC += 1
    elif i == "WA":
        numWA += 1
    elif i == "TLE":
        numTLE += 1
    elif i == "RE":
        numRE += 1
        

print("AC × " + str(numAC))
print("WA × " + str(numWA))
print("TLE × " + str(numTLE))
print("RE × " + str(numRE))

Submission status: Wrong Answer

Solution code:
n = int(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 × {}'.format(a))
print('WA × {}'.format(b))
print('TLE × {}'.format(c))
print('RE × {}'.format(d))

Submission status: Wrong Answer

Solution code:
n = int(input())

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

while n > 0:
    t = input()
    hashmap[t] = hashmap.get(t, 0) + 1
    n -= 1

for key, val in hashmap.items():
    print(key + "x" + str(val))

Submission status: Wrong Answer

Solution code:
N=int(input())
result_list = ['AC', 'WA', 'TLE', 'RE']
count_list = [0, 0, 0, 0]
for i in range(N):
  S = input()
  count_list[result_list.index(S)] = count_list[result_list.index(S)] + 1

for i in range(4):
  print(result_list[i]+' × '+str(count_list[i]))

Submission status: Wrong Answer

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

    s = [0 for i in range(n)]
    for i in range(n):
        s[i] = input()

    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
        else:
            r += 1

    print('ACx' + str(a))
    print('WAx' + str(w))
    print('TLEx' + str(t))
    print('REx' + str(r))
    
main()

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

Submission status: Wrong Answer

Solution code:
N = int(input())
J = [0, 0, 0, 0]
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
    else:
        J[3] += 1

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

Submission status: Wrong Answer

Solution code:
n = int(input())
lis = [0 for i in range(4)]
mo = ["AC","WA","TLE","RE"]
for ii in range(n):
    i = input()
    if i=="AC":
        lis[0]+=1
    elif i=="WA":
        lis[1]+=1
    elif i=="TLE":
        lis[2]+=1
    elif i == "RE":
        lis[3]+=1

for i in range(4):
    tmp = "{0} × {1}".format(mo[i],lis[i])
    print(tmp)

Submission status: Wrong Answer

Solution code:
count1=0
count2=0
count3=0
count4=0
N=int(input())
for i in range(N):
  A=input()
  if A=="AC":
    count1=count1+1
  elif A=="WA":
    count2=count2+1
  elif A=="TLE":
    count3=count2+1
  elif A=="RE":
    count4=count2+1
print("AC x "+str(count1))
print("WA x "+str(count2))
print("TLE x "+str(count3))
print("RE x "+str(count4))

Submission status: Wrong Answer

Solution code:
n=int(input())
s=[]
for i in range(n):
    s.append(input())
a=[0]*4
for i in range(n):
    if s[i]=='AC':
        a[0]+=1
    elif s[i]=='WA':
        a[1]+=1
    elif s[i]=='TLE':
        a[2]+=1
    else:
        a[3]+=1
print("AC×{}".format(a[0]))
print("WA×{}".format(a[1]))
print("TLE×{}".format(a[2]))
print("RE×{}".format(a[3]))

Submission status: Wrong Answer

Solution code:
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(int(input())):
	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: Wrong Answer

Solution code:
n = int(input())
ac_c = 0
wa_c = 0
tle_c = 0
re_c = 0
for i in range(n):
    s = input()
    if s == "AC":
        ac_c += 1
    elif s == "WA":
        wa_c += 1
    elif s == "TLE":
        tle_c += 1
    else:
        re_c +=1
print("AC" +" "+ "x"+" " + str(ac_c))
print("AC" +" "+ "x"+" "+ str(wa_c))
print("AC" +" "+ "x"+" "+ str(tle_c))
print("AC" +" "+ "x"+" "+ str(re_c))

Submission status: Wrong Answer

Solution code:
from collections import Counter
n = int(input())
s = list(str(input()) for _ in range(n))
C_s = Counter(s)
s_l = ['AC', 'WA', 'TLE', 'RE']
for item in s_l:
    print(item, ' X ', C_s[item])

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    cnt = [0, 0, 0, 0]
    for _ in range(n):
        s = input()
        if s == 'AC':
            cnt[0] += 1
        elif s == 'WA' :
            cnt[1] += 1
        elif s == 'TLE':
            cnt[2] += 1
        elif s == 'RE':
            cnt[3] += 1

    print(f'AC × {cnt[0]}')
    print(f'WA × {cnt[1]}')
    print(f'TLE × {cnt[2]}')
    print(f'RE × {cnt[3]}')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S_list = [input() for i in range(N)]
AC = S_list.count('AC')
WA = S_list.count('WA')
TLE = S_list.count('TLE')
RE = S_list.count("RE")
print('AC × {}'.format(AC))
print('WA × {}'.format(WA))
print('TLE × {}'.format(TLE))
print('RE × {}'.format(RE))

Submission status: Wrong Answer

Solution code:
N = int(input())
Ss = [str(input()) for x in range(N)]
r = [0]*4
for s in Ss:
  if s == "AC":
    r[0] += 1
  elif s == "WA":
    r[1] += 1
  elif s == "TLE":
    r[2] += 1
  elif s == "RE":
    r[3] += 1
print("AC × " + str(r[0]))
print("WA × " + str(r[1]))
print("TLE × " + str(r[2]))
print("RE × " + str(r[3]))

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 x in s:
    if x == "AC":
        ac += 1
    elif x == "WA":
        wa += 1
    elif x == "TLE":
        tle += 1
    elif x == "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: Wrong Answer

Solution code:
n = int(input())
s = [0] * n
for i in range(n):
    s[i] = input()
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: Wrong Answer

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

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

for i, j in zip(data.keys(), data.values()):
    print(i + " × " + str(j))

Submission status: Wrong Answer

Solution code:
n = int(input());

s = [input() for i in range(n)]

ac = wa = tle = re = 0

for s_kind in s:
    if s_kind == "AC":
        ac += 1
    elif s_kind == "WA":
        wa += 1
    elif s_kind == "TLE":
        tle += 1
    elif s_kind == "RE":
        re += 1
    
print(ac)
print(wa)
print(tle)
print(re)

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'+' '+str(c1))
print('WA X'+' '+str(c2))
print('TLE X'+' '+str(c3))
print('RE X'+' '+str(c4))

Submission status: Wrong Answer

Solution code:
import collections

n = int(input())
case = list(input() for _ in range(n))

cn = collections.Counter(case)
print(cn)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
judge = {}
judge['AC'] = 0
judge['WA'] = 0
judge['TLE'] = 0
judge['RE'] = 0

for i in range(n):
    s = input()
    if s == 'AC':
        judge['AC'] += 1
    if s == 'WA':
        judge['WA'] += 1
    if s == 'TLE':
        judge['TLE'] += 1
    if s == 'RE':
        judge['RE'] += 1
for key, value in judge.items():
    print("{} × {}".format(key, value))

Submission status: Wrong Answer

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

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
  else:
    break

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

Submission status: Wrong Answer

Solution code:
n = int(input())

l = [0]*4
w = ["AC","WA","TLE","RE"]

for i in range(n):
    s = input()
    if s == "AC":
        l[0] += 1
    elif s == "WA":
        l[1] += 1
    elif s == "TLE":
        l[2] += 1
    else:
        l[3] +=1
        
for i in range(4):
    print(w[i] + " × " + str(l[i]))

Submission status: Wrong Answer

Solution code:
a=int(input())
b=0
d=0
e=0
f=0
g=0
while b<a:
    c=input()
    if c=='AC':
        d=d+1
    if c=='WA':
        e=e+1
    if c=='TLE':
        f=f+1
    if c=='RE':
        g=g+1
    b=b+1
print('AC','x',d)
print('WA','x',e)
print('TLE','x',f)
print('RE','x',f)

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
    if s == "WA":
       wa += 1
    if s == "TLE":
       tle += 1
    if s == "RE":
       re += 1

a1 = "AC × " + str(ac)
a2 = "WA × " + str(wa)
a3 = "TLE × " + str(tle)
a4 = "RE × " + str(re)

print(a1)
print(a2)
print(a3)
print(a4)

Submission status: Wrong Answer

Solution code:
N = int(input())
S = []
for _ in range(N): 
    S.append(input())
AC = S.count('AC')
WA = S.count('WA')
TLE = S.count('TLE')
RE = S.count('RE')
print('AC ×', AC)
print('WA ×', WA)
print('TLE ×', TLE)
print('RE ×', RE)

Submission status: Wrong Answer

Solution code:
N=int(input())
lis=[0,0,0,0]
for i in range(N):
  tmp=input()
  if tmp=="AC":
    lis[0]+=1
  elif tmp=="WA":
    lis[1]+=1
  elif tmp=="TLE":
    lis[2]+=1
  else:
    lis[3]+=1
print("AC × "+str(lis[0]))
print("WA × "+str(lis[1]))
print("TLE × "+str(lis[2]))
print("RE × "+str(lis[3]))

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:
n = int(input())
lol=[]
for _ in range(n):
    lol.append(input())
print('AC X ',lol.count('AC'))
print('WA X ',lol.count('WA'))
print('TLE X ',lol.count('TLE'))
print('RE X ',lol.count('RE'))

Submission status: Wrong Answer

Solution code:
N = int(input())

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

#print(N)
#print(S)

count = [0, 0, 0, 0]

for s in S:
  if s in "AC":
    count[0] += 1
  elif s in "WA" :
    count[1] += 1
  elif s in "TLE" :
    count[2] += 1
  elif s in "RE":
    count[3] += 1
    
print("AC x " + str(count[0]))
print("WA x " + str(count[1]))
print("TL x " + str(count[2]))
print("RE x " + str(count[3]))

Submission status: Wrong Answer

Solution code:
AC,WA,TLE,RE=0,0,0,0
for T in range(int(input())):
	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=0
b=0
c=0
d=0
for _ in range(n):
  s=input()
  if s=='AC':
    a+=1
  elif s=='WA':
    b+=1
  elif s=='TLE':
    c+=1
  else:
    d+=1
print('AC　×　',end='')
print(a)
print('WA　×　',end='')
print(b)
print('TLE　×　',end='')
print(c)
print('RE　×　',end='')
print(d)

Submission status: Wrong Answer

Solution code:
N=int(input())
S=[0]*(N+1)
T=[0]*4
for i in range(N):
    S[i]=input()
for i in range(N):
    if S[i]=="AC":
        T[0]+=1
    elif S[i]=="WA":
        T[1]+=1
    elif S[i]=="TLE":
        T[2]+=1
    else:
        T[3]+=1
print("AC ×",T[0])
print("WA ×",T[1])
print("TLE ×",T[2])
print("RE ×",T[3])

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    ac = 0
    wa = 0
    tle = 0
    re = 0
    for i in range(0, N):
        res = input()
        if (res == 'AC'):
            ac += 1
        if (res == 'WA'):
            wa += 1
        if (res == 'TLE'):
            tle += 1
        if (res == 'RE'):
            re += 1
    print(f"AC x {ac}")
    print(f"WA x {wa}")
    print(f"TEL x {tle}")
    print(f"RE x {re}")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(0,a) :
  b = str(input())
  if b == "AC" :
    AC = AC + 1
  elif b == "WA" :
    WA = WA + 1
  elif b == TLE :
    TLE = TLE + 1
  else :
    RE = 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 = []
for i in range(N):
    S.append(input())

print("AC × ",S.count("AC"))
print("WA × ",S.count("WA"))
print("TLE × ",S.count("TLE"))
print("RE × ",S.count("RE"))

Submission status: Wrong Answer

Solution code:
import collections
N=int(input())
l=[input() for _ in range(N)]
tmp = collections.Counter(l)
print('AC','×',tmp["AC"])
print('WA','×',tmp["WA"])
print('TLE','×',tmp["TLE"])
print('RE','×',tmp["RE"])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

result=[0,0,0,0]

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

AC = []
WA = []
TLE = []
RE = []

for i in range(N):
    if S[i] == "AC":
        AC.append(i)
    elif S[i] == "WA":
        WA.append(i)
    elif S[i] == "TLE":
        TLE.append(i)
    else:
        RE.append(i)
print("AC", "×", len(AC))
print("WA", "×", len(WA))
print("TLE", "×", len(TLE))
print("RE", "×", len(RE))

Submission status: Wrong Answer

Solution code:
n = int(input())
ac_c = 0
wa_c = 0
tle_c = 0
re_c = 0
for i in range(n):
    s = input()
    if s == "AC":
        ac_c += 1
    elif s == "WA":
        wa_c += 1
    elif s == "TLE":
        tle_c += 1
    else:
        re_c +=1
print("AC" + "x" + str(ac_c))
print("AC" + "x" + str(wa_c))
print("AC" + "x" + str(tle_c))
print("AC" + "x" + str(re_c))

Submission status: Wrong Answer

Solution code:
a = int(input())
i = 0
o = 0
p = 0
s = 0
l = 0
while i < a :
    b = input()
    if b == "AC" :
        o = o + 1
    if b == "WA" :
        p = p + 1
    if b == "TLE" :
        s = s + 1
    if b == "RE" :
        l = l + 1
    i = i + 1
print("AC" , "*" , o)
print("WA" , "*" , p)
print("TLE" , "*" , s)
print("RE" , "*" , l)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(N):
    a = input()
    if a in ans.keys():
        ans[a] +=1
    else:
        ans[a] = 1

for k,v in ans.items():
    print('{} × {}'.format(k,v))

Submission status: Wrong Answer

Solution code:
a=int(input())
AC=[]
WA=[]
TLE=[]
RE=[]
for i in range(a):
  s=(input())
  if s=='AC':
     AC.append(s)
  if s=='TLE':
     TLE.append(s)   
  if s=='WA':
     WA.append(s)
  if s=='RE':
     RE.append(s)
print('AC ×',len(AC))
print('WA ×',len(WA))
print('TLE ×',len(TLE))
print('RE ×',len(RE))

Submission status: Wrong Answer

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

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

for i in range(n):
    s[i] = str(input())
    if s[i] == "AC":
        ac += 1
    elif s[i] == "WA":
        wa += 1
    elif s[i] == "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:
rows = int(input())
x = [input() for i in range(rows)]
print("AC × {}".format(x.count('AC')))
print("WA × {}".format(x.count('WA')))
print("TLE × {}".format(x.count('TLE')))
print("RE × {}".format(x.count('RE')))

Submission status: Wrong Answer

Solution code:
from collections import Counter
N = int(input())
S = [input() for i in range(N)]
res = Counter(S)
print(f"AC x {res['AC']}")
print(f"AC x {res['WA']}")
print(f"AC x {res['TLE']}")
print(f"AC x {res['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
    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:
n = int(input())
ans = {
	'AC': 0,
  	'WA': 0,
  	'TLE': 0,
  	'RE': 0
}

for i in range(n):
  x = input()
  ans[x] += 1
  
for i in list(ans.keys()):
  print(i +'x'+str(ans[i]))

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
n=int(input())
dic=defaultdict(int)
for i in range(n):
    x=input()
    if x in dic:
        dic[x]+=1
    else:
        dic[x]=1
print("AC X",dic["AC"])
print("WA X",dic["WA"])
print("TLE X",dic["TLE"])
print("RE X",dic["RE"])

Submission status: Wrong Answer

Solution code:
ac = 0
wa = 0
tle = 0
re = 0

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

Submission status: Wrong Answer

Solution code:
number = int(input())

AC = 0
TLE = 0
WA = 0
RE = 0
chara = []
for i in range(0,number):
    a = input()
    if(a == 'AC'):
        AC = AC + 1
    elif(a == 'TLE'):
        TLE = TLE + 1
    elif (a == 'WA'):
        WA = WA + 1
    elif (a == 'RE'):
        RE = RE + 1

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

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 == "AC":
    ac += 1
  elif i == "WA":
    wa += 1
  elif i == "TLE":
    tle += 1
  else:
    re += 1
print("AC × {}".format(ac))
print("WA × {}".format(wa))
print("TLE × {}".format(tle))
print("RE × {}".format(re))

Submission status: Wrong Answer

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

for judge,count in judges.items():
    print(f"{judge} ✖️ {count}")

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
  else:
    break

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

Submission status: Wrong Answer

Solution code:
n = int(input())

j = list()
for _ in range(n):
    string = input()
    j.append(string)

ac = j.count("AC")
wa = j.count("WA")
tel = j.count("TEL")
re = j.count("RE")
print(f"AC x {ac}")
print(f"WA x {wa}")
print(f"TEL x {tel}")
print(f"RE x {re}")

Submission status: Wrong Answer

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

from collections import defaultdict
cnt=defaultdict(int)
cnt["AC"]=0
cnt["TLE"]=0
cnt["WA"]=0
cnt["RE"]=0
for i in res:
    cnt[i]+=1
for i in cnt.items():
    print(i[0],"x",i[1])

Submission status: Wrong Answer

Solution code:
N = int(input())

l = [0]*4
for i in range(N):
  S = input()
  if S == "AC":
    l[0] += 1
  elif S == "WA":
    l[1] += 1
  elif S == "TLE":
    l[2] += 1
  elif S == "re":
    l[3] += 1
    
print("AC x", l[0])
print("WA x", l[1])
print("TLE x", l[2])
print("RE x", l[3])

Submission status: Wrong Answer

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 = s.count('RE')

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

for _ in []*N:
    S = int(input())
    if S == 'AC':
        ac+=1
    elif S == 'WA':
        wa+=1
    elif S == 'TLE':
        tle+=1
    elif S == 'RE':
        re+=1

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

Submission status: Wrong Answer

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

ac=0
wa=0
tle=0
re=0
for i in li:
    if i=="AC":
        ac+=1
    elif i =="TLE":
        tle+=1
    elif i=="WA":
        wa+=1
    else:
        re+=1
print("AC × {}".format(ac))
print("WA × {}".format(wa))
print("TLE × {}".format(tle))
print("RE × {}".format(re))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
  st = str(input())
  if(st == 'AC'):
    ac += 1
  elif(st == 'WA'):
    wa += 1
  elif(st == 'TLE'):
    tle += 1
  else:
    re += 1

print('AC × {}'.format(ac))
print('WA × {}'.format(wa))
print('TLE × {}'.format(tle))
print('RE × {}'.format(re))

Submission status: Wrong Answer

Solution code:
l = []
for i in range(int(input())):
   l.append(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in l:
    if i == "AC":
        ac+=1
    if i == "TLE":
        tle+=1
    if i == "WA":
        wa+=1
    if i == "RE":
        re+=1
print("AC X "+str(ac))
print("WA X "+str(wa))
print("TLE X "+str(tle))
print("RE X "+str(re))

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))
ZIP = lambda: zip(*(MAP() for _ in range(n)))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    N = INT()
    S = [INPUT() for _ in range(N)]

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


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(i,end=" ")
    print("×",end=" ")
    print(j)