ZhenlongDai/ACPR huggingface dataset:
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA  × 0
TLE  × 0
RE  × 0


Fixed submission (verdict: Accepted):
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', 'x',a)
print('WA', 'x',w)
print('TLE', 'x',t)
print('RE', 'x',r)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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']))

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC×10
WA×0
TLE×0
RE×0


Fixed submission (verdict: Accepted):
from collections import Counter

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

s = Counter(S)

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

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC X 10
WA X 0
TLE X 0
RE X 0


Fixed submission (verdict: Accepted):
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)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0

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

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

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0

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

print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)
Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())

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

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

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


Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())

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

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

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

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())

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

for i in range(1,N+1):
  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))
  

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
num = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(1, num + 1):
    judge = str(input())
    if judge == "AC":
        ac += 1
    elif judge == "WA":
        wa += 1
    elif judge == "TLE":
        tle += 1
    elif judge == "RE":
        re += 1
        
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
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 x', AC)
print('WA x', WA)
print('TLE x', TLE)
print('RE x', RE)
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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']}")

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
dic = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(int(input())):
    dic[input()] += 1
print(f"AC x {dic['AC']}")
print(f"WA x {dic['WA']}")
print(f"TLE x {dic['TLE']}")
print(f"RE x {dic['RE']}")

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input());

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

ac = wa = tle = re = 0

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

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
3
1
2
0


Fixed submission (verdict: Accepted):
n = int(input());

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

ac = wa = tle = re = 0

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

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import defaultdict as d
from itertools import combinations as c
from string import ascii_lowercase as a

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

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC x 10
WA x 10
TLE x 10
RE x 10


Fixed submission (verdict: Accepted):
from math import gcd, sqrt, pi, floor, ceil
from collections import defaultdict as d
from itertools import combinations as c
from string import ascii_lowercase as a

n = int(input())
dd = d(int)
for i in range(n):
	e = input()
	dd[e] += 1
print('AC x', dd['AC'])
print('WA x', dd['WA'])
print('TLE x', dd['TLE'])
print('RE x', dd['RE'])
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def main():
    n = int(input())

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

    a = 0
    w = 0
    t = 0
    r = 0
    
    for i in range(n):
        if (s[i] == 'AC'):
            a += 1
        elif (s[i] == 'WA'):
            w += 1
        elif (s[i] == 'TLE'):
            t += 1
        else:
            r += 1

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


Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
ACx10
WAx0
TLEx0
REx0


Fixed submission (verdict: Accepted):
def main():
    n = int(input())

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

    a = 0
    w = 0
    t = 0
    r = 0
    
    for i in range(n):
        if (s[i] == 'AC'):
            a += 1
        elif (s[i] == 'WA'):
            w += 1
        elif (s[i] == 'TLE'):
            t += 1
        else:
            r += 1

    print('AC x ' + str(a))
    print('WA x ' + str(w))
    print('TLE x ' + str(t))
    print('RE x ' + str(r))
    
main()

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
s = [""] * n
for i in range(n):
    s[i] = input()
    if s[i] == "AC":
        ac += 1
    elif s[i] == "WA":
        wa += 1
    elif s[i] == "TLE":
        tle += 1
    else:
        re += 1
print(f"AC × {ac}\nWA × {wa}\nTLE × {tle}\nRE × {re}")


Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
s = ""
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(f"AC x {ac}\nWA x {wa}\nTLE x {tle}\nRE x {re}")

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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
      
    elif case[i] == "WA":
      WA += 1
      
    elif case[i] == "TLE":
      TLE += 1
      
    elif case[i] == "RE":
      RE += 1
      
    else :
      others += 1
      
  print("AC"+" x "+str(AC))
  print("WA"+" x "+str(WA))
  print("TLE"+" x "+str(TLE))
  print("RE"+" x "+str(RE))

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:

