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())
ct=0
count=0
a=0
b=0

for i in range(1,n+1):
    s=input()
    if(s=="AC"):
        ct=ct+1
    elif(s=="WA"):
        count=count+1
    elif(s=="TLE"):
        a=a+1
    elif(s=="Re"):
        b=b+1
print("AC X",ct)
print("WA X",count)
print("TLE X",a)
print("RE X",b)

Submission status: Wrong Answer

Solution code:
a = int(input())
s = []
for i in range(0,a) :
    d = input()
    s.append(d)
    

c1 = 0
c2 = 0
c3 = 0
c4 = 0

for i in range(0,len(s)) :
    if s[i] == "AC" :
        c1 += 1
    elif s[i] == "WA" :
        c2 += 1
    elif s[i] == "TLE" :
        c3 += 1
    elif s[i] == "RE" :
        c4 += 1
print("AC *",str(c1))
print("WA *",str(c2))
print("TLE *",str(c3))
print("RE *",str(c4))

Submission status: Wrong Answer

Solution code:
n = int(input())
k = [input() for i in range(n)]
ac = 0
wa = 0
tle = 0
re = 0

for j in range(n):
  if k[j] == 'AC':
    ac += 1
  elif k[j] == 'WA':
    wa += 1
  elif k[j] == 'TLE':
    tle += 1
  elif k[j] == 'RE':
    re += 1
    
print("AC *",ac)
print("WA *",wa)
print("TLE *",tle)
print("RE *",re)

Submission status: Wrong Answer

Solution code:
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    a = input()
    if a == "AC":
        AC += 1
    elif a == "WA":
        WA += 1
    elif a == "TLE":
        TLE += 1
    elif a == "RE":
        RE += 1
print(f"AC ✖︎ {AC}")
print(f"WA ✖︎ {WA}")
print(f"TLE ✖︎ {TLE}")
print(f"RE ✖︎ {RE}")

Submission status: Wrong Answer

Solution code:
n=int(input())
ct=0
count=0
a=0
b=0

for i in range(1,n+1):
    s=input()
    if(s=="AC"):
        ct=ct+1
    elif(s=="WA"):
        count=count+1
    elif(s=="TLE"):
        a=a+1
    elif(s=="Re"):
        b=b+1
print("AC*",ct)
print("WA*",count)
print("TLE*",a)
print("RE*",b)

Submission status: Wrong Answer

Solution code:
a=int(input())
b=[input() for i in range(a)]
c=b.count("AC")
d=b.count("WA")
e=b.count("TLE")
f=b.count("RE")
print("AC × {}".format(c))
print("WA × {}".format(d))
print("TLE × {}".format(e))
print("RE × {}".format(f))

Submission status: Wrong Answer

Solution code:
N = int(input())
C = [ 0 for i in range(4) ]
s2num = {"AC":0, "WA":1, "TLE":2, "RE":3}
num2s = {0:"AC", 1:"WA", 2:"TLE", 3:"RE"}
# read
for i in range(N):
    num = s2num[ input() ]
    C[num] += 1
    #print(num)
# print
for i in range(4):
    print("{} × {}".format( num2s[i], C[i] ))

Submission status: Wrong Answer

Solution code:
N = int(input())

countAC=0
countWA=0
countTLE=0
countRE=0
for i in range(0,N):
        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())
a = [input() for i in range(n)]
A=str(a.count("AC"))
B=str(a.count("WA"))
C=str(a.count("TLE"))
D=str(a.count("RE"))
print("AC x"+ A)
print("WA x"+ B)
print("TLE x"+ C)
print("RE x"+ D)

Submission status: Wrong Answer

Solution code:
#coding: utf-8
i = 0
AC = 0
WA = 0
TLE = 0
RE = 0
num = int(input())
print(num)
while i <num:
  line = input()
  #print(line)
  if line == "AC":
    AC += 1
  if line == "WA":
    WA += 1
  if line == "TLE":
    TLE += 1
  if line == "RE":
    RE += 1
  i += 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 math
import sys

n = int(input())
e = pow(10,5)

if (n<1)or(e<n):
    sys.exit(0)

i = 1
ac = 0
wa = 0
tle = 0
re = 0
while i<=n:
    s = input()
    if s=='AC':
        ac += 1
    elif s=='WA':
        wa += 1
    elif s=='TLE':
        tle += 1
    elif s=='RE':
        re += 1
    i+=1

