Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s = input()
n = len(s) - 1 #隙間の数

for i in range(2**3):
    tmp = s[0]
    for j in range(n):
        if (i >> j) & 1:
            tmp += "+"

        else:
            tmp += "-"

        tmp += s[j+1]

    list_tmp = [tmp[0], tmp[1:3], tmp[3:5], tmp[5:7]]

    for j in list_tmp:
        res += int(j)

    if res == 7:

        print(tmp + "=7")
        exit()

Fixed submission:
s = input()
n = len(s) - 1 #隙間の数

for i in range(2**3):
    tmp = s[0]
    for j in range(n):
        if (i >> j) & 1:
            tmp += "+"

        else:
            tmp += "-"

        tmp += s[j+1]

    list_tmp = [tmp[0], tmp[1:3], tmp[3:5], tmp[5:7]]

    res = 0
    for j in list_tmp:
        res += int(j)

    if res == 7:

        print(tmp + "=7")
        exit()
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
for i in range(1,1009):
    if int(i*0.08) == a and int(i*0.1) == b:
        print(int(i))
print("-1")

Fixed submission:
s = input()
if "AB" in s or "BA" in s:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s + "".join(list1))


Fixed submission:
s = input()
if "AB" in s or "BA" in s:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s + "".join(list1))


Fixed submission:
s = input()
if "AB" in s or "BA" in s:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
q = int(input())
count = 1
rc = 0
while count < q+1:
    line = list(input())
    if line[0] == "2":
        if rc%2 != 0:
            s = s[::-1]
            rc = 0
        if line[2] == "1":
            s = line[4] + s
        else:
            s = s + line[4]
    else:
        rc += 1
    count += 1
if rc%2 != 0:
    s = s[::-1]
print(s)

Fixed submission:
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s[::-1] + "".join(list1))

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
q = int(input())
count = 1
while count < q+1:
    line = list(input())
    if line[0] == "2":
        if line[2] == "1":
            s = line[4] + s
        else:
            s = s + line[4]
    else:
        s = s[::-1]
    count += 1
print(s)

Fixed submission:
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s[::-1] + "".join(list1))

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
q = int(input())
count = 1
while count < q+1:
    line = input()
    if "2" in line:
        t, f, c = line.split()
        if f == "1":
            s = c + s
        else:
            s = s + c
    else:
        s = s[::-1]
    count += 1
print(s)

Fixed submission:
s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
    in_line = input().split()
    if in_line[0] == "1":
        flag *= -1
    else:
        if in_line[1] == "1":
            if flag == 1:
                list1.append(in_line[2])
            else:
                list2.append(in_line[2])
        else:
            if flag == 1:
                list2.append(in_line[2])
            else:
                list1.append(in_line[2])
if flag == 1:
    print("".join(list1[::-1]) + s + "".join(list2))
else:
    print("".join(list2[::-1]) + s[::-1] + "".join(list1))
Buggy python submission (verdict: Runtime Error):
weather = ['Sunny', 'Cloudy', 'Rainy']
s = input()
for i,v in enumerate(weather):
    if v == s:
        print(weather[i + 1 % 3])

Fixed submission:
weather = ['Sunny', 'Cloudy', 'Rainy']
s = input()
for i,v in enumerate(weather):
    if v == s:
        print(weather[(i + 1) % 3])

Buggy python submission (verdict: Runtime Error):
weather = ['Sunny', 'Cloudy', 'Rainy']
s = input()
for i,v enumerate(weather):
    if v == s:
        print(weather[i + 1 % 3])

Fixed submission:
weather = ['Sunny', 'Cloudy', 'Rainy']
s = input()
for i,v in enumerate(weather):
    if v == s:
        print(weather[(i + 1) % 3])
Buggy python submission (verdict: Runtime Error):
n, d = map(int, input().split())
count = 0
x_list = (list(map(int, input().split())) for _ in range(n))