Fixed submission (verdict: Accepted):
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
others = 0
for i in range(N):
  case = input()
  if case == "AC":
    AC += 1
      
  elif case == "WA":
    WA += 1
      
  elif case == "TLE":
    TLE += 1
      
  elif case == "RE":
    RE += 1
      
print("AC"+" x "+str(AC))
print("WA"+" x "+str(WA))
print("TLE"+" x "+str(TLE))
print("RE"+" x "+str(RE))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = []
for i in range(n):
    s.append(input())




result_set = {'AC','WA','TLE','RE'}
for result in result_set:
    ans = result + '　×　' + str(s.count(result))
    print(ans)


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
RE　×　0
AC　×　3
WA　×　1
TLE　×　2


Fixed submission (verdict: Accepted):
n = int(input())
s = []
for i in range(n):
    s.append(input())

result_set = ['AC','WA','TLE','RE']
for result in result_set:
    ans = result + ' x ' + str(s.count(result))
    print(ans)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = [input()for i in range(n)]
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for i in range(n):
    if s[i] == 'AC':
        c0 += 1
    elif s[i] == 'WA':
        c1 += 1
    elif s[i] == 'TLE':
        c2 += 1
    else:
        c3 += 1
print(f'AC×{c0}\nWA×{c1}\nTLE×{c2}\nRE×{c3}')


Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC×10
WA×0
TLE×0
RE×0


Fixed submission (verdict: Accepted):
n = int(input())
s = [input()for i in range(n)]
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for i in range(n):
    if s[i] == 'AC':
        c0 += 1
    elif s[i] == 'WA':
        c1 += 1
    elif s[i] == 'TLE':
        c2 += 1
    else:
        c3 += 1
print(f'AC x {c0}\nWA x {c1}\nTLE x {c2}\nRE x {c3}')

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
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 x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
result = []
for _ in range(int(input())):
  result.append(input())
print("AC X {}".format(result.count("AC")))
print("WA X {}".format(result.count("WA")))
print("TLE X {}".format(result.count("TLE")))
print("RE X {}".format(result.count("RE")))

      

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC X 3
WA X 1
TLE X 2
RE X 0


Fixed submission (verdict: Accepted):
result = []
for _ in range(int(input())):
  result.append(input())
print("AC x {}".format(result.count("AC")))
print("WA x {}".format(result.count("WA")))
print("TLE x {}".format(result.count("TLE")))
print("RE x {}".format(result.count("RE")))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())

AC=0
WA=0
TLE=0
RE=0

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

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

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())

AC=0
WA=0
TLE=0
RE=0

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

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

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
s=[]

for i in range(N):
    s.append(input())

print(s)
aa=["AC","WA","TLE","RE"]
for a in aa:
    print("{} × {}".format(a,str(s.count(a))))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
['AC', 'TLE', 'AC', 'AC', 'WA', 'TLE']
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
N=int(input())
s=[]
for i in range(N):
    s.append(input())

aa=["AC","WA","TLE","RE"]
for a in aa:
    print("{} x {}".format(a,str(s.count(a))))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
cn = [0]*4 
for i in range(N):
  x = input()
  if x == "AC":
    cn[0] += 1
  elif x == "WA":
    cn[1] += 1
  elif x == "TLE":
    cn[2] += 1
  elif x == "RE":
    cn[3] += 1
print("AC ×",cn[0])
print("WA ×",cn[1])
print("TLE ×",cn[2])
print("RE ×",cn[3])

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())
cn = [0]*4 
for i in range(N):
  x = input()
  if x == "AC":
    cn[0] += 1
  elif x == "WA":
    cn[1] += 1
  elif x == "TLE":
    cn[2] += 1
  elif x == "RE":
    cn[3] += 1
print("AC x",cn[0])
print("WA x",cn[1])
print("TLE x",cn[2])
print("RE x",cn[3])

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    s = input()
    if (s == "AC"):
        ac += 1
    elif (s == "WA"):
        wa += 1
    elif (s == "TLE"):
        tle += 1
    else:
        re += 1

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


Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC x 10
WA x 0
TLE x 0
re x 0


