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())
 
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 ×",a)
print("WA ×",w)
print("TLE ×",t)
print("RE ×",r)

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 × ",a)
print("WA × ",w)
print("TLE × ",t)
print("RE × ",r)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
s = [input() for i in range(N)]
count = [0]*4
for a in s[1:]:
    if a == "AC":
        count[0] += 1
    if a == "WA":
        count[1] += 1
    if a == "TLE":
        count[2] += 1
    if a == "RE":
        count[3] += 1
print("AC","×",count[0],"\n")
print("WA","×",count[1],"\n")
print("TLE","×",count[2],"\n")
print("RE","×",count[3],"\n")

Submission status: Wrong Answer

Solution code:
ls=["AC","TLE","RE","WA"]
n=int(input())
a=b=c=d=0
for i in range(n):
  s=input()
  if s==ls[0]:
    a+=1
  elif s==ls[1]:
    b+=1
  elif s==ls[2]:
    c+=1
  else:
    d+=1
print(ls[0]+" x",a)
print(ls[1]+" x",b)
print(ls[2]+" x",c)
print(ls[3]+" x",d)

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 × ",a)
print("WA × ",w)
print("TLE × ",t)
print("RE × ",r)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
s = [input() for i in range(N)]
count = [0]*4
for a in s[1:]:
    if a == "AC":
        count[0] += 1
    if a == "WA":
        count[1] += 1
    if a == "TLE":
        count[2] += 1
    if a == "RE":
        count[3] += 1
print("AC","×",count[0],"\n","WA","×",count[1],"\n","TLE","×",count[2],"\n","RE","×",count[3],"\n")

Submission status: Wrong Answer

Solution code:
ls=["AC","TLE","RE","WA"]
n=int(input())
a=b=c=d=0
for i in range(n):
  s=input()
  if s==ls[0]:
    a+=1
  elif s==ls[1]:
    b+=1
  elif s==ls[2]:
    c+=1
  else:
    d+=1
print(ls[0]+" *",a)
print(ls[1]+" *",b)
print(ls[2]+" *",c)
print(ls[3]+" *",d)

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

D = Counter(list_s)

print("AC ｘ " + str(D["AC"]))
print("WA ｘ " + str(D["WA"]))
print("TLE ｘ " + str(D["TLE"]))
print("RE ｘ " + str(D["RE"]))

Submission status: Wrong Answer

Solution code:
import sys
a = []
for l in sys.stdin:
    a.append(l)
N = a[0]
count = [0]*4
for a in a[1:]:
  if a == "AC":
    count[0] += 1
  if a == "WA":
    count[1] += 1
  if a == "TLE":
    count[2] += 1
  if a == "RE":
    count[3] += 1
print("AC","×",count[0],"\n")
print("WA","×",count[1],"\n")
print("TLE","×",count[2],"\n")
print("RE","×",count[3],"\n")

Submission status: Wrong Answer

Solution code:
import sys
a = []
for l in sys.stdin:
    a.append(l)
N = a[0]
count = [0]*4
for a in a[1:]:
  if a == "AC":
    count[0] += 1
  if a == "WA":
    count[1] += 1
  if a == "TLE":
    count[2] += 1
  if a == "RE":
    count[3] += 1
print("AC"," ","×"," ",count[0],"\n")
print("WA"," ","×"," ",count[1],"\n")
print("TLE"," ","×"," ",count[2],"\n")
print("RE"," ","×"," ",count[3],"\n")

Submission status: Wrong Answer

Solution code:
n = (int)(input())
C_0 = 0
C_1 = 0
C_2 = 0
C_3 = 0
for i in range(n):
    s = input()
    if s == "AC":
        C_0 += 1  # means C_0 = C_0 + 1
    if s == "WA":
        C_1 += 1
    if s == "TLE":
        C_2 += 1
    else:
        C_3 += 1
print("AC x", C_0)
print("WA x", C_1)
print("TLE x", C_2)
print("RE x", C_3)

Submission status: Wrong Answer

Solution code:
n = (int)(input())
C_0 = 0
C_1 = 0
C_2 = 0
C_3 = 0
for i in range(n):
    s = input()
    if s == "AC":
        C_0 += 1 #means C_0 = C_0 + 1
    if s == "WA":
        C_1 += 1
    if s == "TLE":
        C_2 += 1
    else:
        C_3 += 1

