ZhenlongDai/ACPR huggingface dataset:
Problem: p03137
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import heapq
n,m = map(int,input().split())
xlist = sorted(list(map(int,input().split())))
dlist = []
for i in range(m-1):
  heapq.heappush(dlist,-xlist[i+1]+xlist[i])

for i in range(m-n-2):
  heapq.heappop(dlist)

print(-sum(dlist))

Failing test case input:
4 7
-23 -1 1 7 -140 1 0

Expected output:
2


Actual output:
30


Fixed submission (verdict: Accepted):
n,m = map(int,input().split())
xlist = sorted(list(map(int,input().split())))

dlist = [0]*(m-1)
for i in range(m-1):
  dlist[i] = xlist[i+1]-xlist[i]
dlist.sort()
ans = 0

for i in range(m-n):
  ans += dlist[i]

print(ans)

Problem: p03137
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def main():
    n,m = map(int,input().split())
    X = list(map(int,input().split()))

    X.sort()
    X_diff = []
    for i in range(m-1):
        X_diff.append(X[i+1]-X[i])
    X_diff.sort()
    print(sum(X_diff[0:-(n-1)]))


if __name__ == '__main__':
    main()


Failing test case input:
1 7
-8 -1 0 9 -100 2 17

Expected output:
117


Actual output:
0


Fixed submission (verdict: Accepted):
def main():
    n,m = map(int,input().split())
    X = list(map(int,input().split()))

    X.sort()
    X_diff = []
    for i in range(m-1):
        X_diff.append(X[i+1]-X[i])
    X_diff.sort()
    if n ==1:
        print(sum(X_diff))
    else:
        print(sum(X_diff[0:-(n-1)]))


if __name__ == '__main__':
    main()

Problem: p03137
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,M = map(int, input().split())
x = list(map(int, input().split()))
dis = []
    
x.sort()
for i in range(M-1):
    dis.append(abs(x[i]-x[i+1]))  
dis.sort()

if N >= M:
    print(0)
if N == 0:
    print(sum(dis))
else:
    print(sum(dis[0:-(N-1)]))

Failing test case input:
101 1
-176109

Expected output:
0


Actual output:
0
0


Fixed submission (verdict: Accepted):
n, m = map(int,input().split())
x = list(map(int,input().split()))
x.sort()
dis = []
if n >= m:
    print(0)
else:    
    for i in range(m-1):
        dis.append(abs(x[i+1]-x[i]))
    dis.sort(reverse=True)
    for i in range(n-1):
        dis.pop(0)
    ans = sum(dis)
    print(ans)

Problem: p03137
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = map(int, input().split())
if n >= m:
    print(0)
    exit()
l = list(sorted(map(int, input().split())))
t = l[0]
a = []
for i in l[1:]:
    a.append(abs(t-i))
    t = i
print(sum(sorted(a)[:-(n-1)]))

Failing test case input:
1 7
-8 -1 0 9 -100 2 17

Expected output:
117


Actual output:
0


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())
if n >= m:
    print(0)
    exit()
l = list(map(int, input().split()))
l.sort()
t = l[0]
a = []
for i in l[1:]:
    a.append(i-t)
    t = i
a.sort(reverse=True)
print(sum(a[n-1:]))
Problem: p03137
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, m = map(int, input().split())
x = sorted([int(i) for i in input().split()])
x_ = sorted([x[i+1] - x[i] for i in range(m-1)])
print(sum(x_[:-n+1]))


Failing test case input:
1 7
-8 -1 0 9 -100 2 17

Expected output:
117


Actual output:
0


Fixed submission (verdict: Accepted):
n, m = map(int, input().split())
x = sorted([int(i) for i in input().split()])
x_ = sorted([x[i+1] - x[i] for i in range(m-1)])
if n >= m:
    print(0)
else:
    print(sum(x_[:m-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(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)

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:
WA 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())
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 + {}'.format(AC))
print('WA + {}'.format(WA))
print('TLE + {}'.format(TLE))
print('RE + {}'.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 + 10
WA + 0
TLE + 0
RE + 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 {}'.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):
    d[input()]+=1

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

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())
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())
Sn = []

for i in range(n):
    Sn.append(input())

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

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())
Sn = []