Fixed submission (verdict: Accepted):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    s = input()
    if (s == "AC"):
        ac += 1
    elif (s == "WA"):
        wa += 1
    elif (s == "TLE"):
        tle += 1
    else:
        re += 1

print("AC x", ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
s = [input() for i in range(N)]

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

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

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
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',a)
print('WA x',b)
print('TLE x',c)
print('RE x',d)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = []
for _ in range(N):
    S.append(input())

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

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

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())
S = []
for _ in range(N):
    S.append(input())

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

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

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
  
inputList = []
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))

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
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 x "+str(countAC))
print("WA x "+str(countWA))
print("TLE x "+str(countTLE))
print("RE x "+str(countRE))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
num = int(input())
word = {"AC":0, "WA":0, "TLE":0, "RE":0}

for i in range(num):
    judge = input()
    if judge in word:
        word[str(judge)] += 1
    else:
        none
        
        
print("AC × " + str(word["AC"]))
print("WA × " + str(word["WA"]))
print("TLE × " + str(word["TLE"]))
print("RE × " + str(word["RE"]))

        
   

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
num = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(1, num + 1):
    judge = str(input())
    if judge == "AC":
        ac += 1
    elif judge == "WA":
        wa += 1
    elif judge == "TLE":
        tle += 1
    elif judge == "RE":
        re += 1
        
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import Counter

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

for i in ("AC", "WA", "TLE", "RE"):
    print(f"{i} X {words.get(i, 0)}")

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC X 3
WA X 1
TLE X 2
RE X 0


Fixed submission (verdict: Accepted):
from collections import Counter

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

for i in ("AC", "WA", "TLE", "RE"):
    print(f"{i} x {words.get(i, 0)}")

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

N=int(input())
L=["AC","WA","TLE","RE"]
cnt=[0,0,0,0]

for i in range(N):
    s=input()
    for j in range(4):
        if s==L[j]:
            cnt[j]+=1

for i in range(4):
    print("{} ×　{}".format(L[i],cnt[i]))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC ×　3
WA ×　1
TLE ×　2
RE ×　0


Fixed submission (verdict: Accepted):

N=int(input())
L=["AC","WA","TLE","RE"]
cnt=[0,0,0,0]

for i in range(N):
    s=input()
    for j in range(4):
        if s==L[j]:
            cnt[j]+=1

for i in range(4):
    print("{} x {}".format(L[i],cnt[i]))

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
t=int(input())
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(t):
    s=input()
    d[s]+=1

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


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC: 3
WA: 1
TLE: 2
RE: 0


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

for i in d:
    print(i + ' x ' + str(d[i]))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def main():
    N = int(input())
    di = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}

    for _ in range(N):
        di[input()] += 1

    for k, v in di.items():
        print(f"{k} × {v}")


if __name__ == "__main__":
    main()


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
def main():
    N = int(input())
    di = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}

    for _ in range(N):
        di[input()] += 1

    for k, v in di.items():
        print(f"{k} x {v}")


if __name__ == "__main__":
    main()

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC  ×  3
WA  ×  1
TLE  ×  2
RE  ×  0


Fixed submission (verdict: Accepted):
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","x",len(c0))
print("WA","x",len(c1))
print("TLE","x",len(c2))
print("RE","x",len(c3))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
S=[input() for i in range(N)]
AC=0
WA=0
TLE=0
RE=0
for i in S:
    if i =="WA":
        WA+=1
    elif i=="AC":
        AC+=1
    elif i=="TLE":
        TLE+=1
    else:
        RE+=1
print("AC x　"+str(AC))
print("WA x "+str(WA))
print("TLE x",TLE)
print("RE x",RE)

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC x　10
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
N=int(input())
S=[input() for i in range(N)]
AC=0
WA=0
TLE=0
RE=0
for i in S:
    if i =="WA":
        WA+=1
    elif i=="AC":
        AC+=1
    elif i=="TLE":
        TLE+=1
    else:
        RE+=1