for i in range(n-1):
    for j in range(i+1, n):
        count += (sum((a-b)**2 for a,b in zip(x_list[i], x_list[j]))**0.5).is_integer
print(count)

Fixed submission:
n, a, b = map(int, input().split())
print(min(a*n, b))
Buggy python submission (verdict: Runtime Error):
n, d = map(int, input().split())
count = 0
x_list = (list(map(int, input().split())) for _ in range(n))

for i in range(n-1):
    for j in range(i+1, n):
        count += (sum((a-b)**2 for a,b in zip(x_list[i], x_list[j]))**0.5).is_integer
print(count)

Fixed submission:
import math

n, d = map(int, input().split())
x_list = []
count = 0

for i in range(n):
    x_list.append([int(i) for i in input().split()])

for i in range(len(x_list)-1):
    for j in range(i+1, len(x_list)):
        cal = 0
        for k in range(d):
            cal += (x_list[i][k] - x_list[j][k])**2
        if math.sqrt(cal) == int(math.sqrt(cal)):
            count += 1

print(count)

Buggy python submission (verdict: Runtime Error):
n, d = map(int, input().split())
count = 0
x_list = (list(map(int, input().split())) for _ in range(n)))

for i in range(n-1):
    for j in range(i+1, n):
        count += (sum((a-b)**2 for a,b in zip(x_list[i], x_list[j]))**0.5).is_integer
print(count)

Fixed submission:
import math

n, d = map(int, input().split())
x_list = []
count = 0

for i in range(n):
    x_list.append([int(i) for i in input().split()])

for i in range(len(x_list)-1):
    for j in range(i+1, len(x_list)):
        cal = 0
        for k in range(d):
            cal += (x_list[i][k] - x_list[j][k])**2
        if math.sqrt(cal) == int(math.sqrt(cal)):
            count += 1

print(count)

Buggy python submission (verdict: Runtime Error):
n, d = map(int, input().split())
count = 0
x_list = (list(map(int, input().split())) for _ in range(n)))

for i in range(n-1):
    for j in range(i+1, n):
        count += (sum((a-b)**2 for a,b in zip(x_list[i], x_list[j]))**0.5).is_integer
print(count)

Fixed submission:
import math

n, d = map(int, input().split())
x_list = []
count = 0

for i in range(n):
    x_list.append([int(i) for i in input().split()])

for i in range(len(x_list)-1):
    for j in range(i+1, len(x_list)):
        cal = 0
        for k in range(d):
            cal += (x_list[i][k] - x_list[j][k])**2
        if math.sqrt(cal) == int(math.sqrt(cal)):
            count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
p_list = list(map(int, input().split()))
count = 0
for i in range(1,len(p_list)-1):
    if p_list[i-1] < p_list[i] < p_list[i+1]:
        count += 1
    if p_list[i-1] > p_list[i] > p_list[i+1]:
        count += 1
print(count)

Fixed submission:
s = input()
if len(set(s)) == 2 and s.count(s[0]) == 2:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s_p_list = []

for i in range(n):
    s_p_list.append(input().split())
    s_p_list[i].append(i+1)

result = sorted(s_p_list, key=lambda x: (x[0], -int(x[1]))) #sortedは非破壊的

for i in result:
  print(i[2])

