Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    # 整数 1 つ
    n = int(input())
    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    A = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    A = sorted(A)

    cntmax = 0
    for x in range(min(A), max(A)+1):
        cnt = 0
        for a in A:
            if x-1 <= a and a <= x+1:
                cnt += 1
            elif a < x-1:
                continue
            else:
                break
                
        if cntmax < cnt:
            cntmax = cnt

    print(cntmax)


resolve()

Fixed submission:
def resolve():
    # 整数 1 つ
    n = int(input())
    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    A = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    A = sorted(A)

    Cnt = [0] * 100002
    for a in A:
        Cnt[a] += 1
        Cnt[a+1] += 1
        Cnt[a+2] += 1

    print(max(Cnt))
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    # 整数 1 つ
    n = int(input())
    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    A = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    A = sorted(A)

    cntmax = 0
    for x in range(min(A), max(A)+1):
        cnt = 0
        for a in A:
            if x-1 <= a and a <= x+1:
                cnt += 1
            elif a < x-1:
                continue
            else:
                break
                
        if cntmax < cnt:
            cntmax = cnt

    print(cntmax)


resolve()

Fixed submission:
def resolve():
    # 整数 1 つ
    n = int(input())
    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    A = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    A = sorted(A)

    Cnt = [0] * 100002
    for a in A:
        Cnt[a] += 1
        Cnt[a+1] += 1
        Cnt[a+2] += 1

    print(max(Cnt))
resolve()
Buggy python submission (verdict: Runtime Error):
def resolve():
    # 整数 1 つ
    s = input()
    # 整数複数個
    # a, b, c = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    alpha = string.ascii_lowercase
    A = [alpha[i] for i in range(len(alpha))]

    for x in A:
        if x not in s:
            print(x)
            break
        if x == "z":
            print("None")

resolve()

Fixed submission:
import string

def resolve():
    # 整数 1 つ
    s = input()
    # 整数複数個
    # a, b, c = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    alpha = string.ascii_lowercase
    A = [alpha[i] for i in range(len(alpha))]

    for x in A:
        if x not in s:
            print(x)
            break
        if x == "z":
            print("None")

resolve()
Buggy python submission (verdict: Runtime Error):
def resolve():
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    n, m = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    A = [list(map(int, input().split())) for i in range(m)]

    towns = {}
    for i in range(n):
        towns[i] = 0

    for j in range(m):
        for k in range(2):
            towns[A[j][k]] += 1

    print(towns.values())

resolve()

Fixed submission:
def resolve():
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    n, m = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    A = [list(map(int, input().split())) for i in range(m)]

    towns = {}
    for i in range(n):
        towns[i] = 0

    for j in range(m):
        for k in range(2):
            towns[A[j][k] -1] += 1

    for l in range(n):
        print(towns[l])
resolve()
Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    k, s = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    cnt = 0
    for x in range(k+1):
        for y in range(k+1):
            for z in range(k+1):
                if x + y + z == s:
                    cnt += 1
                    break
            if x + y > s:
                break
        if x > s:
            break

    print(cnt)


resolve()

Fixed submission:
def resolve():
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    k, s = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

    cnt = 0
    for x in range(k+1):
        if x == s:
            cnt += 1
            break
        for y in range(k+1):
            c = s - (x + y)
            if c <= k and c >= 0:
                cnt += 1

#            for z in range(k+1):
 #               if x + y + z == s:
  #                  cnt += 1
   #                 break
    print(cnt)

resolve()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [0]*(10**5)
for i in range(1,1000):
    for j in range(1,1000):
        for  k in range(1,101):
            try:
                a[i*i+j*j+k*k+i*j+j*k+i*k]+=1
            except:
                continue
for i in range(1, n+1):
    print(a[i])

Fixed submission:
n = int(input())
a = [0]*((10**4)+1)
for i in range(1,101):
    for j in range(1,101):
        for  k in range(1,101):
            try:
                a[i*i+j*j+k*k+i*j+j*k+i*k]+=1
            except:
                continue