print("AC x",str(AC))
print("WA x",str(WA))
print("TLE x",TLE)
print("RE x",RE)
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys
na=0
nw=0
nt=0
nr=0
i = int(input())
for n in range(i):
    a=input()
    if a=="AC":
        na= na +1
    elif a=="WA":
        nw= nw+1
    elif a=="TLE":
        nt=nt+1
    else:
        nr=nr+1
print('AC ×',na)
print('WA ×',nw)
print('TLE ×',nt)
print('RE ×',nr)

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
na=0
nw=0
nt=0
nr=0
i = int(input())
for n in range(i):
    a=input()
    if a=="AC":
        na= na +1
    elif a=="WA":
        nw= nw+1
    elif a=="TLE":
        nt=nt+1
    else:
        nr=nr+1
print('AC x %d'%na)
print('WA x %d'%nw)
print('TLE x %d'%nt)
print('RE x %d'%nr)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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"])

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC x 10
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
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:
    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"])

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s)
print("AC x " + str(s["AC"]))
print("WA x " + str(s["WA"]))
print("ATLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC x 3
WA x 1
ATLE x 2
RE x 0


Fixed submission (verdict: Accepted):
import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s)
print("AC x " + str(s["AC"]))
print("WA x " + str(s["WA"]))
print("TLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
list = []
N = int(input())
list = [input() for i in range(N)]
print("AC X " + str(list.count("AC")))
print("WA X " + str(list.count("WA"))) 
print("TLE X " + str(list.count("TLE")))
print("RE X " + str(list.count("RE"))) 

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC X 3
WA X 1
TLE X 2
RE X 0


Fixed submission (verdict: Accepted):
N = int(input())
list = [input() for i in range(N)]
print("AC x " + str(list.count("AC")))
print("WA x " + str(list.count("WA"))) 
print("TLE x " + str(list.count("TLE")))
print("RE x " + str(list.count("RE")))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
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 x {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

N = int(input())
d = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
 
for _ in range(N):
    s = input().strip()
    d[s]+=1

for s in ['AC', 'WA', 'TLE', 'RE']:
    print(f'{s} X {d[s]}')

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC X 10
WA X 0
TLE X 0
RE X 0


Fixed submission (verdict: Accepted):

N = int(input())
d = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
 
for _ in range(N):
    s = input().strip()
    d[s]+=1

for k,v in d.items():
    print(k, 'x', v)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = []
for i in range(n):
    s.append(input())




result_set = {'AC','WA','TLE','RE'}
for result in result_set:
    ans = result + ' × ' + str(s.count(result))
    print(ans)


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
TLE × 2
WA × 1
RE × 0


Fixed submission (verdict: Accepted):
n = int(input())
s = []
for i in range(n):
    s.append(input())

result_set = ['AC','WA','TLE','RE']
for result in result_set:
    ans = result + ' x ' + str(s.count(result))
    print(ans)

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
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}')


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
['AC', 'TLE', 'AC', 'AC', 'WA', 'TLE']
AC x 3
WA x 1
TLE x 2
RE x 0


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline

N = int(input())

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

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

print(f'AC x {r["AC"]}')
print(f'WA x {r["WA"]}')
print(f'TLE x {r["TLE"]}')
print(f'RE x {r["RE"]}')
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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()

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
['AC', 'AC', 'AC', 'AC', 'AC', 'AC', 'AC', 'AC', 'AC', 'AC']
AC x 10
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
from collections import Counter

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

if __name__ == '__main__':
    main()

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
i = []

for x in range(n):
    x = input()
    i.append(x)    
print(i)
    
print('AC x',i.count('AC'))
print('WA x',i.count('WA'))
print('TLE x',i.count('TLE'))
print('RE x',i.count('RE'))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
['AC', 'TLE', 'AC', 'AC', 'WA', 'TLE']
AC x 3
WA x 1
TLE x 2
RE x 0


Fixed submission (verdict: Accepted):
n = int(input())
i = []

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

    
print('AC x',i.count('AC'))
print('WA x',i.count('WA'))
print('TLE x',i.count('TLE'))
print('RE x',i.count('RE'))

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
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])))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
n = int(input())
case = []
result = ["AC","WA","TLE","RE"]
for num in range(n):
  case.append(input())