Fixed submission:
a, p = map(int, input().split())
print((a*3+p)//2)
Buggy python submission (verdict: Runtime Error):
s = list(input())
head = int(s[0] + s[1])
tail = int(s[2] + s[3])

if (0 < head < 13) and (0 < tail < 13):
    print('AMBIGUOUS')
elif 0 < tail < 13:
    print('YYMM')
elif 0 < head < 13:
    print('MMYY')
else:
    print('NA')

Fixed submission:
n, k = map(int, input().split())
s = list(input()) #文字列はそのままだとイミュータブル
s[k-1] = chr(ord(s[k-1]) + 32)
print("".join(s))

Buggy python submission (verdict: Runtime Error):
s = list(input())
head = int(s[0] + s[1])
tail = int(s[2] + s[3])
if (head == 0 or 12 < head < 100) and (0 < tail < 13): #YYは00も含む
    print('YYMM')
elif (0 < head < 13) and (tail == 0 or 12 < tail < 100):
    print('MMYY')
elif (0 < head < 13) and (0 < tail < 13):
    print('AMBIGUOUS')
else:
    print('NA')

Fixed submission:
n, k = map(int, input().split())
s = list(input()) #文字列はそのままだとイミュータブル
s[k-1] = chr(ord(s[k-1]) + 32)
print("".join(s))
Buggy python submission (verdict: Runtime Error):
h, n = map(int, input().split())
a = []
a.append(map(int,input().split()))
sum = 0

for i in a:
  sum += i
  
if sum >= h:
  print("Yes")
else:
  print("No")

Fixed submission:
h, n = map(int, input().split())
a = list(map(int,input().split()))
sum = 0

for i in a:
  sum += i
  
if sum >= h:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split(" "))
list_a = [i for i in range(round(a/0.08+0.5)-1, round((a+1)/0.08 +0.5))]
list_b = [i for i in range(round(b/0.1 +0.5)-1,round((b+1)/0.1 +0.5))]
list_and = list(set(list_a) & set(list_b))
if list_and == []:
    print("-1")
else:
    print(min(list_and))

Fixed submission:
a = input()
if ("B" in a) & ("A" in a):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = []
K = []
key_num, tmp = map(int, input().split())
x = 0
while x < key_num:
    a, b = map(int, input().split())
    N.append(a)
    K.append(b)
    x += 1
#print(N, K)
input_data = []
n = 0
for i in N:
    now = 1
    while now <= K[n]:
        input_data.append(i)
        now += 1
    n += 1
#print(input_data)
input_data.sort()
print(input_data[key_num])

Fixed submission:
a, b, c = map(int, input().split())
if a > 100 or a < -100:
 exit()
elif -100 > b or 100 < b:
 exit()
elif -100 > c or 100 < c:
 exit()
if a <= c and c <= b:
 print("Yes")
else:
 print("No")

Buggy python submission (verdict: Runtime Error):
N = []
K = []
while True:
    a, b = map(int, input().split())
    if a == -1:
        break
    N.append(a)
    K.append(b)
key = K[0]
del N[0]
del K[0]
print(N, K)
input_data = []
n = 0
for i in N:
    now = 1
    while now <= K[n]:
        input_data.append(i)
        now += 1
    n += 1
print(input_data)
input_data.sort()
print
print(input_data[key])


Fixed submission:
a, b, c = map(int, input().split())
if a > 100 or a < -100:
 exit()
elif -100 > b or 100 < b:
 exit()
elif -100 > c or 100 < c:
 exit()
if a <= c and c <= b:
 print("Yes")
else:
 print("No")
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[0] == S[1] and S[1] == S[2]:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
a,b = int(input())
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')

Fixed submission:
a,b = map(int,input().split())
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
print(input().count("1")

Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Runtime Error):
import math
n = input()
a = list(map(int,input().split()))
ans = float("inf")
for i in a:
  ans = min(ans,len(bin(i) - bin(i).rfind("1") - 1)
print(round(ans))

Fixed submission:
import math
n = input()
a = list(map(int,input().split()))
ans = float("inf")
for i in a:
  ans = min(ans,len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))
Buggy python submission (verdict: Runtime Error):
b = input()
a = list(map(float,b.split()))
 
for i in range(0, 1251):
  if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
    print(i)
    return

print(-1)

Fixed submission:
def f():
  a = list(map(float,input().split()))

  for i in range(0, 1251):
    if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
      print(i)
      return

  print(-1)

f()

Buggy python submission (verdict: Runtime Error):
a = list(map(float,input().split()))

for i in range(0, 1251):
  if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
    print(i)
    return

print(-1)

