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 = list(input().split())

print(f'AC x {S.count("AC")}')
print(f'WA x {S.count("WA")}')
print(f'TLE x {S.count("TLE")}')
print(f'RE x {S.count("RE")}')

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

s = Counter(S)

print('AC × ',end='')
print(s['AC'])
print('WA × ', end='')
print(s['WA'])
print('TLE × ',end='')
print(s['TLE'])
print('RE × ', end='')
print(s['RE'])

Submission status: Wrong Answer

Solution code:
n = int(input())
case = []
result = ["AC","WA","TLE","RE"]
for num in range(n):
  case.append(input())
for num in range(4):
  print("{} × {}".format(result[num],case.count(result[num])))

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())
s = [input() for i in range(N)]
print("AC x " ,s.count("AC"))
print("WA x ",s.count("WE"))
print("TLE x ",s.count("TLE"))
print("RE 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
  if S=='WA':
    wa+=1
  if S=='TLE':
    tle+=1
  if S=='RE':
    re+=1
#print(ac,wa,tle,re)
print('AC × ',ac)
print('WA × ',wa)
print('TLE × ',tle)
print('RE × ',re)

Submission status: Wrong Answer

Solution code:
N = int(input())
  
countAC=0
countWA=0
countTLE=0
countRE=0
for i in range(0,N-1):
        val = input()
        if val=="AC":
                countAC=countAC+1
        elif val=="WA":
                countWA=countWA+1
        elif val=="TLE":
                countTLE=countTLE+1
        elif val=="RE":
                countRE=countRE+1
        else:
                break
print("AC × "+str(countAC))
print("WA × "+str(countWA))
print("TLE × "+str(countTLE))
print("RE × "+str(countRE))

Submission status: Wrong Answer

Solution code:

n = int(input())

s = [input() for _ in range(n)]
ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
	if s[i] == 'AC':
		ac += 1
	elif s[i] == 'WA':
		wa += 1
	elif s[i] == 'TLE':
		tle += 1
	elif s[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())
s = [input() for _ in range(n)]

cnt_ac = s.count('AC')
cnt_wa = s.count('WA')
cnt_tle = s.count('TLE')
cnt_re = s.count('RE')

print(f'AC　×　{cnt_ac}')
print(f'WA　×　{cnt_wa}')
print(f'TLE　×　{cnt_tle}')
print(f'RE　×　{cnt_re}')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
  
inputList = []
countAC=0
countWA=0
countTLE=0
countRE=0
for i in range(0,N):
        val = input()
#       inputList.append(val)
        if val=="AC":
                countAC=countAC+1
        elif val=="WA":
                countWA=countWA+1
        elif val=="TLE":
                countTLE=countTLE+1
        elif val=="RE":
                countRE=countRE+1
        else:
                break
print("AC × "+str(countAC))
print("WA × "+str(countWA))
print("TLE × "+str(countTLE))
print("RE × "+str(countRE))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
keys=['AC','TLE','WA','RE']
for i in range(n):
  x=(input())
  l.append(x)
s=dict.fromkeys(keys, 0)
for i in l:
  if i in s:
    s[i]+=1
for k,v in s.items():
  print(k,"x",v)

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

s = Counter(S)

print('AC×',end='')
print(s['AC'])
print('WA×', end='')
print(s['WA'])
print('TLE×',end='')
print(s['TLE'])
print('RE×', end='')
print(s['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
  if S=='WA':
    wa+=1
  if S=='TLE':
    tle+=1
  if S=='RE':
    re+=1
  
#print(ac,wa,tle,re)
print('AC ×',ac)
print('WA ×',wa)
print('TLE ×',tle)
print('RE ×',re)

Submission status: Wrong Answer

Solution code:

result = ["AC","WA","TLE","RE"]
result_num = [0,0,0,0]


case = input("")
case = int(case)

list = []
A = 0


while A < case:
  inp = input("")
  list.append(inp)
  A = A + 1

A = 0
while A < case-1:
  if list[A] == result[0]:
    result_num[0] = result_num[0] + 1
  elif list[A] == result[1]:
    result_num[1] = result_num[1] + 1
  elif list[A] == result[2]:
    result_num[2] = result_num[2] + 1
  elif list[A] == result[2]:
    result_num[3] = result_num[3] + 1
  A =A + 1

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

Submission status: Wrong Answer

Solution code:
N=map(int,input().split())
S=list(map(str,input().split()))

AC=S.count('AC')
WA=S.count('WA')
TLE=S.count('TLE')
RE=S.count('RE')

print("AC × ", end='') 
print(AC)
print("WA × ", end='') 
print(WA)
print("TLE × ", end='') 
print(TLE)
print("RE × ", end='') 
print(RE)

Submission status: Wrong Answer

Solution code:
N = int(input())
S = []
count_AC = 0
count_WA = 0
count_TLE = 0
count_RE = 0
for _ in range(N):
  S.append(input())
for i in S:
  if i == "AC":
    count_AC += 1
  elif i == "WA":
    count_WA += 1
  elif i == "TLE":
    count_TLE += 1
  elif i == "RE":
    count_RE += 1
  else:
    pass
print("AC" + "x" + str(count_AC),
      "WA" + "x" + str(count_WA),
      "TLE" + "x" + str(count_TLE),
      "RE" + "x" + str(count_RE),
     )

Submission status: Wrong Answer

Solution code:
n = int(input())
s = [input() for i in range(n)]
AC,WA,TLE,RE = 0,0,0,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 × " + str(AC))
print("WA × " + str(WA))
print("TLE × " + str(TLE))
print("RE × " + str(RE))

Submission status: Wrong Answer

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

cnt_ac = s.count('AC')
cnt_wa = s.count('WA')
cnt_tle = s.count('TLE')
cnt_re = s.count('RE')

print(f'AC × {cnt_ac}')
print(f'WA × {cnt_wa}')
print(f'TLE × {cnt_tle}')
print(f'RE × {cnt_re}')

Submission status: Wrong Answer

Solution code:
t = int(input())
wlist = [0]*4
for i in range(t):
    w = input()
    if w == "AC":
        wlist[0] += 1
    elif w == "WA":
        wlist[1] += 1
    elif w == "TEL":
        wlist[2] += 1
    else:
        wlist[3] += 1
print("AC x " + str(wlist[0]))
print("WA x " + str(wlist[1]))
print("TEL x " + str(wlist[2]))
print("RE x " + str(wlist[3]))

Submission status: Wrong Answer

Solution code:

result = ["AC","WA","TLE","RE"]
result_num = [0,0,0,0]


case = input("")
case = int(case)

list = []
A = 0


while A < case:
  inp = input("")
  list.append(inp)
  A = A + 1

A = 0
while A < case:
  if list[A] == result[0]:
    result_num[0] = result_num[0] + 1
  elif list[A] == result[1]:
    result_num[1] = result_num[1] + 1
  elif list[A] == result[2]:
    result_num[2] = result_num[2] + 1
  elif list[A] == result[2]:
    result_num[3] = result_num[3] + 1
  A =A + 1

print("AC x " , result_num[0])
print("WA x " , result_num[1])
print("TLE x " , result_num[2])
print("RE x " , result_num[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
  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))

Submission status: Wrong Answer

Solution code:
n = int(input())
dict = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(n):
    s = input()
    dict[s] = dict[s] + 1
for k, l  in dict.items():
	print(k + ' × ' + str(l))

Submission status: Wrong Answer

Solution code:
n = int(input())

c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(n):
    a = input()
    if(a == 'AC'):
        c0 += 1
    elif(a == 'WA'):
        c1 += 1
    elif(a == 'TLE'):
        c2 += 1
    elif(a == '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=map(int,input().split())
S=list(map(str,input().split()))

AC=S.count('AC')
WA=S.count('WA')
TLE=S.count('TLE')
RE=S.count('RE')

print("AC×", end='') 
print(AC)
print("WA×", end='') 
print(WA)
print("TLE×", end='') 
print(TLE)
print("RE×", end='') 
print(RE)

Submission status: Wrong Answer

Solution code:
N = int(input())
  
inputList = []
countAC=0
countWA=0
countTLE=0
countRE=0
for i in range(0,N):
        val = input()
#       inputList.append(val)
        if val=="AC":
                countAC=countAC+1
        elif val=="WA":
                countWA=countWA+1
        elif val=="TLE":
                countTLE=countTLE+1
        elif val=="RE":
                countRE=countRE+1
print("AC × "+str(countAC))
print("WA × "+str(countWA))
print("TLE × "+str(countTLE))
print("RE × "+str(countRE))

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    AC = 0
    WA = 0
    TLE = 0
    RE = 0
    for i in range(N):
        St = input()
        if St == 'AC':
            AC += 1
        elif St == 'WA':
            WA += 1
        elif St == 'TLE':
            TLE += 1
        elif St == 'RE':
            RE += 1
    print('AC x ' + str(AC))
    print('AC x ' + str(WA))
    print('AC x ' + str(TLE))
    print('AC x ' + str(RE))
main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S = []
word_list = ["AC","WA","TLE","RE"]
for i in range(N):                     
    array = input()
    S.append(array)

for i in range(4):
  print(word_list[i] +"×"+str(S.count(word_list[i])))

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
for i in range(N):
    l.append(input())
AC = l.count('AC')
WA = l.count('WA')
TLE = l.count('TLE')
RE = l.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())
test = []
for i in range(n):
    test.append(input())
print('AC × ' + str(test.count('AC')))
print('WA × ' + str(test.count('WA')))
print('TLE × ' + str(test.count('TLE')))
print('RE × ' + str(test.count('RE')))

Submission status: Wrong Answer

Solution code:
n = int(input())

c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(n):
    a = input()
    if(a == 'AC'):
        c0 += 1
    elif(a == 'WA'):
        c1 += 1
    elif(a == 'TLE'):
        c2 += 1
    elif(a == '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:
a=int(input())
b=[input() for i in range(a)]
print("AC × {}".format(b.count("AC")))
print("WA × {}".format(b.count("WA")))
print("TLE × {}".format(b.count("TLE")))
print("RE × {}".format(b.count("RE")))

Submission status: Wrong Answer

Solution code:
a = input()

ac = a.count('AC')
wa = a.count('WA')
tle = a.count('TLE')
re = a.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:
t = int(input())
d = dict()
d['TLE'] = 0
d['AC'] = 0
d['WA'] = 0
d['RE'] = 0
while t > 0:
    s = input()
    if s == 'TLE':
        d['TLE'] += 1
    elif s == 'WA':
        d['WA'] += 1
    elif s == 'RE':
        d['RE'] += 1
    elif s == 'AC':
        d['AC'] += 1
    t-=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())
S = [input() for _ in range(N)] #N行に1文字入力したい
A = S.count("AC")
B = S.count("WA")
C = S.count("TLE")
D = S.count("RE")
print("AC", "×", str(A))
print("WA", "×", str(B))
print("TLE", "×", str(C))
print("RE", "×", str(D))

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

Submission status: Wrong Answer

Solution code:
n = int(input())

c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(n):
    a = input()
    if(a == 'AC'):
        c0 += 1
    elif(a == 'WA'):
        c1 += 1
    elif(a == 'TLE'):
        c2 += 1
    elif(a == '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())
s = [input() for _ in range(n)]

cnt_ac = s.count('AC')
cnt_wa = s.count('WA')
cnt_tle = s.count('TLE')
cnt_re = s.count('RE')

print(f'AC × {cnt_ac}')
print(f'WA × {cnt_wa}')
print(f'TLE × {cnt_tle}')
print(f'RE × {cnt_re}')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=w=r=t=0
for i in range(n):
    s=str(input())
    if s=="AC" :
        a+=1;
    elif s=="WA" :
        w+=1;
    elif s=="TLE":
        t+=1;
    else :
        r+=1;
    
print("AC * "+str(a) )
print("WA * "+str(w))
print("TLE * "+str(t))
print("RA * "+str(r))

Submission status: Wrong Answer

Solution code:
from collections import Counter

def main():
    n = int(input())
    s = [input() for i in range(n)]
    print(s)
    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
    print('AC x', ac)
    print('WA x', wa)
    print('TLE x', tle)
    print('RE x', re)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
list = []
words = ['AC','WA','TLE','RE']
words_count = {'AC':0,'WA':0,'TLE':0,'RE':0}
    
try:
    while True:
      val = input()
      if val:
        list.append(val)
      else:
        break
except EOFError:
    pass

for i in range(1,len(list)):
  for word in words:
    if list[i] == word:
      words_count[word] += 1

for k,v in words_count.items():
  print("{key} × {value}".format(key = k,value= v))

Submission status: Wrong Answer

Solution code:
N = int(input())
list = []
for i in range(N):
    list.append(input())
C0 = 0
C1 = 0
C2 = 0
C3 = 0
for i in range(N):
    if list[i] == "AC":
        C0 += 1
    elif list[i] == "WA":
        C1 += 1
    elif list[i] == "TLE":
        C2 += 1
    elif list[i] == "RE":
        C3 += 1
        
print("AC ×",C0)
print("WA ×", C1)
print("TLE ×", C2)
print("RE ×", C3)

Submission status: Wrong Answer

Solution code:
N = int(input())
n = [input() for i in range(N)]
count_AC = 0
count_WA = 0
count_TLE = 0
count_RE = 0
for i in n:
    if i == 'AC':
        count_AC += 1
    elif i == 'WA':
        count_WA += 1
    elif i == 'TLE':
        count_WA += 1
    elif i == 'RE':
        count_WA += 1
print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}'.format(count_AC, count_WA, count_TLE, count_RE))

Submission status: Wrong Answer

Solution code:
n = int(input())
S = []
a = 0
t = 0
w = 0
r = 0
for _ in range(n):
    S.append(input())
for i in range(n):
  if S[i]=="AC":
    a += 1
  elif S[i]=="TLE":
    t += 1
  elif S[i]=="WA":
    w += 1
  else:
    r += 1
a = str(a)
w = str(w)
t = str(t)
r = str(r)
print("ACx"+a)
print("WAx"+w)
print("TLEx"+t)
print("REx"+r)

Submission status: Wrong Answer

Solution code:
def main(self, case):
  for i in range(len(case)):
    AC = 0
    WA = 0
    TLE = 0
    RE = 0
    others = 0
    if case[i] == "AC":
      AC += 1
      return AC
    elif case[i] == "WA":
      WA += 1
      return WA
    elif case[i] == "TLE":
      TLE += 1
      return TLE
    elif case[i] == "RE":
      RE += 1
      return RE
    else :
      others += 1
      return others
  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 = []
word_list = ["AC","WA","TLE","RE"]
for i in range(N):                     
    array = input()
    S.append(array)

for i in range(4):
  print(word_list[i] +"　×　"+str(S.count(word_list[i])))

Submission status: Wrong Answer

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

cnt_ac = s.count('AC')
cnt_wa = s.count('WA')
cnt_tle = s.count('TLE')
cnt_re = s.count('RE')

print(f'AC×{cnt_ac}')
print(f'WA×{cnt_wa}')
print(f'TLE×{cnt_tle}')
print(f'RE×{cnt_re}')

Submission status: Wrong Answer

Solution code:
n = int(input())
test = []
for i in range(n):
    test.append(input())
print('AC × ' + str(test.count('AC')))
print('NA × ' + str(test.count('NA')))
print('TLE × ' + str(test.count('TLE')))
print('RE × ' + str(test.count('RE')))

Submission status: Wrong Answer

Solution code:
a=int(input())

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

print("AC x",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 sys
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"+"x"+str(a))
print("WA"+"x"+str(b))
print("TLE"+"x"+str(c))
print("RE"+"x"+str(d))

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

s = Counter(S)

print('AC×'+ str(s['AC']))
print('WA×' + str(s['WA']))
print('TLE×' + str(s['TLE']))
print('RE×' + str(s['RE']))

Submission status: Wrong Answer

Solution code:
N = int(input())
S = []
word_list = ["AC","WA","TLE","RE"]
for i in range(N):                     
    array = input()
    S.append(array)

for i in range(4):
  print(word_list[i] +" × "+str(S.count(word_list[i])))

Submission status: Wrong Answer

Solution code:
a = input()

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

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

Submission status: Wrong Answer

Solution code:
import math
def main():
    judge_l = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
    l = int(input().rstrip())
    for i in range(l):
      judge = input().rstrip()
      judge_l[judge] += 1
    for key in judge_l.keys():
        print('{} × {}'.format(key, judge_l[key]))
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
S = []
a = 0
t = 0
w = 0
r = 0
for _ in range(n):
    S.append(input())
for i in range(n):
  if S[i]=="AC":
    a += 1
  elif S[i]=="TLE":
    t += 1
  elif S[i]=="WA":
    w += 1
  else:
    r += 1
a = str(a)
w = str(w)
t = str(t)
r = str(r)
print("ACx"+a)
print("WAx"+w)
print("TLE"+t)
print("REx"+r)

Submission status: Wrong Answer

Solution code:

n = int(input())

s = [input() for _ in range(n)]
ac = 0
wa = 0
tle = 0
re = 0

for i in range(n):
	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:
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 * {}".format(a))
print("WA * {}".format(b))
print("TLE * {}".format(c))
print("RE * {}".format(d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
S = [input() for i in range(N)]
c = collections.Counter(S)
print("AC","×",(c["AC"]))
print("WA","×",(c["WA"]))
print("TLE","×",(c["TLE"]))
print("RE","×",(c["RE"]))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[input() for i in range(n)]

print('AC ×',l.count('AC'))
print('WA ×',l.count('WA'))
print('TLE ×',l.count('TLE'))
print('RE ×',l.count('RE'))

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

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

import collections

n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)
print(f'AC x {c["AC"]}')
print(f'WA x {c["WA"]}')
print(f'LTE x {c["TLE"]}')
print(f'RE x {c["RE"]}')

Submission status: Wrong Answer

Solution code:
N = int(input())
L =[]
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:
S=input()
S=int(S)
a = [input() for i in range(S)]
AC=0
WA=0
TLE=0
RE=0
print(a)
for a in a:
    if a=="AC":
        AC+=1
    if a=="WA":
        WA+=1
    if a=="TLE":
        TLE+=1
    if a=="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())
ac = 0
wa = 0
tel = 0
re = 0
for y in range(0,n):
  x = input()
  if x[0] == 'A':
    ac += 1
  elif x[0] == 'W':
    wa += 1
  elif x[0] == 'T':
    tel += 1
  else:
    re += 1
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())
k = {}
k['AC\r'] =0
k["TLE\r"]=0
k["WA\r"]=0
k["RE\r"]=0
for i in range(n):
    a = str(input())
    #print(a)
    if a in k:
        k[a]+=1
print("AC x {}".format(k['AC\r']))
print("WA x {}".format(k['WA\r']))
print("TLE x {}".format(k['TLE\r']))
print("RE x {}".format(k['RE\r']))

Submission status: Wrong Answer

Solution code:
a=int(input())

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

print("AC x ",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())
S=[]
for _ in range(N):
    S.append(input())

C = [0,0,0,0]
judge = ['AC','WA','TLE','RE']

for i in range(N):
    for j in range(4):
        if judge[j]==S[i]:
            C[j]=C[j]+1

for k in range(4):
    print(f'{judge[k]} ×　{C[k]}')

Submission status: Wrong Answer

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

AC = s.count("AC")
WA = s.count("WA")
TLE = s.count("TLE")
RE = s.count("RE")

AC2 = "AC × " + str(AC)
WA2 = "WA × " + str(WA)
TLE2 = "TLE × " + str(TLE)
RE2 = "RE × " + str(RE)

list = [AC2,WA2,TLE2,RE2]
list_n = "\n".join(list)
print(list_n)

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("ACx{}".format(a[0]))
print("WAx{}".format(a[1]))
print("TLEx{}".format(a[2]))
print("REx{}".format(a[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
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())
ac=str("AC X")
wa=str("WA X")
tle=str("TLE X")
re=str("RE X")
a=0;b=0;c=0;d=0
for i in range(n):
    p=input()
    if(p=="AC"):
        a+=1
    if(p=="WA"):
        b+=1
    if (p == "TLE"):
        c += 1
    if (p == "RE"):
        d += 1
print(ac,a)
print(wa,b)
print(tle,c)
print(re,d)

Submission status: Wrong Answer

Solution code:
n = int(input())
a= [input() for i in range(n)]

ca=a.count('AC')
cw=a.count('WA')
ct=a.count('TLE')
cr=a.count('RE')
print('AC ×',ca)
print('WA ×',cw)
print('TEL ×',ct)
print('RE ×',cr)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[2]:


n = int(input())

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

for i in range(n):
    s = input()
    L[s] += 1
for i in L:
    print('{} × {}'.format(i, L[i]))

Submission status: Wrong Answer

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

result = ['AC', 'WA', 'TLE', 'RE']
C = [S.count(r) for r in result]

for (re, c) in zip(result, C):
    print(re + 'x' + str(c))

Submission status: Wrong Answer

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

for k, v in j_dic.items():
    print(k,"×",v)

Submission status: Wrong Answer

Solution code:
import collections
n = int(input())
s = [input() for _ in range(n)]
c = collections.Counter(s)

r = list(c.items())

if 'RE' not in c.keys():
  r.append(('RE',0))
elif 'TLE' not in c.keys():
  r.append(('TLE',0))
elif 'WA' not in c.keys():
  r.append(('WA',0))
elif 'AC' not in c.keys():
  r.append(('AC',0))

for i in r:
  print(str(i[0]) + ' x ' + str(i[1]))

Submission status: Wrong Answer

Solution code:
N = int(input())
L =[]
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())
s = [input() for i in range(n)]
lst0 = []
lst1 = []
lst2 = []
lst3 = []
for i in range(n):
    if s[i] == 'AC':
        lst0.append(s[i])
    elif s[i] == 'WA':
        lst1.append(s[i])
    elif s[i] == 'TLE':
        lst2.append(s[i])
    else:
        lst3.append(s[i])
print(f'AC × {len(lst0)}')
print(f'WA × {len(lst1)}')
print(f'TLE × {len(lst2)}')
print(f'RE × {len(lst3)}')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = [input() for _ in range(N)] #N行に1文字入力したい
A = S.count("AC")
B = S.count("WA")
C = S.count("TLE")
D = S.count("RE")
print("AC"+"×" + str(A))
print("WA"+"×" + str(B))
print("TLE"+"×" + str(C))
print("RE"+"×" + str(D))

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    judges = [input() for _ in range(N)]
    print(judges)
    
    res_dic = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
    for judge in judges:
        if judge in res_dic:
            res_dic[judge] += 1
        else:
            res_dic[judge] = 0
            
    for k, v in res_dic.items():
        print("{} x {}".format(k, v))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
n = list(map(str, input().split()))
a= 0
b=0
c=0
d=0
for i in n:
    if i == "AC":
        a = a+1
    elif i=="WA":
        b = b+1
    elif i=="TLE":
        c = c+1
    elif i== "RE":
        d = d+1
print("AC x", a)
print("WA x", b)
print("TLE x", c)
print("RE x", d)

Submission status: Wrong Answer

Solution code:
a=int(input())

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

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())
S = list(str(input()) for _ in range(N))

print(S)

AC = 0
WA = 0
TLE = 0
RE = 0
for s in S:
    if s =='AC':
        AC +=1
    elif s == 'WA':
        WA +=1
    elif s == 'TLE':
        TLE += 1
    elif s == 'RE':
        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)))

Submission status: Wrong Answer

Solution code:
N = int(input())
list = []
for i in range(N):
    list.append(input())
C0 = 0
C1 = 0
C2 = 0
C3 = 0
for i in range(N):
    if list[i] == "AC":
        C0 += 1
    elif list[i] == "WA":
        C1 += 1
    elif list[i] == "TLE":
        C2 += 1
    elif list[i] == "RE":
        C3 += 1
        
print("AC * ", C0)
print("WA * ", C1)
print("TLE * ", C2)
print("RE * ", C3)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

# a, t, w, r = 0, 0, 0, 0

for i in range(N):
  s = input()
  if s == "AC":
    s_list["AC"] += 1
  elif s == "TLE":
    s_list["TLE"] += 1
  elif s == "WA":
    s_list["WA"] += 1
  else:
    s_list["RE"] += 1
    

print("AC × {}\nWA × {}\nTLE × {}\nRE × {}".format(s_list["AC"], s_list["WA"], s_list["TLE"], s_list["RE"]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
string_list=[input() for i in range(n)]
print(string_list)
AC=string_list.count('AC')
WA=string_list.count('WA')
TLE=string_list.count('TLE')
RE=string_list.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:
N = int(input())
S = []
for n 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:
N = int(input())
ac, re, wa, tle = 0,0,0,0
for i in range(N):
  line = input()
  if line == "AC":
    ac += 1
  elif line == "TLE":
    tle += 1
  elif line == "WA":
    wa += 1
  elif line == "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()) #1行目のNを取得する
s = [input() for i in range(N)] #複数行の数値の入力を取得
ac = s.count("AC")
wa = s.count("wa")
tle = s.count("TLE")
re = s.count("RE")
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Submission status: Wrong Answer

Solution code:
N = int(input())
S = [input() for i in range(N)]
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:
ac,wa,tle,re = 0,0,0,0
N=int(input())
for _ in range(N):
  s=str(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))