print("AC ×", ac, "\nWA ×", wa, "\nTLE ×", tle, "\nRE ×", re)

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
S = [input() for _ 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:
def main(case):
  AC = 0
  WA = 0
  TLE = 0
  RE = 0
  others = 0
  for i in range(len(case)):
    
    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 "+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())

l = []
for i in range(N):
    text = input()
    l.append(text)

print("AC" + " x " + str(l.count("AC")))
print("AC" + " x " + str(l.count("WA")))
print("TLE" + " x " + str(l.count("TLE")))
print("RE" + " x " + str(l.count("RE")))

Submission status: Wrong Answer

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

for i in range(n):
  if str_list[i] == 'AC':
    AC +=1
  elif str_list[i] == 'WA':
    WA += 1
  elif str_list[i] == 'TLE':
    TLE += 1
  elif str_list[i] == 'RE':
    RE += 1
print('AC ×', AC)
print('WA ×', WA)
print('TLE ×', TLE)
print('RE ×', RE)

Submission status: Wrong Answer

Solution code:
import math
import sys

n = int(input())
e = pow(10,5)

if (n<1)or(e<n):
    sys.exit(0)

i = 1
ac = 0
wa = 0
tle = 0
re = 0
while i<=n:
    s = input()
    if s=="AC":
        ac += 1
    elif s=="WA":
        wa += 1
    elif s=="TLE":
        tle += 1
    elif s=="RE":
        re += 1
    i+=1

print("AC ×", ac, "\nWA ×", wa, "\nTLE ×", tle, "\nRE ×", re)

Submission status: Wrong Answer

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

for i in range(n):
  if str_list[i] == 'AC':
    AC +=1
  elif str_list[i] == 'WA':
    WA += 1
  elif str_list == 'TLE':
    TLE += 1
  elif str_list == 'RE':
    RE += 1
print('AC ×', AC)
print('WA ×', WA)
print('TLE ×', TLE)
print('RE ×', RE)

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
S = [input() for _ 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())  # nは入力回数
S = [input() for _ in range(N)]

C_ac=0
C_wa=0
C_tle=0
C_re=0

for i in S:
    if i  == 'AC':
        C_ac = C_ac + 1 
    elif i  == 'WA':
        C_wa = C_wa + 1 
    elif i  == 'TLE':
        C_tle = C_tle + 1 
    elif i  == 'RA':
        C_ra = C_ra +1 
print("AC x "+str(C_ac))
print("WA x "+str(C_wa))
print("TLE x "+str(C_tle))
print("RE x "+str(C_re))

Submission status: Wrong Answer

Solution code:
N = int(input())
AC = "AC"
WA = "WA"
TLE = "TLE"
RE = "RE"
list = []
for i in range(N):
    string = input()
    list.append(string)
C0 = list.count(AC)
C1 = list.count(WA)
C2 = list.count(TLE)
C3 = list.count(RE)
print(AC+f" x {C0}")
print(AC+f" x {C1}")
print(AC+f" x {C2}")
print(AC+f" x {C3}")

Submission status: Wrong Answer

Solution code:
import math
import sys

n = int(input())
e = pow(10,5)

if (n<1)or(e<n):
    sys.exit(0)

i = 1
ac = 0
wa = 0
tle = 0
re = 0
while i<=n:
    s = input()
    if s=="AC":
        ac += 1
    elif s=="WA":
        wa += 1
    elif s=="TLE":
        tle += 1
    elif s=="RE":
        re += 1
    else:
        sys.exit(0)
    i+=1

print("AC ×", ac, "\nWA ×", wa, "\nTLE ×", tle, "\nRE ×", re)

Submission status: Wrong Answer

Solution code:
TestCase = int(input())

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

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:
from collections import Counter
N = int(input())
S = []
for i in range(N):
  S.append(input())
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:
import collections
N = int(input())
S = [input() for _ 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())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    word = input()
    if word == "AC":
        ac += 1
    elif word == "WA":
        wa += 1
    elif word == "TLE":
        tle += 1
    elif word == "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:
import collections
n = int(input())
m = [input() for i in range(n)]

check = ["AC","WA","TLE","RE"]
m = m+check


c = collections.Counter(m)

for i,j in c.items():
  print(i+ " x " +str(j-1))

Submission status: Wrong Answer

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

nac = 0
nwa = 0
ntle = 0
nre = 0

print(s)
for i in s:
    if i == 'AC':
        nac += 1
    if i == 'WA':
        nwa += 1
    if i == 'TLE':
        ntle += 1
    if i == 'RE':
        nre += 1

print("AC x ", nac)
print("WA x ", nwa)
print("TLE x ", ntle)
print("RE x ", nre)

Submission status: Wrong Answer

Solution code:
N=input()

c0=N.count("AC")
c1=N.count("WA")
c2=N.count("TLE")
c3=N.count("RE")

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

n = int(input())
e = pow(10,5)

if (n<1)or(e<n):
    sys.exit(0)

i = 1
ac = 0
wa = 0
tle = 0
re = 0
while i<=n:
    s = input()
    if s=="AC":
        ac += 1
    elif s=="WA":
        wa += 1
    elif s=="TLE":
        tle += 1
    elif s=="RE":
        re += 1
    else:
        sys.exit(0)
    i+=1

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

Submission status: Wrong Answer

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

cnt_AC = s.count('AC')
cnt_WC = s.count('WA')
cnt_TLE = s.count('TLE')
cnt_RE = s.count('RE')

print(f'AC×{cnt_AC}')
print(f'WA×{cnt_WC}')
print(f'TLE×{cnt_TLE}')
print(f'RE×{cnt_RE}')

Submission status: Wrong Answer

Solution code:
numberotestcase = int(input())
verdicat=[]
for step in range(numberotestcase):
  exp = input().upper()
  verdicat.append(exp)

first = verdicat.count('AC')
sec =  verdicat.count('WA')
thir =  verdicat.count('TLE')
fou = verdicat.count('RE')
print('AC * '+str(first))
print('WA * '+str(sec))
print('TLE * '+str(thir))
print('RE * '+str(fou))

Submission status: Wrong Answer

Solution code:
n=int(input())
a  = []
for i in range(n):
    s=str(input())
    a.append(s)
print(("AC * ")+str(a.count("AC")))
print(("WA * ")+str(a.count("WA")))
print(("TLE * ")+str(a.count("TLE")))
print(("RA * ")+str(a.count("RA")))

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("")
  if inp == result[0] or inp == result[1] or inp == result[2] or inp == result[3]:
    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())