for i in range(n):
    Sn.append(input())

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

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

def main():

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

    n = int(input())
    for _ in range(n):
        s = input()
        mp[s]+=1

    for key in mp.keys():
        print(key, "x", mp[key])
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 x 3
TLE x 2
WA x 1
RE x 0


Fixed submission (verdict: Accepted):
import math

def main():

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

    n = int(input())
    for _ in range(n):
        s = input()
        mp[s]+=1

    for key in mp.keys():
        print(key, "x", mp[key])
main()

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

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 = []
for i in range(N):
  S.append(input())
s = 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 (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
C0, C1, C2, C3 = 0, 0, 0, 0

for i in range(N-1):
    S = str(input())
    if S == "AC":
        C0 = C0 + 1
    elif S == "WA":
        C1 = C1 + 1
    elif S == "TLE":
        C2 = C2 + 1
    else:
        C3 = C3 + 1

print("AC x " + str(C0))
print("WA x " + str(C1))
print("TLE x " + str(C2))
print("RE x " + str(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 x 9
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
N = int(input())
C0, C1, C2, C3 = 0, 0, 0, 0

for i in range(N):
    S = str(input())
    if S == "AC":
        C0 = C0 + 1
    elif S == "WA":
        C1 = C1 + 1
    elif S == "TLE":
        C2 = C2 + 1
    else:
        C3 = C3 + 1

print("AC x " + str(C0))
print("WA x " + str(C1))
print("TLE x " + str(C2))
print("RE x " + str(C3))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(1,s):
    ch = input()
    if ch == "AC":
        ac += 1
    elif ch == "WA":
        wa += 1
    elif ch == "TLE":
        tle +=1
    elif ch == "RE":
        re += 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:
AC x 9
WA x 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
s = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(1,s+1):
    ch = input()
    if ch == "AC":
        ac += 1
    elif ch == "WA":
        wa += 1
    elif ch == "TLE":
        tle +=1
    elif ch == "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 += [input()]
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))

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 i in range(n):
    s += [input()]
c0 = s.count("AC")
c1 = s.count("WA")
c2 = s.count("TLE")
c3 = s.count("RE")
print("AC x " + str(c0))
print("WA x " + str(c1))
print("TLE x " + str(c2))
print("RE x " + str(c3))

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

judgement = []
while True:
  try:
    judgement.append(input())
  except:
    break

counter = collections.Counter(judgement)

n_ac = counter.get('AC', 0)
n_ma = counter.get('MA', 0)
n_tle = counter.get('TLE', 0)
n_re = counter.get('RE', 0)

print('AC x {}'.format(n_ac))
print('MA x {}'.format(n_ma))
print('TLE x {}'.format(n_tle))
print('RE x {}'.format(n_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
MA x 0
TLE x 2
RE x 0


Fixed submission (verdict: Accepted):
import collections
 
judgement = []
while True:
  try:
    judgement.append(input())
  except:
    break
 
counter = collections.Counter(judgement)
 
n_ac = counter.get('AC', 0)
n_wa = counter.get('WA', 0)
n_tle = counter.get('TLE', 0)
n_re = counter.get('RE', 0)
 
print('AC x {}'.format(n_ac))
print('WA x {}'.format(n_wa))
print('TLE x {}'.format(n_tle))
print('RE x {}'.format(n_re))
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):



n = int(input())

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

c0=0
c1=0
c2=0
c3=0
for i in s:
    if i == "AC":
        c0+=1
    elif i == "WA":
        c1+=1
    elif i == "TLE":
        c2+=1
    else:
        c3+=1

print("AC x",c0)
print("WA x",c1)
print("TLE x",c2)
print("RE x",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', 'TLE', 'AC', 'AC', 'WA', 'TLE']
AC x 3
WA x 1
TLE x 2
RE x 0


Fixed submission (verdict: Accepted):



n = int(input())

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


c0=0
c1=0
c2=0
c3=0
for i in s:
    if i == "AC":
        c0+=1
    elif i == "WA":
        c1+=1
    elif i == "TLE":
        c2+=1
    else:
        c3+=1

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

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n=int(input())
s = [0]*n
for i in range(n):
    s[i] = input()

from collections import Counter
c=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:
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())
s = [0]*n
for i in range(n):
    s[i] = input()

from collections import Counter
c=Counter(s)

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

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

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())
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 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 = []
for i in range(n):
    s.append(input())

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

print('AC x ' + 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 x 3
WA × 1
TLE × 2
RE × 0


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

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))

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

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())
    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 x ' + str(AC))
    print('WA x ' + str(WA))
    print('TLE x ' + str(TLE))
    print('RE x ' + str(RE))