print('AC x {}'.format(C_0)) #{}のところにC_0の値が出力される
print('WA x {}'.format(C_1))
print('TLE x {}'.format(C_2))
print('RE x {}'.format(C_3))

Submission status: Wrong Answer

Solution code:
dic = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(int(input())):
    dic[input()] += 1
print(f"AC × {dic['AC']}")
print(f"WA × {dic['WA']}")
print(f"TLE × {dic['TLE']}")
print(f"RE × {dic['RE']}")

Submission status: Wrong Answer

Solution code:
from collections import Counter
lst = []
for i in range(int(input())):
    lst.append(input())
c = Counter(lst)
print(f"AC × {c['AC']}")
print(f"WA × {c['WA']}")
print(f"TLE × {c['TLE']}")
print(f"RE × {c['RE']}")

Submission status: Wrong Answer

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

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

a = S.count('AC')
b = S.count('WA')
c = S.count('TLE')
d = S.count('RE')

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

Submission status: Wrong Answer

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

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

a = S.count('AC')
b = S.count('WA')
c = S.count('TLE')
d = S.count('RE')

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

Submission status: Wrong Answer

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

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

a = S.count('AC')
b = S.count('WA')
c = S.count('TLE')
d = S.count('RE')

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = []
for _ in range(n):
	s.append(input())
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
	elif i == 'RE':
		re += 1
#re = n - ac - wa - tle
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 = []
for _ in range(n):
	s.append(str(input()))
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
	elif i == 'RE':
		re += 1
#re = n - ac - wa - tle
print('AC × {}'.format(str(ac)))
print('WA × {}'.format(str(wa)))
print('TLE × {}'.format(str(tle)))
print('RE × {}'.format(str(re)))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = []
for _ in range(n):
	s.append(str(input()))
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
	elif i == 'RE':
		re += 1
#re = n - ac - wa - tle
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 = []
for _ in range(n):
	s.append(str(input()))
ac = 0
wa = 0
tle = 0
for i in s:
	if i == 'AC':
		ac += 1
	elif i == 'WA':
		wa += 1
	elif i == 'TLE':
		tle += 1
re = n - ac - wa - tle
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]*4

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N=int(input())
S = []
for _ in range(N):
    S.append(input())
a=0
b=0
c=0
d=0
for i in S:
  if i=='AC':
    a+=1
  elif i=='WA':
    b+=1
  elif i=='TLE':
    c+=1
  else:
    d+=1
print('AC×'+str(a))
print('WA×'+str(b))
print('TLE×'+str(c))
print('RE×'+str(d))

Submission status: Wrong Answer

Solution code:
from collections import Counter as ct