Fixed submission:
def f():
  a = list(map(float,input().split()))

  for i in range(0, 1251):
    if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
      print(i)
      return

  print(-1)

f()

Buggy python submission (verdict: Runtime Error):
a = list(map(float,input().split()))
 
for i in range(0, 1251):
  if a[0]/0.08 >= i and (a[0]-1.0)/0.08 < i and a[1]/0.1 >= i and (a[1]-1.0)/0.1 < i:
    print(i)
    return
print(-1)

Fixed submission:
def f():
  a = list(map(float,input().split()))

  for i in range(0, 1251):
    if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
      print(i)
      return

  print(-1)

f()

Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
 
for i in range(0, 1251):
  if a[0]/0.08 >= i and (a[0]-1)/0.08 < i and a[1]/0.1 >= i and (a[1]-1)/0.1 < i:
    print(i)
    return
print(-1)

Fixed submission:
def f():
  a = list(map(float,input().split()))

  for i in range(0, 1251):
    if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
      print(i)
      return

  print(-1)

f()

Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))

for i in range(0, 1251):
  if a[0]/0.08 >= i and (a[0]-1)/0.08 < i and a[1]/0.1 >= i and (a[1]-1)/0.1:
    print(i)
    return
print(-1)

Fixed submission:
def f():
  a = list(map(float,input().split()))

  for i in range(0, 1251):
    if i >= a[0]/0.08 and i < (a[0]+1)/0.08 and i >= a[1]/0.1 and i < (a[1]+1)/0.1:
      print(i)
      return

  print(-1)

f()
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if a<10 and b<10:
  print(a*b)
else:
  print("-1")

Fixed submission:
a,b = map(int,input().split())
if a<10 and b<10:
  print(a*b)
else:
  print("-1")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
if a<10 and b<10:
  print(a*b)
else:
  print(-1)

Fixed submission:
a,b = map(int,input().split())
if a<10 and b<10:
  print(a*b)
else:
  print("-1")
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a > 2b:
  print(a-2b)
else:
  print(0)

Fixed submission:
a,b = map(int,input().split())
if a > 2*b:
  print(a-2*b)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
h = list(map(int,input().split()))
x = 0
for i in n:
  if h[i-1]>=k:
    x += 1
print(x)

Fixed submission:
n,k = map(int,input().split())
h = list(map(int,input().split()))
x = 0
for i in range(n):
  if h[i-1]>=k:
    x += 1
print(x)
Buggy python submission (verdict: Runtime Error):
N = input()
P = N**3
print(P)

Fixed submission:
print(int(input())**3)

Buggy python submission (verdict: Runtime Error):
print(input()**3)

Fixed submission:
print(int(input())**3)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [map(int,input().split())]
B = [map(int,input().split())]
C = [map(int,input().split())]
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [map(int,input().split())]
B = [map(int,input().split())]
C = [map(int,input().split())]
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[i])
print(sum(B))

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))

Buggy python submission (verdict: Runtime Error):
B = 0
N = int(input())
A = (int(input()) for i in range(N))
for i in range(N):
  B += int(input())
C = (int(input()) for i in range(N-1))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B += C[i]
print(B)


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))

Buggy python submission (verdict: Runtime Error):
B = 0
N = int(input())
A = (int(input()) for i in range(N))
for i in range(N):
  B += input()
C = (int(input()) for i in range(N-1))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B += C[i]
print(B)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = []
B = 0
C = []
for i in range(N):
  A[i] = int(input())
for i in range(N):
  B += int(input())
for i in range(N-1):
  C[i] = int(input())
for i in range(N-1):
  if A[i] +1 == A[i+1]:
    B += C[i]
print(B)


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(N-1):
  if A[i]+1 == A[i+1]:
    B.append(C[A[i]-1])
print(sum(B))
Buggy python submission (verdict: Runtime Error):
N = int(input())
B = list(map(int,input.split()))
A = sum(B)*2
for i in range(N-1):
  if B[i] <= B[i+1]:
    A -= B[i+1]
  else:
    A -= B[i]