main()
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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):
  S=input()
  if S=='AC':
    ac+=1
  if S=='WA':
    wa+=1
  if S=='TLE':
    tle+=1
  if S=='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
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 {}\nWA x {}\nTLE x {}\nRE x {}'.format(ac,wa,tle,re))

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

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

print("AC × {:d}".format(s.count("AC")))
print("WA × {:d}".format(s.count("WA")))
print("TLE × {:d}".format(s.count("TLE")))
print("RE × {:d}".format(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):
a=int(input())

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

print("AC x {:d}".format(s.count("AC")))
print("WA x {:d}".format(s.count("WA")))
print("TLE x {:d}".format(s.count("TLE")))
print("RE x {:d}".format(s.count("RE")))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def judge_status_summary():
    N = int(input())
    res = {"AC":0,"WA":0,"TLE":0,"RE":0}
    for i in range(N):
        res[input()] += 1
    
    for k in res:
        print("{} X {}".format(k,res[k]))
        
judge_status_summary()

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):
def judge_status_summary():
    N = int(input())
    res = {"AC":0,"WA":0,"TLE":0,"RE":0}
    for i in range(N):
        res[input()] += 1
    
    for k in res:
        print("{} x {}".format(k,res[k]))
        
judge_status_summary()
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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))



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

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):


import sys
input=sys.stdin.readline

def main():
    N=int(input())
    r=["AC","WA","TLE","RE"]
    c=[0]*4
    for i in range(N):
        s=input().strip("\n")
        c[r.index(s)]+=1
    for i in range(4):
        print(r[i],"×",c[i])
    
    
    
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):


import sys
input=sys.stdin.readline

def main():
    N=int(input())
    r=["AC","WA","TLE","RE"]
    c=[0]*4
    for i in range(N):
        s=input().strip("\n")
        c[r.index(s)]+=1
    for i in range(4):
        print(r[i],"x",c[i])
    
    
    
if __name__=="__main__":
    main()

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
S_list = [input() for i in range(N)]
AC = S_list.count('AC')
WA = S_list.count('WA')
TLE = S_list.count('TLE')
RE = S_list.count("RE")
print('AC × {}'.format(AC))
print('WA × {}'.format(WA))
print('TLE × {}'.format(TLE))
print('RE × {}'.format(RE))


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_list = [input() for i in range(N)]
AC = S_list.count('AC')
WA = S_list.count('WA')
TLE = S_list.count('TLE')
RE = S_list.count("RE")
print('AC 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())
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)
    
    

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):
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("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):
n=int(input())
c1,c2,c3,c4=0,0,0,0
for i in range(n):
  s=input()
  if(s=='AC'):
    c1+=1
  elif(s=='WA'):
    c2+=1
  elif(s=='TLE'):
    c3+=1
  else:
    c4+=1
print('AC X'+' '+str(c1))
print('WA X'+' '+str(c2))
print('TLE X'+' '+str(c3))
print('RE X'+' '+str(c4))

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())
c1,c2,c3,c4=0,0,0,0
for i in range(n):
  s=input()
  if(s=='AC'):
    c1+=1
  elif(s=='WA'):
    c2+=1
  elif(s=='TLE'):
    c3+=1
  else:
    c4+=1
print('AC x'+' '+str(c1))
print('WA x'+' '+str(c2))
print('TLE x'+' '+str(c3))
print('RE x'+' '+str(c4))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = [input() for _ in range(n)]
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))

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 x10
WA x0
TLE x0
RE x0