for num in range(4):
  print("{} x {}".format(result[num],case.count(result[num])))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
a=b=c=d=0
for i in range(n):
  e = input()
  if e == 'AC':
    a+=1
  elif e == 'WA':
    b +=1
  elif e == 'TLE':
    c+=1
  else:
    d+=1

print('AC ×'+str(a)+'\n'+'WA ×' +str(b) + '\n'
      +'TLE ×'+str(c) +'\n' + 'RE ×'+str(d))
  


Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC ×3
WA ×1
TLE ×2
RE ×0


Fixed submission (verdict: Accepted):
n = int(input())
a=b=c=d=0
for i in range(n):
  e = input()
  if e == 'AC':
    a+=1
  elif e == 'WA':
    b +=1
  elif e == 'TLE':
    c+=1
  else:
    d+=1

    

print('AC x '+str(a)+'\n'+'WA x ' +str(b) + '\n'
      +'TLE x '+str(c) +'\n' + 'RE x '+str(d))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
A = 0
W = 0
T = 0
R = 0
for i in range(1, N+1):
  u = str(input())
  if u == "AC":
    A = A + 1
  elif u == "WA":
    W = W + 1
  elif u == "TLE":
    T = T + 1
  elif u == "RE":
  	R = R + 1
  print("AC" + " x " + str(A))
  print("WA" + " x " + str(W))
  print("TLE" + " x " + str(T))
  print("RE" + " x " + str(R))

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC x 1
WA x 0
TLE x 0
RE x 0
AC x 2
WA x 0
TLE x 0
RE x 0
AC x 3
WA x 0
TLE x 0
RE x 0
AC x 4
WA x 0
TLE x 0
RE x 0
AC x 5
WA x 0
TLE x 0
RE x 0
AC x 6
WA x 0
TLE x 0
RE x 0
AC x 7
WA x 0
TLE x 0
RE x 0
AC x 8
WA x 0
TLE x 0
RE x 0
AC x 9
WA x 0
TLE x 0
RE x 0
AC x 10
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
N = int(input())
A = 0
W = 0
T = 0
R = 0
for i in range(1, N+1):
  s = str(input())
  if s == "AC":
    A = A + 1
  elif s == "WA":
    W = W + 1
  elif s == "TLE":
    T = T + 1
  elif s == "RE":
    R = R + 1
print("AC x " + str(A))
print("WA x " + str(W))
print("TLE x " + str(T))
print("RE x " + str(R))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
list = []
c1,c2,c3,c4 = 0,0,0,0
for i in range(0,n):
  list.append(input())
for j in range(0,n):
  if list[j] == "AC":
    c1 = c1+1
  if list[j] == "WA":
    c2 = c2+1
  if list[j] == "TLE":
    c3 = c3+1
  if list[j] == "RE":
    c4 = c4+1
print("AC {}\nWA {}\nTLE {}\nRE {}".format(c1,c2,c3,c4))

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC 10
WA 0
TLE 0
RE 0


Fixed submission (verdict: Accepted):
n = int(input())
list = []
c1,c2,c3,c4 = 0,0,0,0
for i in range(0,n):
  list.append(input())
for j in range(0,n):
  if list[j] == "AC":
    c1 = c1+1
  if list[j] == "WA":
    c2 = c2+1
  if list[j] == "TLE":
    c3 = c3+1
  if list[j] == "RE":
    c4 = c4+1
print("AC x {}\nWA x {}\nTLE x {}\nRE x {}".format(c1,c2,c3,c4))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
d={'AC':0,'WA':0,'TLE':0,'RE':0}
n=int(input())
for i in range(0,n):
    d[input()]+=1