print(A)

Fixed submission:
N = int(input())
B = list(map(int,input().split()))
A = sum(B)*2
for i in range(N-2):
  if B[i] <= B[i+1]:
    A -= B[i+1]
  else:
    A -= B[i]
print(A)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
x = 0
for i in 3:
  x += s[i-1]!=t[i-1]
print(x)

Fixed submission:
s = input()
t = input()
x = 0
for i in range(3):
  x += s[i-1]==t[i-1]
print(x)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(1/(int,input().split())))
print(1/sum(a))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a = [1/a[i] for i in range(n)]
print(1/sum(a))
Buggy python submission (verdict: Runtime Error):
a,b = open(0)
print(max( [a+b, a-b, a*b]))

Fixed submission:
a,b = map(int,input().split())
print(max([a+b,a-b,a*b]))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(b+c-a,0)[b+c-a<=0:]

Fixed submission:
a,b,c = map(int,input().split())
print(max(0,b+c-a))
Buggy python submission (verdict: Time Limit Exceeded):
def solve():
    s = input()
    q = int(input())
    for i in range(q):
        a = input().split()
        if a[0] == '1':
            s = s[::-1]
        else:
            if a[1] == '2':
                s = s + a[2]
            else:
                s = a[2] + s
    print(s)
solve()


Fixed submission:
def solve():
    s1 = input()
    s2 = ''
    q = int(input())
    flg = 0
    for i in range(q):
        a = input().split()
        if a[0] == '1':
            flg = 1 - flg
        else:
            if flg == 0 and a[1] == '2' or flg == 1 and a[1] == '1':
                s1 += a[2]
            else:
                s2 += a[2]
    if flg == 0:
        print(s2[::-1] + s1)
    else:
        print(s1[::-1] + s2)
solve()
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):
m1,d1 = map(int,input().aplit())
m2,d2= map(int,input().split())
if m1!=m2:
  print(1)
else:
  print(0)

Fixed submission:
m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
if m1!=m2:
  print(1)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
m1,d1 = map(int,input().aplit())
m2,d2= map(int,input().split())
if m1!=m2:print(1)
else: print(0)

Fixed submission:
m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
if m1!=m2:
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
from bisect import bisect

#Aのなかでlより大きな最小の値を得る.Aはソート済み

s = input()
t = input()
a = 'abcdefghijklmnopqrstuvwxyz'
d = {}
for ch in a:
  d[ch] = []
for ch,n in zip(s,range(len(s))):
  d[ch].append(n)

rep = 0
p = -1
for ch in t:
  if len(d[ch])==0:
    print("-1")
    exit()
  else:
    i = bisect(d[ch],p)
    if i!=len(d[ch]):p=d[ch][i]
    else:
      p = d[ch][0]
      rep+=1
for i in range(1,len(t)):
  if ret[i] < ret[i-1]:rep+=1

e = len(s) - ret[-1]

print(len(s)*rep - e + 1)

Fixed submission:
from bisect import bisect

#Aのなかでlより大きな最小の値を得る.Aはソート済み

s = input()
t = input()
a = 'abcdefghijklmnopqrstuvwxyz'
d = {}
for ch in a:
  d[ch] = []
for ch,n in zip(s,range(len(s))):
  d[ch].append(n)

rep = 0
p = -1
for ch in t:
  if len(d[ch])==0:
    print("-1")
    exit()
  else:
    i = bisect(d[ch],p)
    if i!=len(d[ch]):p=d[ch][i]
    else:
      p = d[ch][0]
      rep+=1

print(len(s)*rep + p + 1)
Buggy python submission (verdict: Runtime Error):
a,b = map(int(input().split()))
print(max(a+b,a-b,a*b))

Fixed submission:
fs= [int(f) for f in input().split()]
a,b = fs[0],fs[1]
print(max(a+b,a*b,a-b))