Fixed submission (verdict: Accepted):
n = int(input())
s = [input() for _ in range(n)]
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))
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
    elif s=='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
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 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())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
    s = input()
    if s == 'AC':
        ac += 1
    elif s == 'WA':
        wa += 1
    elif s == 'TLE':
        tle += 1
    elif s == 'RE':
        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:
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())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
    s = input()
    if s == 'AC':
        ac += 1
    elif s == 'WA':
        wa += 1
    elif s == 'TLE':
        tle += 1
    elif s == '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):
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))

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())
a = [input() for i in range(N)]
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))
Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n = int(input())
s = [0 for i in range(4)]
for i in range(n):
    t = input()
    if t == "AC":
        s[0] += 1
    elif t == "WA":
        s[1] += 1
    elif t == "TLE":
        s[2] += 1
    elif t == "RE":
        s[3] += 1

for i in s:
    print("AC x",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 x 3
AC x 1
AC x 2
AC x 0


Fixed submission (verdict: Accepted):
n = int(input())
s = [0 for i in range(4)]
for i in range(n):
    t = input()
    if t == "AC":
        s[0] += 1
    elif t == "WA":
        s[1] += 1
    elif t == "TLE":
        s[2] += 1
    elif t == "RE":
        s[3] += 1

s_2 = ["AC","WA","TLE","RE"]
for i in range(4):
    print(s_2[i],"x",s[i])

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
data = {'AC':0,'WA':0,'TLE':0,'RE':0}
N = int(input())
for i in range(N):
  inputSTR = input()
  data[inputSTR] = data[inputSTR] + 1
  
for key,value in data.items():
  print(key + ' × ' + str(value))

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):
data = {'AC':0,'WA':0,'TLE':0,'RE':0}
N = int(input())
for i in range(N):
  inputSTR = input()
  data[inputSTR] = data[inputSTR] + 1
  
for key,value in data.items():
  print(key + ' x ' + str(value))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = [input() for i in range(n)]
print('AC * %d' % (s.count('AC')))
print('WA * %d' % (s.count('WA')))
print('TLE * %d' % (s.count('TLE')))
print('RE * %d' % (s.count('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 = [input() for i in range(n)]
print('AC x %d' % (s.count('AC')))
print('WA x %d' % (s.count('WA')))
print('TLE x %d' % (s.count('TLE')))
print('RE x %d' % (s.count('RE')))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import Counter
n = int(input().strip())
L = [input().strip() for _ in range(n)]


cnt=Counter(L)
for x in ["AC", "WA", "TLE", "RE"]:
    print(x+" ×　"+str(cnt[x]))

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().strip())
L = [input().strip() for _ in range(n)]


cnt=Counter(L)
for x in ["AC", "WA", "TLE", "RE"]:
    print(x+" x "+str(cnt[x]))
Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
  s = input()
  if s == 'AC':
    ac += 1
  elif s == 'WA':
    wa += 1
  elif s == 'tle':
    tle += 1
  else:
    re += 1
print('AC x ' + str(ac))
print('WA x ' + str(wa))
print('TLE x ' + str(tle))
print('RE x ' + 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 0
RE x 2


Fixed submission (verdict: Accepted):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
  s = input()
  if s == 'AC':
    ac += 1
  elif s == 'WA':
    wa += 1
  elif s == 'TLE':
    tle += 1
  else:
    re += 1
print('AC 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 = [input() for i in range(N)]
ac = 0
wa = 0
tle = 0
re = 0
for i in S:
  if i == "AC":
    ac += 1
  elif i == "WA":
    wa += 1
  elif i == "TLE":
    tle += 1
  else:
    re += 1
print("AC × {}".format(ac))
print("WA × {}".format(wa))
print("TLE × {}".format(tle))
print("RE × {}".format(re))

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())
S = [input() for i in range(N)]
ac = 0
wa = 0
tle = 0
re = 0
for i in S:
  if i == "AC":
    ac += 1
  elif i == "WA":
    wa += 1
  elif i == "TLE":
    tle += 1
  else:
    re += 1
print("AC 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())

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):
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")))

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)]
print("AC x "+str( S.count("AC")))
print("WA x "+str( S.count("WA")))
print("TLE x "+str( S.count("TLE")))
print("RE x "+str( S.count("RE")))

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

print("AC x "+str(S.count("AC")))
print("WA x "+str(S.count("WA")))
print("TEL x "+str(S.count("TEL")))
print("RE x "+str(S.count("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
TEL x 0
RE x 0


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

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

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n=int(input())
s=[input() for i in range(n)]
x=["AC","WA","TLE","RE"]

for i in x:
    print("{} × ".format(i)+str(s.count(i)))


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)]
x=["AC","WA","TLE","RE"]

for i in x:
    print("{} x ".format(i)+str(s.count(i)))

Problem: p02613
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
def main():
    n = int(input())
    cnt = [0, 0, 0, 0]
    for _ in range(n):
        s = input()
        if s == 'AC':
            cnt[0] += 1
        elif s == 'WA' :
            cnt[1] += 1
        elif s == 'TLE':
            cnt[2] += 1
        elif s == 'RE':
            cnt[3] += 1

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


if __name__ == "__main__":
    main()




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):
def main():
    n = int(input())
    cnt = [0, 0, 0, 0]
    for _ in range(n):
        s = input()
        if s == 'AC':
            cnt[0] += 1
        elif s == 'WA' :
            cnt[1] += 1
        elif s == 'TLE':
            cnt[2] += 1
        elif s == 'RE':
            cnt[3] += 1

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


if __name__ == "__main__":
    main()
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
num = int(input())
test = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(num):
    result = input()
    for j in test.keys():
        if result == j:
            test[result] += 1
for i in test:
    print(i, '×', str(test[i]))

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())
test = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(num):
    result = input()
    for j in test.keys():
        if result == j:
            test[result] += 1