for j in d:
    print(j,"X",d[j])

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC X 10
WA X 0
TLE X 0
RE X 0


Fixed submission (verdict: Accepted):
d={'AC':0,'WA':0,'TLE':0,'RE':0}
n=int(input())
for i in range(0,n):
    d[input()]+=1
for j in d:
    print(j,"x",d[j])

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = [input() for i in range(N)]
 
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 ' + str(ac))
print('WA x ' + str(wa))
print('TLE x ' + str(tle))
print('RE × ' + str(re))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC x 3
WA x 1
TLE x 2
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())
S = [input() for i in range(N)]
 
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 ' + str(ac))
print('WA x ' + str(wa))
print('TLE x ' + str(tle))
print('RE x ' + str(re))

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
out = ["AC","WA","TLE","RE"]
output = [0]*4

print(output)
for _ in range(N):
    S = input()
    if S == out[0]:
        output[0] += 1
    elif S == out[1]:
        output[1] += 1
    elif S == out[2]:
        output[2] += 1
    else:
        output[3] += 1

print(out[0],"x",output[0])
print(out[1],"x",output[1])
print(out[2],"x",output[2])
print(out[3],"x",output[3],end="")

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
[0, 0, 0, 0]
AC x 10
WA x 0
TLE x 0
RE x 0

Fixed submission (verdict: Accepted):
N = int(input())
out = ["AC","WA","TLE","RE"]
output = [0]*4

for _ in range(N):
    S = input()
    if S == out[0]:
        output[0] += 1
    elif S == out[1]:
        output[1] += 1
    elif S == out[2]:
        output[2] += 1
    else:
        output[3] += 1

print(out[0],"x",output[0])
print(out[1],"x",output[1])
print(out[2],"x",output[2])
print(out[3],"x",output[3],end="")

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())

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

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

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC x 0
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
n=int(input())

a = []

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

print("AC x " + str(a.count("AC")))
print("WA x " + str(a.count("WA")))
print("TLE x " + str(a.count("TLE")))
print("RE x " + str(a.count("RE")))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = []
for _ in range(N):
    S.append(input())

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

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

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())
S = []
for _ in range(N):
    S.append(input())

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

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

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())

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

for i in range(1,N+1):
  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("AC × " + str(re))
  

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
AC × 0


Fixed submission (verdict: Accepted):
num = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(1, num + 1):
    judge = str(input())
    if judge == "AC":
        ac += 1
    elif judge == "WA":
        wa += 1
    elif judge == "TLE":
        tle += 1
    elif judge == "RE":
        re += 1
        
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())

countA = 0
countW = 0
countT = 0
countR = 0
for i in range(n):
  a = input()
  if a == "AC":
    countA += 1
  elif a == "WA":
    countW += 1
  elif a == "TLE":
    countT += 1
  elif a == "RE":
    countR += 1

print("AC × " + str(countA))
print("WA × " + str(countW))
print("TLE × " + str(countT))
print("RE × " + str(countR))
    

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
n = int(input())

countA = 0
countW = 0
countT = 0
countR = 0
for i in range(n):
  a = input()
  if a == "AC":
    countA += 1
  elif a == "WA":
    countW += 1
  elif a == "TLE":
    countT += 1
  elif a == "RE":
    countR += 1

print("AC x " + str(countA))
print("WA x " + str(countW))
print("TLE x " + str(countT))
print("RE x " + str(countR))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
num = (int)(input())
ans = [0, 0, 0, 0]
for i in range(num):
  temp = input()
  if temp == "AC":
    ans[0] += 1
  elif temp == "WA":
    ans[1] += 1
  elif temp == "TLE":
    ans[2] += 1
  else:
    ans[3] += 1
print("AC × " + (str)(ans[0]))
print("WA × " + (str)(ans[1]))
print("TLE × " + (str)(ans[2]))
print("RE × " + (str)(ans[3]))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
num = (int)(input())
ans = [0, 0, 0, 0]
for i in range(num):
  temp = input()
  if temp == "AC":
    ans[0] += 1
  elif temp == "WA":
    ans[1] += 1
  elif temp == "TLE":
    ans[2] += 1
  else:
    ans[3] += 1