s = [input() for i in range(n)]

nac = 0
nwa = 0
ntle = 0
nre = 0

print(s)
for i in s:
    if i == 'AC':
        nac += 1
    if i == 'WA':
        nwa += 1
    if i == 'TLE':
        ntle += 1
    if i == 'RE':
        nre += 1

print("AC × ", nac)
print("WA × ", nwa)
print("TLE × ", ntle)
print("RE × ", nre)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
TestCase = int(input())

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

#表示
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 = [input() for i in range(N)]
C0 = S.count('AC')
C1 = S.count('WA')
C2 = S.count('TLE')
C3 = S.count('RE')
print('AC × ' + str(C0))
print('WA × ' + str(C1))
print('TLE × ' + str(C2))
print('RE × ' + str(C3))

Submission status: Wrong Answer

Solution code:
def main(case):
  AC = 0
  WA = 0
  TLE = 0
  RE = 0
  others = 0
  for i in range(len(case)):
    
    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 = input().split()
count = 0
AC = 0
WA = 0
TLE = 0
RE = 0

for i in N:
    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)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
def resolve():
    N,=pin()
    print ((-N)%1000)
#%%submit!
resolve()

Submission status: Wrong Answer

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

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

for i in range(n):
  s.append(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:
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
a = "AC" + "x" + str(count_AC)
b = "WA" + "x" + str(count_WA)
c = "TLE" + "x" + str(count_TLE)
d = "RE" + "x" + str(count_RE)
print(a, b, c, d, sep="\n")

Submission status: Wrong Answer

Solution code:

N = int(input())
AC,WA,RE,TLE = 0,0,0,0
for i in range(N):
    result = input()
    if result == "AC":
        AC += 1
    elif result == "WA":
        WA += 1
    elif result == "RE":
        RE += 1
    else:
        TLE += 1

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

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:
import collections
N = int(input())
S = [input() for _ 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:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

N=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(N):
    S=ns()
    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:

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


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

list = []
A = 0

while A < case:
  inp = input("")
  if inp == result[0] or inp == result[1] or inp == result[2] or inp == result[3]:
    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())
s = [input() for i in range(N)]
row = ['AC', 'WA', 'TLE', 'RE']
for r in row:
    count = 0
    for col in s:
        if col == r:
            count += 1
    print(r, '×', count, sep=' ')

Submission status: Wrong Answer

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

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

for i in range(n):
  s.append(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:
import collections

n = int(input())
m = [input() for i in range(n)]

check = ["AC","WA","TLE","RE"]
m = m+check


c = collections.Counter(m)

for i,j in c.items():
  print(i+ " x " +str(j-1))

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
    
    print('AC × {}'.format(judge_l['AC']), end='\n')
    print('WA × {}'.format(judge_l['WA']), end='\n')
    print('TLE × {}'.format(judge_l['TLE']), end='\n')
    print('RE × {}'.format(judge_l['RE']), end='')
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S = list(map(str, input().split()))
a = S.count("AC")
w = S.count("WA")
t = S.count("TLE")
r = S.count("RE")
print("AC x" + " " + str(a))
print("WA x" + " " + str(w))
print("TLE x" + " " + str(t))
print("RE x" + " " + str(r))

Submission status: Wrong Answer

Solution code:
import math
import sys

n = int(input())
e = pow(10,5)

if (n<1)or(e<n):
    sys.exit(0)

i = 1
ac = 0
wa = 0
tle = 0
re = 0
while i<=n:
    s = input()
    if s=="AC":
        ac += 1
    elif s=="WA":
        wa += 1
    elif s=="TLE":
        tle += 1
    elif s=="RE":
        re += 1
    else:
        sys.exit(0)
    i+=1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = [0]*N
AC = int(0)
WA = int(0)
TLE = int(0)
RE = int(0)


for i in range(0,N):
  S[i] = input()
  if(S[i]=='AC'):
    AC += 1
  if(S[i]=='WA'):
    WA += 1
  if(S[i]=='TLE'):
    TLE += 1
  if(S[i]=='RE'):
    RE += 1
    
print('AC *', AC)
print('WA *', WA)
print('TLE *', TLE)
print('RE *', RE)

Submission status: Wrong Answer

Solution code:
N = int(input())
c0=[]
c1=[]
c2=[]
c3=[]
for i in range(N):
    S = input()
    if S == "AC":
        c0.append(S)
    elif S == "WA":
        c1.append(S)
    elif S == "TLE":
        c2.append(S)
    elif S == "RE":
        c3.append(S)

print("AC","×",len(c0))
print("WA","×",len(c1))
print("TLE","×",len(c2))
print("RE","×",len(c3))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
sys.setrecursionlimit(300000)


def solve(N: int, S: "List[str]"):
    s = {'AC': 0, 'WA': 0, 'TLE':0, 'RE':0}
    for c in S:
        s[c] += 1
    for c in ['AC', 'WA', 'TLE', 'RE']:
        print('{} X {}'.format(c, s[c]))
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = [next(tokens) for _ in range(N)]  # type: "List[str]"
    solve(N, S)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
case = input()
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=[input() for i in range(N)]
ac_count=0
wa_count=0
tle_count=0
re_count=0
for i in range(len(S)):
    if S[i]=="AC":
        ac_count+=1
    if S[i]=="WA":
        wa_count+=1
    if S[i]=="TLE":
        tle_count+=1
    if S[i]=="RE":
        re_count+=1
print("AC ×",ac_count)
print("WA ×",wa_count)
print("TLE ×",tle_count)
print("RE ×",re_count)

Submission status: Wrong Answer

Solution code:
import math
import sys

def main():

    n = int(input())
    s = [input() for i in range(n)]
    c0,c1,c2,c3 = 0,0,0,0
    
    for i in range(n):
        if "AC" in s[i]:
            c0 += 1
        if s[i] in 'WA':
            c1 += 1
        if s[i] in 'TLE':
            c2 += 1
        if s[i] in 'RE':
            c3 += 1
    print("AC x "+str(c0))
    print("TLE x "+str(c1))
    print("TLE x "+str(c2))
    print("RE x "+str(c3))
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a = input()

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

if 1 <= ac+wa+tle+re <=100000:
    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())
a=0
w=0
t=0
r=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', '×',a)
print('WA', '×',w)
print('TLE', '×',t)
print('RE', '×',r)

Submission status: Wrong Answer

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

count_AC = 0
count_WA = 0
count_TLE = 0
count_RE = 0

for i in range(N):
	if a[i] == 'AC':
		count_AC += 1
	if a[i] == 'WA':
		count_WA += 1
	if a[i] == 'TLE':
		count_TLE += 1
	if a[i] == 'RE':
		count_RE += 1

print('AC　×　', end='')
print(count_AC)
print('WA　×　', end='')
print(count_WA)
print('TLE　×　', end='')
print(count_TLE)
print('RE　×　', end='')
print(count_RE)

Submission status: Wrong Answer

Solution code:
N=int(input())
S=[input() for i in range(N)]
ac_count=0
wa_count=0
tle_count=0
re_count=0
for i in range(len(S)):
    if S[i]=="AC":
        ac_count+=1
    if S[i]=="WA":
        wa_count+=1
    if S[i]=="TLE":
        tle_count+=1
    if S[i]=="RE":
        re_count+=1
print("AC × ",ac_count)
print("WA × ",wa_count)
print("TLE × ",tle_count)
print("RE × ",re_count)

Submission status: Wrong Answer

Solution code:
N = int(input())
c0=[]
c1=[]
c2=[]
c3=[]
for i in range(N):
    S = input()
    if S == "AC":
        c0.append(S)
    elif S == "WA":
        c1.append(S)
    elif S == "TLE":
        c2.append(S)
    elif S == "RE":
        c3.append(S)

print("AC ","× ",len(c0))
print("WA ","× ",len(c1))
print("TLE ","× ",len(c2))
print("RE ","× ",len(c3))

Submission status: Wrong Answer

Solution code:
N = int(input()) 
s = [input() for i in range(N)] 
def count_ac (s):
    n = 0
    for i in range (0, N):
        if s[i] == "AC":
            n = n + 1
        else:
            n = n
    return n
def count_wa (s):
    n = 0
    for i in range (0, N):
        if s[i] == "WA":
            n = n + 1
        else:
            n = n
    return n
def count_tle (s):
    n = 0
    for i in range (0, N):
        if s[i] == "TLE":
            n = n + 1
        else:
            n = n
    return n
def count_re (s):
    n = 0
    for i in range (0, N):
        if s[i] == "RE":
            n = n + 1
        else:
            n = n
    return n
C0 = count_ac (s)
C1 = count_wa (s)
C2 = count_tle (s)
C3 = count_re (s)
print ('AC × ',C0, 'WA × ',C1,'TLE × ',C2,'RE × ',C3)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

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

for i in range(n):
    out[s[i]] += 1
for i in ["AC","WA","TLE","RE"]:
    print(f"{i} × {out[i]}")

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())
lists = []
AC = 0
TLE = 0
WA = 0
RE = 0
for i in range(N):
    S = str(input())
    lists.append(S)