for i in test:
    print(i, 'x', str(test[i]))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
num = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(num):
    judge = input()
    if judge == "AC":
        ac += 1
    elif judge == "WA":
        wa += 1
    elif judge == "TLE":
        tle += 1
    elif judge == "RE":
        re += 1
    else:
        pass
        
        
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):
import sys
n=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(n):
    moji=input()
    if moji =='AC':
        AC+=1
    elif moji =='WA':
        WA+=1
    elif moji =='TLE':
        TLE+=1
    else:
        RE+=1
A=[AC,WA,TLE,RE]
B=['AC','WA','TLE','RE']
for i in range(4):
    q=A[i]
    print(B[i],end='')
    print(' × ',end='')
    print(q)
    


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 sys
n=int(input())
AC=0
WA=0
TLE=0
RE=0
for i in range(n):
    moji=input()
    if moji =='AC':
        AC+=1
    elif moji =='WA':
        WA+=1
    elif moji =='TLE':
        TLE+=1
    else:
        RE+=1
A=[AC,WA,TLE,RE]
B=['AC','WA','TLE','RE']
for i in range(4):
    q=A[i]
    print(B[i],end='')
    print(' x ',end='')
    print(q)
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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")
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+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 0
TLE x 2
RE x 0


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




a=0
b=0
c=0
d=0
for i in range(N):
    S = str(input())
    if S=='AC':
        a+=1
    elif S=='WA':
        b+=1
    elif S=='TLE':
        c+=1
    else:
        d+=1

print('AC ×',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())




a=0
b=0
c=0
d=0
for i in range(N):
    S = str(input())
    if S=='AC':
        a+=1
    elif S=='WA':
        b+=1
    elif S=='TLE':
        c+=1
    else:
        d+=1