print("AC x " + (str)(ans[0]))
print("WA x " + (str)(ans[1]))
print("TLE x " + (str)(ans[2]))
print("RE x " + (str)(ans[3]))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
a=[]
d=dict(AC=0, WA=0, TLE=0, RE=0)
for _ in range(N):
  a=input()
  d[a]+=1
for k, v in d.items():
  ans=k+" × "+str(v)
  print(ans)

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
N=int(input())
a=[]
d=dict(AC=0, WA=0, TLE=0, RE=0)
for _ in range(N):
  a=input()
  d[a]+=1
for k, v in d.items():
  ans=k+" x "+str(v)
  print(ans)

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
  c=input()
  if c=='AC':
    ac+=1
  elif c=='WA':
    wa+=1
  elif c=='TLE':
    tle+=1
  else:
    re+=1

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

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC X 10
WA X 0
TLE X 0
RE X 0


Fixed submission (verdict: Accepted):
n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
  c=input()
  if c=='AC':
    ac+=1
  elif c=='WA':
    wa+=1
  elif c=='TLE':
    tle+=1
  else:
    re+=1

print("AC x {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import defaultdict
def main():
    N = int(input())
    c = defaultdict(int)

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

    print("AC × {}".format(c["AC"]))
    print("WA × {}".format(c["WA"]))
    print("TLE × {}".format(c["TLE"]))
    print("RE × {}".format(c["RE"]))

if __name__ == "__main__":
    main()

Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
from collections import defaultdict
def main():
    N = int(input())
    c = defaultdict(int)

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

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

if __name__ == "__main__":
    main()

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import collections
N = int(input())
S = [input() for i in range(N)]
c = collections.Counter(S)
print("AC","×",str(c["AC"]))
print("WA","×",str(c["WA"]))
print("TLE","×",str(c["TLE"]))
print("RE","×",str(c["RE"]))


Failing test case input:
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Expected output:
AC x 10
WA x 0
TLE x 0
RE x 0

Actual output:
AC × 10
WA × 0
TLE × 0
RE × 0


Fixed submission (verdict: Accepted):
import collections
N = int(input())
S = [input() for i in range(N)]
c = collections.Counter(S)
print("AC","x",(c["AC"]))
print("WA","x",(c["WA"]))
print("TLE","x",(c["TLE"]))
print("RE","x",(c["RE"]))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import Counter
n=int(input())
s=[input() for i in range(n)]
print("AC ×",s.count("AC"))
print("WA ×",s.count("WA"))
print("TLE ×",s.count("TLE"))
print("RE ×",s.count("RE"))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
from collections import Counter
n=int(input())
s=[input() for i in range(n)]
print("AC","x",s.count("AC"))
print("WA","x",s.count("WA"))
print("TLE","x",s.count("TLE"))
print("RE","x",s.count("RE"))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
a = 0
b = 0
c = 0
d = 0
for n in range(N):
    s = input()
    if s == 'AC':
        a += 1
    if s == 'WA':
        b += 1
    if s == 'TLE':
        c += 1
    if s == 'RE':
        d += 1
print('AC × {}'.format(a))
print('WA × {}'.format(b))
print('TLE × {}'.format(c))
print('RE × {}'.format(d))

Failing test case input:
6
AC
TLE
AC
AC
WA
TLE

Expected output:
AC x 3
WA x 1
TLE x 2
RE x 0

Actual output:
AC × 3
WA × 1
TLE × 2
RE × 0


Fixed submission (verdict: Accepted):
N = int(input())
a = 0
b = 0
c = 0
d = 0
for n in range(N):
    s = input()
    if s == 'AC':
        a += 1
    if s == 'WA':
        b += 1
    if s == 'TLE':
        c += 1
    if s == 'RE':
        d += 1

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