for o in lists:
    if o == "AC":
        AC +=1
    elif o == "TLE":
        TLE +=1
    elif o == "WA":
        WA +=1
    elif o == "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
input = sys.stdin.readline

N = int(input())

S = [input().replace('\n', '') for _ in range(N)]
print(S)

AC_c = 0
WA_c = 0
TLE_c = 0
RE_c = 0

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

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

for k, v in r.items():
    print(f'{k} x {v}')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=0
w=0
t=0
r=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', '×',a)
print('WA ', '×',w)
print('TLE ', '×',t)
print('RE ', '×',r)

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
        else:
            Er += 1
    print('AC x', AC)
    print('AC x', WA)
    print('AC x', TLE)
    print('AC x', RE)
main()

Submission status: Wrong Answer

Solution code:
n = int(input())
data = [input() for _ in range(n)]
a = data.count("AC")
b = data.count("WA")
c = data.count("TLE")
d = data.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())
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 × {}'.format(ac))
print('WA × {}'.format(wa))
print('TLE × {}'.format(tle))
print('RE × {}'.format(re))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

b = l.count("AC")
c = l.count("WA")
d = l.count("TLE")
e = l.count("RE")

print("AC ×",b)
print("WA ×",c)
print("TLE ×",d)
print("RE ×",e)