print('AC 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())
C = [0]*4 
for i in range(N):
  M = input()
  if M == "AC":
    C[0] += 1
  elif M == "WA":
    C[1] += 1
  elif M == "TLE":
    C[2] += 1
  elif M == "RE":
    C[3] += 1
    
print("AC" + " × " + str(C[0]))
print("WA" + " × " + str(C[1]))
print("TLE" + " × " + str(C[2]))
print("RE" + " × " + str(C[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):
N = int(input())
C = [0]*4
for i in range(N):
  M = input()
  if M == "AC":
    C[0] += 1
  elif M == "WA":
    C[1] += 1
  elif M == "TLE":
    C[2] += 1
  elif M == "RE":
    C[3] += 1
    
print("AC x " + str(C[0]))
print("WA x " + str(C[1]))
print("TLE x " + str(C[2]))
print("RE x " + str(C[3]))

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

c = [s.count("AC"),s.count("WA"),s.count("TLE"),s.count("RE")]

print("AC","×",c[0])
print("WA","×",c[1])
print("TLE","×",c[2])
print("RE","×",c[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):
n = int(input())
s = [input() for _ in range(n)]

c = [s.count("AC"),s.count("WA"),s.count("TLE"),s.count("RE")]

print("AC","x",c[0])
print("WA","x",c[1])
print("TLE","x",c[2])
print("RE","x",c[3])
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

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
TEL × 2
RE × 0


Fixed submission (verdict: Accepted):
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 x',ca)
print('WA x',cw)
print('TLE x',ct)
print('RE x',cr)

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

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):
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))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import collections
a=int(input())
b=[input() for i in range(a)]

c=collections.Counter(b)
n,m=zip(*c.most_common())
n=list(n)
m=list(m)
result=[0]*4
for i in range(len(n)):
    if n[i]=='AC':
        result[0]=m[i]
    if n[i]=='WA':
        result[1]=m[i]
    if n[i]=='TLE':
        result[2]=m[i]
    if n[i]=='RE':
        result[3]=m[i]
print('AC ×',result[0])
print('WA ×',result[1])
print('TLE ×',result[2])
print('RE ×',result[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):
import collections
a=int(input())
b=[input() for i in range(a)]

c=collections.Counter(b)
n,m=zip(*c.most_common())
n=list(n)
m=list(m)
result=[0]*4
for i in range(len(n)):
    if n[i]=='AC':
        result[0]=m[i]
    if n[i]=='WA':
        result[1]=m[i]
    if n[i]=='TLE':
        result[2]=m[i]
    if n[i]=='RE':
        result[3]=m[i]
    
print('AC x',result[0])
print('WA x',result[1])
print('TLE x',result[2])
print('RE x',result[3])
Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
a = 0
w = 0
t = 0
r = 0

x = [0]*N
for i in range(N):
  x[i] = input()
  if x[i] == "AC":
    a += 1
  elif x[i] == "WA":
    w += 0
  elif x[i] == "TLE":
    t += 0
  else:
    r += 0

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

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 0
TLE x 0
RE x 0


Fixed submission (verdict: Accepted):
N = int(input())
a = 0
w = 0
t = 0
r = 0

x = [0]*N
for i in range(N):
  x[i] = input()
  if x[i] == "AC":
    a += 1
  elif x[i] == "WA":
    w += 1
  elif x[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))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
rows = int(input())
x = [input() for i in range(rows)]
print("AC × {}".format(x.count('AC')))
print("WA × {}".format(x.count('WA')))
print("TLE × {}".format(x.count('TLE')))
print("RE × {}".format(x.count('RE')))


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):
rows = int(input())
x = [input() for i in range(rows)]
print("AC x {}".format(x.count('AC')))
print("WA x {}".format(x.count('WA')))
print("TLE x {}".format(x.count('TLE')))
print("RE x {}".format(x.count('RE')))

Problem: p02613
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    n = int(input())
    s = [input() for _ in range(n)]
    print('AC × {:}'.format(s.count('AC')))
    print('WA × {:}'.format(s.count('WA')))
    print('TLE × {:}'.format(s.count('TLE')))
    print('RE × {:}'.format(s.count('RE')))
    return 0

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):
import sys
import math
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    n = int(input())
    s = [input() for _ in range(n)]
    print('AC x {:}'.format(s.count('AC')))
    print('WA x {:}'.format(s.count('WA')))
    print('TLE x {:}'.format(s.count('TLE')))
    print('RE x {:}'.format(s.count('RE')))
    return 0

if __name__ == "__main__":
    main()