for i in range(1, n+1):
    print(a[i])

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [0]*(10**4)
for i in range(1,101):
    for j in range(1,101):
        for  k in range(1,101):
            try:
                a[i*i+j*j+k*k+i*j+j*k+i*k]+=1
            except:
                continue
for i in range(1, n+1):
    print(a[i])

Fixed submission:
n = int(input())
a = [0]*((10**4)+1)
for i in range(1,101):
    for j in range(1,101):
        for  k in range(1,101):
            try:
                a[i*i+j*j+k*k+i*j+j*k+i*k]+=1
            except:
                continue
for i in range(1, n+1):
    print(a[i])
Buggy python submission (verdict: Runtime Error):
n, m = list(map(int,input().split()))
a = list(map(int,input().split()))
s = sum(a)
x = (1/(4*m))*(s)
for i in a:
    if(i>=x):
        u+=1
if(u>=m):
    print("Yes")
else:
    print("No")

Fixed submission:
n, m = list(map(int,input().split()))
a = list(map(int,input().split()))
s = sum(a)
x = (1/(4*m))*(s)
u = 0
for i in a:
    if(i>=x):
        u+=1
if(u>=m):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n,a,b = list(map(int,input().split()))
if((b-a)%2==0):
    print((a2-a1)//2)
else:
    print(min(n-a, b-1))

Fixed submission:
n,a,b = list(map(int,input().split()))
if((b-a)%2==0):
    print(int((b-a)//2))
else:
    u = (b-a-1)//2
    if(n>(a+b-1)):
        print(u+a)
    else:
        print(u+(n-b+1))

Buggy python submission (verdict: Runtime Error):
n,a,b = list(map(int,input().split()))
if((b-a)%2==0):
    print((a2-a1)//2)
else:
    print(min(n-a, b-1))

Fixed submission:
n,a,b = list(map(int,input().split()))
if((b-a)%2==0):
    print(int((b-a)//2))
else:
    u = (b-a-1)//2
    if(n>(a+b-1)):
        print(u+a)
    else:
        print(u+(n-b+1))

Buggy python submission (verdict: Runtime Error):
n,a,b = list(map(int,input().split()))
if((b-a)%2==0):
    print((a2-a1)//2)
else:
    print(min(n-a, b-1))

Fixed submission:
n,a,b = list(map(int,input().split()))
if((b-a)%2==0):
    print(int((b-a)//2))
else:
    u = (b-a-1)//2
    if(n>(a+b-1)):
        print(u+a)
    else:
        print(u+(n-b+1))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for i in range(1,n+1):
    ans = 0
    for x in range(40):
        for y in range(40):
            for z in range(40):
                if (x+y+z)**2 -(x*y+y*z+z*x) == i and x>=1 and y>=1 and z>=1:
                    ans += 1
    print(ans)


Fixed submission:
cnt=[0] * 11000
n = int(input())

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            value = (x+y+z)**2 -(x*y+y*z+z*x)
            if value <= n:
                cnt[value] += 1

for i in range(1,n+1):
    print(cnt[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
for i in range(1,n+1):
    ans = 0
    for x in range(33):
        for y in range(33):
            for z in range(33):
                if (x+y+z)**2 -(x*y+y*z+z*x) == i and x>=1 and y>=1 and z>=1:
                    ans += 1
    print(ans)
                

Fixed submission:
cnt=[0] * 11000
n = int(input())

for x in range(1,101):
    for y in range(1,101):
        for z in range(1,101):
            value = (x+y+z)**2 -(x*y+y*z+z*x)
            if value <= n:
                cnt[value] += 1

for i in range(1,n+1):
    print(cnt[i])
Buggy python submission (verdict: Time Limit Exceeded):

n = int(input())
ans = 0


def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

for i in range(1,n+1):
    ans += i*len(make_divisors(i))

print(ans)

Fixed submission:

def calc(b,e):
    cnt = e // b
    return (b+e) * cnt//2


n = int(input())
ans = 0
for i in range(1,n+1):
    ans += calc(i,n//i * i)

print(ans)
Buggy python submission (verdict: Runtime Error):
x,n = map(int,input().split())
p = list(map(int,input().split()))
sa = []
num = []
for i in range(1,101):
    if i in p:
        continue
    sa.append(abs(x-i))
    num.append(i)

print(num[sa.index(min(sa))])


Fixed submission:
x,n = map(int,input().split())
p = list(map(int,input().split()))
sa = []
num = []
for i in range(-110,110):
    if i in p:
        continue
    sa.append(abs(x-i))
    num.append(i)

print(num[sa.index(min(sa))])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
ans = 1
for i in range(n):
    ans *= a[i]
if ans > 10**18:
    print(-1)
else:
    print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 1
m = 10 ** 18

if 0 in a:
    print(0)
    exit()
for i in a:
    ans *= i
    if ans>m:
        print(-1)
        exit()
    
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
ans = 1
for i in range(n):
    ans *= a[i]
if ans > 10**18:
    print(-1)
else:
    print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 1
m = 10 ** 18

if 0 in a:
    print(0)
    exit()
for i in a:
    ans *= i
    if ans>m:
        print(-1)
        exit()
    
print(ans)
Buggy python submission (verdict: Runtime Error):
s = list(input())
print(s.replace("?","D"))

Fixed submission:
print(input().replace("?","D"))
Buggy python submission (verdict: Time Limit Exceeded):
import math
k = int(input())
ans = []
for x in range(1,k+1):
    for y in range(1,k+1):
        for z in range(1,k+1):
           xy = math.gcd(x,y)
           ans.append(math.gcd(xy,z))
print(sum(ans))


Fixed submission:
import math
k = int(input())
ans = []
for x in range(1,k+1):
    for y in range(1,k+1):
        for z in range(1,k+1):
           xy = math.gcd(x,y)
           ans.append(math.gcd(xy,z))
print(sum(ans))
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
N = n
if n % k == 0:
    print(0)
else:
    while n > 0:
        n -= k
    if abs(n) > N:
        print(N)
    else:
        print(abs(n))


Fixed submission:
n,k = list(map(int,input().split()))
a = n % k
print(min(abs(a-k),a))

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
N = n
if n % k == 0:
    print(0)
else:
    while n > 0:
        n -= k
    if abs(n) > N:
        print(N)
    else:
        print(abs(n))


Fixed submission:
n,k = list(map(int,input().split()))
a = n % k
print(min(abs(a-k),a))
Buggy python submission (verdict: Runtime Error):
import math
a ,b ,c = map(int,input().split())
ra = (math.sqrt(a))
rb = (math.sqrt(b))
rc = (math.sqrt(c))
if ra + rb < rc:
    print("Yes")
elif ra + rb >= rc:
    print("No")
else:
    print("No")

Fixed submission:
k = int(input())
list1 = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(list1[k-1])
Buggy python submission (verdict: Runtime Error):
from decimal import Decimal
a ,b ,c = map(int,input().split())
ra = (Decimal.sqrt(a))
rb = (Decimal.sqrt(b))
rc = (Decimal.sqrt(c))
if ra + rb < rc:
    print("Yes")
else:
    print("No")


Fixed submission:
a ,b ,c = map(int,input().split())
#4*a*b < (c-a-b)**2　両辺を２乗することを思いつかなかった。
if 4*a*b < (c-a-b)**2 and (c-a-b) > 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s = input()
if s == "AAA" or s === "BBB":
    print("no")
else:
    print("yes")


Fixed submission:
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
s = input()
if s == "AAA" or s === "BBB":
    print("no")
else:
    print("yes")
    

Fixed submission:
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):

s = input()
if s == "AAA" or s === "BBB":
    print("no")
else:
    print("yes")
    

Fixed submission:
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):

S = input()
if S[0] == S[1] and S[1]== S[2] == :
    print("no")
else:
    print("yes")


Fixed submission:
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
//入力部分以外わからなかった。

S = input()
if S[0] == S[1] == S[2] == :
    print("no")
else:
    print("yes")


Fixed submission:
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
S = input()
if S[0] == S[1] == S[2] == S[3]:
    print("no")
else:
    print("yes")


Fixed submission:
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
n = input()
paper = 0
if n % 2 == 0:
    paper = n / 2
else:
    paper = n / 2 + 1
print(paper)


Fixed submission:
n = int(input())
print((n+1) // 2)

Buggy python submission (verdict: Runtime Error):
n = input()
paper = 0
if n % 2 == 0:
    paper = n / 2
else:
    paper = n / 2 + 1
print(paper)

Fixed submission:
n = int(input())
print((n+1) // 2)
Buggy python submission (verdict: Runtime Error):
n,r = map(int,input().split())
rate = r - 100 * (10-n)
if 10 <= n:
   print(r)
else:
   print(int(r;+(100*(10-n))))


Fixed submission:
n,r = map(int, input().split())
if n >= 10:
	print(r)
else:
	print(r + (100*(10-n)))
Buggy python submission (verdict: Runtime Error):
a ,b ,c = map(int(input().spilt()))
if a == b and a !=c:
    print("Yes")
elif b == c and b != c:
    print("Yes")
elif c == a and c != b:
    pritn("Yes")
else:
    print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print('Yes')
elif a==c and a!=b:
  print('Yes')
elif b==c and b!=a:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
a ,b ,c = int(input().spilt())
if a == b and a !=c:
    print("Yes")
elif b == c and b != c:
    print("Yes")
elif c == a and c != b:
    pritn("Yes")
else:
    print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a==b and a!=c:
  print('Yes')
elif a==c and a!=b:
  print('Yes')
elif b==c and b!=a:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
#入力部分　ここまでは誰でもできる
s,t = map(str,input().split())
a,b = map(int,input().split())
u = str(input())

if u == s:
  print(a-1,b)
else
  print(a,b-1)


Fixed submission:
s,t = map(str,input().split())
a,b = map(int,input().split())
u = str(input())
 
if u == s:
  print(a-1,b)
else:
  print(a,b-1)
Buggy python submission (verdict: Runtime Error):
#入力部
n,k = map(int,input().split())
h = list(map(int,input().split()))

#攻撃:hを1減らす　必殺技:hをすべて減らす制限　k回
#hを降順にソート
h.sort(reverse = True)
#nがkより小さい時全部に必殺技が使えるから0
if n <= k:
    print(0)
#体力が多い順に必殺技を使用して残った体力の合計を出力
else:
    for i in range(k):
        s[i] = 0
print(sum(s))

Fixed submission:
#入力部
n,k = map(int,input().split())
h = list(map(int,input().split()))

#攻撃:hを1減らす　必殺技:hをすべて減らす制限　k回
#hを降順にソート
h.sort(reverse = True)
#nがkより小さい時全部に必殺技が使えるから0
if n <= k:
    print(0)
#体力が多い順に必殺技を使用して残った体力の合計を出力
else:
    for i in range(k):
        h[i] = 0
    print(sum(h))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a == 1 and b == 2:
    print(3)
elif a == 2 and b ==3:
    print(1)
else:
    pritn(2)
    

Fixed submission:
s,t = input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a == 1 and b == 2:
    print(3)
elif a == 2 and b ==3:
    print(1)
else:
    pritn(2)
    

Fixed submission:
a = int(input())
b = int(input())
ans = 6 - a -b
print(ans)
Buggy python submission (verdict: Runtime Error):
import numpy as np
a,b = map(int,input().split())
lcm = np.lcm(a,b)
print(lcm)


Fixed submission:
a,b = map(int,input().split())
#最大公約数
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
#最小公倍数
def lcm(a,b):
    return a*b//gcd(a,b)
print(lcm(a,b))

Buggy python submission (verdict: Runtime Error):
import numpy as np
a,b = map(int,input().split())
print(np.lcm(a,b))

Fixed submission:
a,b = map(int,input().split())
#最大公約数
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return a
#最小公倍数
def lcm(a,b):
    return a*b//gcd(a,b)
print(lcm(a,b))
Buggy python submission (verdict: Runtime Error):
s = input()
if s == "SUN":
    print(7)
elif s == "MON":
    pritn(6)
elif s == "TUE":
    print(5)
elif s == "WEd":
    print(4)
elif s == "THU":
    print(3)
elif s == "FRI":
    print(2)
else:
    print(1)


Fixed submission:
s = input()
ans = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(ans[s])
Buggy python submission (verdict: Runtime Error):
n = int(input())
for i in range(1,n+1):
    if len(str(i)) % 2 == 1:
        ans += 1
print(ans)


Fixed submission:
n = int(input())
ans = 0
for i in range(1,n+1):
    if len(str(i)) % 2 == 1:
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
#桁が奇数の時の個数
for i in range(1,n+1):
    if len(str(i)) % 2 == 1:
        ans += 1
print(ans)


Fixed submission:
n = int(input())
ans = 0
for i in range(1,n+1):
    if len(str(i)) % 2 == 1:
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
s.sort()
ans = "No"
if s[0] == s[1] and s[2] == s[3]:
    if s[1] != s[2]:
        ans = "Yes"
print(ans)


Fixed submission:
s = list(input())
s.sort()
ans = "No"
if s[0] == s[1] and s[2] == s[3]:
    if s[1] != s[2]:
        ans = "Yes"
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
p = list(map(int,input().split()))

ans = 0

for i in range(1,n-1):
    if p[i-1]<p[i]<p[i+1] or p[i-1]>p[i]>i[i+1]:
        ans += 1
print(ans)

Fixed submission:
n = int(input())
p = list(map(int,input().split()))
ans = 0

for i in range(1,n-1):
    a,b,c = p[i-1:i+2]
    if b != min(a,b,c,) and b != max(a,b,c):
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
print(int(2*n / math.gcd(2,n)))


Fixed submission:
import fractions
n = int(input())
print(int(2*n / fractions.gcd(2,n)))
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
result = a * b
if result % 2 = 0:
  print("Even")
else:
  print("Odd")

Fixed submission:
a,b = map(int, input().split())
print("Even" if (a*b)%2==0 else "Odd")

Buggy python submission (verdict: Runtime Error):
#整数a,bを入力
a,b = (int, input().split())
#計算
result = a * b
#判定
if result % 2 = 0:
  print("Even")
else
  print("Odd")

Fixed submission:
a,b = map(int, input().split())
print("Even" if (a*b)%2==0 else "Odd")
Buggy python submission (verdict: Runtime Error):
o = list(input())
e = list(input())
ans = []
for i in range(len(o)):
    ans.append(o[i])
    ans.append(e[i])
print("".join(ans))

Fixed submission:
O = input()
E = input()

ans = ""
for o,e in zip(O,E):
    ans += o
    ans += e

if len(O) > len(E):
    ans += O[-1]
print(ans)
Buggy python submission (verdict: Runtime Error):
K,S = map(int,input().split())
ans = 0
for x in range(K+1):
    for y in range(K+1):
        z = S - (x + y)
        if  0 <= z <= k:
            ans += 1
print(ans)


Fixed submission:
K,S = map(int,input().split())
ans = 0
for x in range(K+1):
    for y in range(K+1):
        z = S - (x + y)
        if  0 <= z <= K:
            ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int,input().split())
ans = 0
for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if x + y + z == S:
                ans += 1
print(ans)


Fixed submission:
K,S = map(int,input().split())
ans = 0
for x in range(K+1):
    for y in range(K+1):
        z = S - (x + y)
        if  0 <= z <= K:
            ans += 1
print(ans)