n = int(input())
s = ct([input() for _ in range(n)])
print("AC x " + str(s["AC"]))
print("WA x " + str(s["wA"]))
print("TLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))

Submission status: Wrong Answer

Solution code:
N = int(input())
C0 = 0
C1 = 0
C2 = 0
C3 = 0


for i in range(N):
    C = input()
    print(C)
    if C == 'AC':
        C0 += 1
    elif C == 'WA':
        C1 += 1
    elif C == 'TLE':
        C2 += 1
    elif C == 'RE':
        C3 += 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
ac=int(0)
wa=int(0)
tle=int(0)
re=int(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{}".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 = [input() for i in range(n)]

c_AC = 0
c_WA = 0
c_TLE = 0
c_RE = 0

for i in s:
  if i == 'AC':
    c_AC += 1
  elif i == 'WA':
    c_WA += 1
  elif i == 'TLE':
    c_TLE += 1
  else:
    c_RE += 1
    
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:
d = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for _ in range(int(input())):
	d[input()] += 1
for i in d:
	print(i,'X',d[i])

Submission status: Wrong Answer

Solution code:
input_one=int(input())
array=[]
a={"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(input_one):
    array.append(input())
for i in array:
    if i=="AC":
        a[i]+=1
    elif i=="WA":
        a[i]+=1
    elif i=="TLE":
        a[i]+=1
    elif i=="RE":
        a[i]+=1
    else:
        print()
print("AC ×",a["AC"])
print("WA ×",a["WA"])
print("TLE ×",a["TLE"])
print("RE ×",a["RE"])

Submission status: Wrong Answer

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
we = 0
for i in range(n):
    text = input()
    if text == "AC":
        ac += 1
        continue
        
    if text == "WA":
        wa += 1
        continue
        
    if text == "TLE":
        tle += 1
        continue
        
    if text == "WE":
        we += 1
        continue

print(f"AC x {ac}")
print(f"WA x {wa}")
print(f"TLE x {tle}")
print(f"WE x {we}")

Submission status: Wrong Answer

Solution code:
num=input()
if int(num)<=1000:
    change=1000-int(num)
else:
    array_1=list(num)
    array_1=array_1[-4:]
    a=''.join(array_1)
    b=int(array_1[-4])+1
    pay=b*1000
    change=pay-int(a)
    if array_1[-1]=="0" and array_1[-2]=="0" and array_1[-3]=="0":
        change=0
print(change)

Submission status: Wrong Answer

Solution code:
n = int(input())
inp = {}
for i in range(n):
    a = input()
    if inp.get(a) is None:
        inp[a] = 0
    inp[a] += 1
print(f"AC x {0 if inp.get('AC') is None else inp.get('AC')}")
print(f"WA x {0 if inp.get('WA') is None else inp.get('WA')}")
print(f"TLE x {0 if inp.get('TLE') is None else inp.get('TLE')}")
print(f"RE x {0 if inp.get('WA') is None else inp.get('WA')}")

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
import math,sys
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import bisect as bi
import heapq 
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')): 
    #------------------Sublime--------------------------------------#
    sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
    def I():return (int(input()))
    def In():return(map(int,input().split()))
else:
    #------------------PYPY FAst I/o--------------------------------#
    def I():return (int(stdin.readline()))
    def In():return(map(int,stdin.readline().split()))

def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d

def main():
    try:
        l=[]
        n=I()
        for x in range(n):
            l.append(input())
        #d=dict(l)
        d={}
        temp=['AC','WA','TLE','RE']
        for x in temp:
            d[x]=0
        for x in l:
            d[x]+=1
        print('AC X',d['AC'])
        print('WA X',d['WA'])
        print('TLE X',d['TLE'])
        print('RE X',d['RE'])
    except:
        pass
        
M = 998244353
P = 1000000007
 
if __name__ == '__main__':
    #for _ in range(I()):main()
    for _ in range(1):main()

Submission status: Wrong Answer

Solution code:
from sys import stdin, stdout
import math,sys
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import bisect as bi
import heapq 
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')): 
    #------------------Sublime--------------------------------------#
    sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
    def I():return (int(input()))
    def In():return(map(int,input().split()))
else:
    #------------------PYPY FAst I/o--------------------------------#
    def I():return (int(stdin.readline()))
    def In():return(map(int,stdin.readline().split()))

def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d

def main():
    try:
        l=[]
        n=I()
        for x in range(n):
            l.append(input())
        d=dict(l)
        temp=['AC','WA','TLE','RE']
        for x in temp:
            if d.get(x,-1)==-1:
                d[x]=0
        print('AC X',d['AC'])
        print('WA X',d['WA'])
        print('TLE X',d['TLE'])
        print('RE X',d['RE'])
    except:
        pass
        
M = 998244353
P = 1000000007
 
if __name__ == '__main__':
    #for _ in range(I()):main()
    for _ in range(1):main()

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
def c():
	n = int(input())
	inp = []
	for i in range(n):
		inp.append(input())
	
	result = Counter(inp)
	print(f"AC x {result['AC']}")
	print(f"WA x {result['WA']}")
	print(f"TLE x {result['TLE']}")
	print(f"RE x {result['RE']}")

Submission status: Wrong Answer

Solution code:
n = int(input())
AC=0
WA=0
TLE=0
RE=0
list1 = []
for _ in range(n):
    s = input()
    list1.append(s)

for i in list1:
    if(i=='AC'):    AC+=1
    elif(i=='WA'):  WA+=1
    elif(i=="TLE"): TLE+=1
    else:
        RE+=1

print("AC x",AC )
print("WA x",WA )
print("TLE x",TLE )
print("Re x",RE )

Submission status: Wrong Answer

Solution code:
N=int(input())
S=[input() for i in range(N)]
x=S.count('AC')
y=S.count('WA')
z=S.count('TLE')
w=S.count('RE')
X="AC x []".format(x)
Y="WA x []".format(y)
Z="TLE x []".format(z)
W="RE x []".format(w)
print(X)
print(Y)
print(Z)
print(W)

Submission status: Wrong Answer

Solution code:
N=int(input())
S=list(map(str, input().split()))
x=S.count("AC")
y=S.count("WA")
z=S.count("TLE")
w=S.count("RE")
X="AC x []".format(x)
Y="WA x []".format(y)
Z="TLE x []".format(z)
W="RE x []".format(w)
print(X)
print(Y)
print(Z)
print(W)

Submission status: Wrong Answer

Solution code:
N=int(input())
S=list(map(str, input().split()))
x=S.count("AC")
y=S.count("WA")
z=S.count("TLE")
w=S.count("RE")
print("AC x []".format(x))
print("WA x []".format(y))
print("TLE x []".format(z))
print("RE x []".format(w))

Submission status: Wrong Answer

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

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

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

    for i in range(len(s)):
        if s[i] == "AC":
            ac += 1
        elif s[i] == "WA":
            wa += 1
        elif s[i] == "TLE":
            tle += 1
        else:
            re += 1

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(input().split())
print(s.count('AC'))
print(s.count('WA'))
print(s.count('TLE'))
print(s.count('RE'))

Submission status: Wrong Answer

Solution code:
N = int(input())
s = list(input()for i in range(N))
print('AC x',s.count('AC'))
print('TLE x',s.count('TLE'))
print('RE x',s.count('RE'))
print('WA x',s.count('WA'))

Submission status: Wrong Answer

Solution code:
N = int(input())
s = list(input() for i in range(N))    
print('AC x',s.count('AC'))
print('TLE x',s.count('TLE'))
print('RE x',s.count('RE'))
print('WJ x',s.count('WJ'))

Submission status: Wrong Answer

Solution code:
N = int(input())
s = [input() for i in range(N)]
print('AC x',s.count('AC'))
print('TLE x',s.count('TLE'))
print('RE x',s.count('RE'))
print('WJ x',s.count('WJ'))

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(N):
  s = list(input())
print('AC x',s.count('AC'))
print('TLE x',s.count('TLE'))
print('RE x',s.count('RE'))
print('WJ x',s.count('WJ'))

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
  if S == 'WA':
    b += 1
  if S == 'TLE':
    c += 1
  if S == 'RE':
    d += 1
print('AC x'+str(a))
print('WA x'+str(b))
print('TLE x'+str(c))
print('RE x'+str(d))

Submission status: Wrong Answer

Solution code:
n=int(input())
a,b,c,d=0,0,0,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 X",a)
print("WA X",b)
print("TLE X",c)
print("RE X",d)

Submission status: Wrong Answer

Solution code:
N = int(input())
s = list(input()for i in range(N))    
print('AC','x',s.count('AC'))
print('TLE','x',s.count('TLE'))
print('RE','X',s.count('RE'))
print('WJ','x',s.count('WJ'))

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
N = int(input())
d = defaultdict(int)

for _ in range(N):
  s = input()
  if s == 'AC':
    d[s] += 1
  elif s == 'WA':
    d[s] += 1
  elif s == 'TLE':
    d[s] += 1
  else:
    d[s] += 1
    
    
for k, v in d.items():
  print('{} x {}'.format(k, d[k]))

Submission status: Wrong Answer

Solution code:
L =[]

N = int(input())

for i in range(N):
    S = input()
    L.append(S)

print("AC" + " × " + str(L.count("AC")))
print("WA" + " × " + str(L.count("WA")))
print("TLE" + " × " + str(L.count("TLE")))
print("RE" + " × " + str(L.count("RE")))

Submission status: Wrong Answer

Solution code:
L =[]

N = int(input())

for i in range(N):
    S = input()
    L.append(S)

print("AC × " + str(L.count("AC")))
print("WA × " + str(L.count("WA")))
print("TLE × " + str(L.count("TLE")))
print("RE × " + str(L.count("RE")))

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):
    print(str(mo[i])+" × "+str(lis[i]))

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
  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())
for i in range(N):
  s = input()    
print('AC','x',s.count('AC'))
print('TLE','x',s.count('TLE'))
print('RE','X',s.count('RE'))
print('WJ','x',s.count('WJ'))

Submission status: Wrong Answer

Solution code:
a = int(input())
str_list = [input() for _ in range(a)]
print("{} {}".format("AC × ", str_list.count('AC')))
print("{} {}".format("WA × ", str_list.count('WA')))
print("{} {}".format("TLE × ", str_list.count('TLE')))
print("{} {}".format("RE × ", str_list.count('RE')))

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
a = int(input())

str_list = []

str_list = [input() for _ in range(a)]

print("{} {}".format("AC × ", str_list.count('AC')))
print("{} {}".format("WA × ", str_list.count('WA')))
print("{} {}".format("TLE × ", str_list.count('TLE')))
print("{} {}".format("RE × ", str_list.count('RE')))

Submission status: Wrong Answer

Solution code:
def main():
    import collections
    n = int(input())
    mylist = []
    for i in range(n):
        s = input()
        mylist.append(s)
    c = collections.Counter(mylist)
    print('AC × ' + str(c['AC']))
    print('WA × ' + str(c['WA']))
    print('TLE × ' + str(c['TLE']))
    print('RE × ' + str(c['RE']))
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Solution code:
a = int(input())

str_list = []

for _ in range(a):
  str_list.append(input())

print("{} {}".format("AC × ", str_list.count('AC')))
print("{} {}".format("WA × ", str_list.count('WA')))
print("{} {}".format("TLE × ", str_list.count('TLE')))
print("{} {}".format("RE × ", str_list.count('RE')))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

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

for l in L.keys():
    print(l, '×', L[l])

Submission status: Wrong Answer

Solution code:
N=int(input())
str_list = [input() for _ in range(N)]
AC=WA=TLE=RE=0
for i in range(N):
  if(str_list[i]=="AC"):
    AC+=1
  if(str_list[i]=="TLE"):
    TLE+=1
  if(str_list[i]=="WA"):
    WA+=1
  if(str_list[i]=="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())
a = 0
b = 0
c = 0
d = 0

for i in range(n):
  S = str(input())
  if S == 'AC':
    a += 1
  if S == 'WA':
    b += 1
  if S == 'TLE':
    c += 1
  if S == 'RE':
    d += 1
print('AC × '+str(a))
print('WA × '+str(b))
print('TLE × '+str(c))
print('RE × '+str(d))

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

if __name__ == '__main__':
    main()

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 = ST()
        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 ×",str(WA))
    print("TLE ×",str(TLE))
    print("RE ×",str(RE))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import sys

s=[]
for line in sys.stdin:
    s.append(line)
    if len(s)==1:
        n = int(s[0])
    n-=1
    if n<0:
        break

s.pop(0)

hash={}
for key in s:
    if  key in hash:
        hash[key]+=1
    else:
        hash[key]=1

list=["AC\n", "TLE\n", "WA\n","RE\n"]

for key in hash.keys():
    count=0
    for one in list:
        if key == one:
            print(one[:-1]+" × "+str(hash[key]))
            list.pop(count)
        count+=1


for rest in list:
    print(rest[:-1]+" × "+str(0))

Submission status: Wrong Answer

Solution code:
a = int(input())
str_list = []
str_list = [input() for _ in range(a)]
print("{} {}".format("AC × ", str_list.count('AC')))
print("{} {}".format("WA × ", str_list.count('WA')))
print("{} {}".format("TLE × ", str_list.count('TLE')))
print("{} {}".format("RE × ", str_list.count('RE')))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = int(0)
b = int(0)
c = int(0)
d = int(0)

for i in range(n):
  S = str(input())
  if S == 'AC':
    a += 1
  if S == 'WA':
    b += 1
  if S == 'TLE':
    c += 1
  if S == 'RE':
    d += 1
print('AC × '+str(a))
print('WA × '+str(b))
print('TLE × '+str(c))
print('RE × '+str(d))

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
List = ['AC', 'WA', 'TLE', 'RE']
List2 = []
for _ in range(N):
    S = input()
    List2.append(S)
result = dict((i, List2.count(i)) for i in List)
Set = set(List) - set(List2)
for key, value in result.items():
    print(key, "x", value)
for k in Set:
    print(k +"x 0")