Submission status: Wrong Answer

Solution code:
n = int(input())
s=[]
for x in range(n):
    s.append(input())
a={"AC":0, "WA":0,"TLE":0,"RE":0}
for x in s:
    print(x)
    a[x]+=1
print("AC x %s" % a["AC"])
print("WA x %s" % a["WA"])
print("TLE x %s" % a["TLE"])
print("RE x %s" % a["RE"])

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 x ", end='') 
print(AC)
print("WA x ", end='') 
print(WA)
print("TLE x ", end='') 
print(TLE)
print("RE x ", end='') 
print(RE)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=0
w=0
t=0
r=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 ', '×　',a)
print('WA ', '×　',w)
print('TLE ', '×　',t)
print('RE ', '×　',r)

Submission status: Wrong Answer

Solution code:
n = int(input())
ct_ac = 0
ct_wa = 0
ct_tle = 0
ct_re = 0
for i in range(n):
    s = input()
    if s == 'AC':
        ct_ac += 1
    if s == 'WA':
        ct_wa += 1
    if s == 'TLE':
        ct_tle += 1
    if s == 'RE':
        ct_re += 1

print('AC × ' + str(ct_ac))
print('WA × ' + str(ct_wa))
print('TLE × ' + str(ct_tle))
print('RE × ' + str(ct_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:
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
      
    str = ''
    for key in judge_l.keys():
        str += '{} × {}\n'.format(key, judge_l[key])
    print(str.rstrip('\n'))
    
if __name__ == "__main__":
    main()