Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math
N, M = map(int, input().split())
sqrt = int(math.sqrt(M)) + 1
ans = 0
for i in range(1, sqrt):
    if M % i == 0:
        if ans < i <= M//N:
            ans = i
        if ans < M//i <= M//N:
            ans = M//i
print(ans)


Fixed submission:
N = int(input())
lst = [list(map(int, input().split())) for _ in range(N)]

for cx in range(101):
    for cy in range(101):
        for l in lst:
            if l[2] != 0:
                H = abs(cx-l[0]) + abs(cy-l[1]) + l[2]
        for l in lst:
            if l[2] != max(0, H - abs(cx-l[0]) - abs(cy-l[1])):
                break
        else:
            print(cx, cy, H)
            exit(0)

Buggy python submission (verdict: Runtime Error):
N = int(input())
ls = []
for _ in range(N):
    ls.append(list(map(int, input().split())))

for cx in range(101):
    for cy in range(101):
        n = -1
        for l in ls:
            if l[2] != 0:
                if n == -1:
                    H = abs(cx - l[0]) + abs(cy - l[1]) + l[2]
                    n += 1
                if abs(cx-l[0])+abs(cy-l[1])+l[2] != H:
                    break
        else:
            print(cx, cy, H)
            exit(1)


Fixed submission:
N = int(input())
lst = [list(map(int, input().split())) for _ in range(N)]

for cx in range(101):
    for cy in range(101):
        for l in lst:
            if l[2] != 0:
                H = abs(cx-l[0]) + abs(cy-l[1]) + l[2]
        for l in lst:
            if l[2] != max(0, H - abs(cx-l[0]) - abs(cy-l[1])):
                break
        else:
            print(cx, cy, H)
            exit(0)

Buggy python submission (verdict: Runtime Error):
N = int(input())
ls = []
for _ in range(N):
    ls.append(list(map(int, input().split())))

for cx in range(101):
    for cy in range(101):
        n = -1
        for l in ls:
            if l[2] != 0:
                if n == -1:
                    H = abs(cx - l[0]) + abs(cy - l[1]) + l[2]
                    n += 1
                if abs(cx-l[0])+abs(cy-l[1])+l[2] != H:
                    break
        else:
            print(cx, cy, H)
            exit(1)


Fixed submission:
N = int(input())
lst = [list(map(int, input().split())) for _ in range(N)]

for cx in range(101):
    for cy in range(101):
        for l in lst:
            if l[2] != 0:
                H = abs(cx-l[0]) + abs(cy-l[1]) + l[2]
        for l in lst:
            if l[2] != max(0, H - abs(cx-l[0]) - abs(cy-l[1])):
                break
        else:
            print(cx, cy, H)
            exit(0)
Buggy python submission (verdict: Time Limit Exceeded):
N, C = map(int, input().split())
D = [list(map(int, input().split())) for _ in range(C)]
G = [list(map(int, input().split())) for _ in range(N)]

cost = [[0]*C for _ in range(3)]
for i in range(C):
    for a in range(N):
        for b in range(N):
            cost[(a+b)%3][i] += D[G[a][b]-1][i]

ans = 10**10
for i in range(C):
    for j in range(C):
        for k in range(C):
            if i == j or j == k or k == i:
                pass
            else:
                ans = min(ans, cost[0][i] + cost[1][j] + cost[2][k])

print(ans)


Fixed submission:
N, C = map(int, input().split())
D = [list(map(int, input().split())) for _ in range(C)]
G = [list(map(int, input().split())) for _ in range(N)]

cost = [[0]*C for _ in range(3)]
for i in range(C):
    for a in range(N):
        for b in range(N):
            cost[(a+b)%3][i] += D[G[a][b]-1][i]

ans = 10**10
for i in range(C):
    for j in range(C):
        for k in range(C):
            if i == j or j == k or k == i:
                pass
            else:
                ans = min(ans, cost[0][i] + cost[1][j] + cost[2][k])

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(n-1):
    t = a[i] + a[i+1]
    s = int(a[i] ^ a[i+1])
    while t == s:
        ans += 1
        if i == n-2:
            break
        i += 1
        t = t + a[i+1]
        s = int(s ^ a[i+1])
print(ans+n)


Fixed submission:
n = int(input())
A = list(map(int, input().split()))

l = 0
r = 0
ans = 0
sum = A[0]
xor = A[0]
while True:
    if sum == xor:
        ans += r-l+1
        if r == n-1:
            break
        r += 1
        sum += A[r]
        xor ^= A[r]
    else:
        sum -= A[l]
        xor ^= A[l]
        if l == n-1:
            break
        l += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
raw_input = input()
length = len(raw_input)
input_number = int(raw_input)
count = 0

top_lane = input().split()
mid_lane = input().split()
bot_lane = input().split()

for i in range(input_number):
    top_lane[i] = int(top_lane[i])
    mid_lane[i] = int(mid_lane[i])
    bot_lane[i] = int(bot_lane[i])

top_lane.sort()
mid_lane.sort()
bot_lane.sort()

for i in range(input_number):
    top = top_lane[i]
    for j in range(input_number):
        mid = mid_lane[len(mid_lane) - j - 1]
        if top < mid:
            for k in range(input_number):
                bot = bot_lane[len(bot_lane) - k - 1]
                if mid < bot:
                    count += 1
                else:
                    break
        else:
            break

print(count)


Fixed submission:
import bisect

raw_input = input()
input_number = int(raw_input)
counts = 0

top_lane = input().split()
mid_lane = input().split()
bot_lane = input().split()

for i in range(input_number):
    top_lane[i] = int(top_lane[i])
    mid_lane[i] = int(mid_lane[i])
    bot_lane[i] = int(bot_lane[i])

top_lane.sort()
mid_lane.sort()
bot_lane.sort()

for mid in mid_lane:
    top_index = bisect.bisect_left(top_lane, mid)
    bot_index = input_number - bisect.bisect_right(bot_lane, mid)
    counts += top_index * bot_index

print(counts)

Buggy python submission (verdict: Time Limit Exceeded):
raw_input = input()
length = len(raw_input)
input_number = int(raw_input)
count = 0

top_lane = input().split()
mid_lane = input().split()
bot_lane = input().split()

for i in range(input_number):
    top_lane[i] = int(top_lane[i])
    mid_lane[i] = int(mid_lane[i])
    bot_lane[i] = int(bot_lane[i])

for i in range(input_number):
    top = top_lane[i]
    for j in range(input_number):
        mid = mid_lane[j]
        for k in range(input_number):
            bot = bot_lane[k]
            if top < mid < bot:
                count += 1

print(count)

Fixed submission:
import bisect

raw_input = input()
input_number = int(raw_input)
counts = 0

top_lane = input().split()
mid_lane = input().split()
bot_lane = input().split()

for i in range(input_number):
    top_lane[i] = int(top_lane[i])
    mid_lane[i] = int(mid_lane[i])
    bot_lane[i] = int(bot_lane[i])

top_lane.sort()
mid_lane.sort()
bot_lane.sort()

for mid in mid_lane:
    top_index = bisect.bisect_left(top_lane, mid)
    bot_index = input_number - bisect.bisect_right(bot_lane, mid)
    counts += top_index * bot_index

print(counts)
Buggy python submission (verdict: Runtime Error):
N = int(input())
D = [0]*100

count = 0

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

for k in D:
    m = max(D)
    D.remove(max(D))
    count += 1
    if max(D) == 0:
        break
    while m == max(D):
        D.remove(max(D))
    if max(D) == 0:
        break

print("{}".format(count))

Fixed submission:
S = str(input())

print(S.replace(S[0:4],"2018"))
Buggy python submission (verdict: Runtime Error):
import math
a, b, c, d = map(int, input().split())

large_c = b // c
large_d = b // d
large_cd = b // ((c * d) / math.gcd(c, d))
large = large_c + large_d - large_cd

small_c = (a - 1) // c
small_d = (a - 1) // d
small_cd = (a - 1) // ((c * d) / math.gcd(c, d))
small = small_c + small_d - small_cd

print(int((b - (a - 1)) - (large - small)))


Fixed submission:

a, b, c, d = map(int, input().split())

def gcd (a, b):
    while b != 0:
        a, b = b, a % b
    return a
gcd = gcd(c, d)

large_c = b // c
large_d = b // d
large_cd = b // ((c * d) // gcd)
large = large_c + large_d - large_cd

small_c = (a - 1) // c
small_d = (a - 1) // d
small_cd = (a - 1) // ((c * d) // gcd)
small = small_c + small_d - small_cd

print(int((b - (a - 1)) - (large - small)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
t, a = map(int,input().split())
h = list(map(int,input().split()))

counter = 0
diff = abs(a - (t - h[0] * 0.006))

for x in h:
    average_temple = t - x * 0.006
    counter += 1
    if diff > abs(a - average_temple):
        poss = counter

print(poss)

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

atlist = []
for i in h:
    atlist.append(abs(a - (t - i * 0.006)))

print(atlist.index(min(atlist)) + 1)
Buggy python submission (verdict: Time Limit Exceeded):
s = list(input())

a_index_list = [i for i, v in enumerate(s) if v == min(s)]
z_index_list = [i for i, v in enumerate(s) if v == max(s)]

print(z_index_list[-1] - a_index_list[0] + 1)

Fixed submission:
s = input()

first_A_find = s.find("A")
end_Z_find = s.rfind("Z") + 1

print(end_Z_find - first_A_find)

Buggy python submission (verdict: Time Limit Exceeded):
s = list(input())

a_index_list = [i for i, v in enumerate(s) if v == min(s)]
z_index_list = [i for i, v in enumerate(s) if v == max(s)]

print(z_index_list[-1] - a_index_list[0] + 1)

Fixed submission:
s = input()

first_A_find = s.find("A")
end_Z_find = s.rfind("Z") + 1

print(end_Z_find - first_A_find)
Buggy python submission (verdict: Runtime Error):
n, k = map(int,input().split())
print(min(n%k, abs(n%k-k))

Fixed submission:
n, k = map(int,input().split())

print(min(n%k, abs(n%k-k)))
Buggy python submission (verdict: Runtime Error):
import math

n, d = map(int, input().split())
x = [list(map(int, input().split())) for i in range(n)]
cnt = 0
for i in range(n):
    for j in range(i+1, n):
        dis = 0
        for k in range(d):
            dis += (x[i][k]-x[j][k])**2
        if math.sqrt(dis) % 1 == 0:
            cnt += 1
print(cnt)

Fixed submission:
a,b,c = map(int, input().split())
if a*b <= c:
    print(a*b)
else:
    print(c)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if a*b <= c:
    print(a*b)
    else:
        print(c)

Fixed submission:
a,b,c = map(int, input().split())
if a*b <= c:
    print(a*b)
else:
    print(c)

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
s = a*b
if s <= c:
    print("{}".format(s))
   else:
       print("{}".format(c))

Fixed submission:
a,b,c = map(int, input().split())
if a*b <= c:
    print(a*b)
else:
    print(c)
Buggy python submission (verdict: Runtime Error):
import math

n, d = map(int, input().split())
x = [list(int, input().split()) for i in range(n)]
cnt = 0
for i in range(n):
    for j in range(i+1, n):
        for k in range(d):
            dis = 0
            dis += (x[i][k]-x[j][k])**2
            if math.sqrt(dis) % 1 == 0:
                cnt += 1
print(cnt)

Fixed submission:
import math

n, d = map(int, input().split())
x = [list(map(int, input().split())) for i in range(n)]
cnt = 0
for i in range(n):
    for j in range(i+1, n):
        dis = 0
        for k in range(d):
            dis += (x[i][k]-x[j][k])**2
        if math.sqrt(dis) % 1 == 0:
            cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = int(a*b)

if(c%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):
a, b = map(int, input().split())
c = int(a*b)

if(c%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):
a = int(input().split)

c = int(a*b)

if(c%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):
a = int(input().split)

c = a*b

if(c%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):
a = int(input())
b = int(input())

c = a*b

if(c%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):
N = input()
A = list(map(int, input().split()))

cnt = 0
while True: 
    odd_flag = False
    for i in range(N):
        if A[i] % 2 == 1:
            odd_flag = True
    if odd_flag:
        break
    for i in range(N):
        A[i] = A[i] // 2
    cnt += 1

print(cnt)


Fixed submission:
N = int(input())
A = list(map(int, input().split()))

cnt = 0
while True: 
    odd_flag = False
    for i in range(N):
        if A[i] % 2 == 1:
            odd_flag = True
    if odd_flag:
        break
    for i in range(N):
        A[i] = A[i] // 2
    cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))

cnt = 0
while True: 
    odd_flag = False
    for i in range(N):
        if A[i] % 2 == 1:
            odd_flag = True
    if odd_flag:
        break
    for i in range(N):
        A[i] = A[i] // 2
    cnt += 1

print(cnt)

Fixed submission:
N = int(input())
cnt_max = 0

for i in range(N):
    num = i+1
    cnt = 0
    while True :
        if num % 2 == 0:
            cnt += 1
            num /= 2
        else:
            break
    if cnt_max < cnt:
        cnt_max = cnt

print(2**cnt_max)
Buggy python submission (verdict: Runtime Error):
to = list(input())
counter = 0

if to[0] == "o":
  counter += 1
if to[1] == "o":
  counter += 1:
if to[2] == "o":
  counter += 1:
    
price = 700 + 100 * int(counter)

print(price)

Fixed submission:
to = list(input())
counter = 0

if to[0] == "o":
  counter += 1
if to[1] == "o":
  counter += 1
if to[2] == "o":
  counter += 1
    
price = 700 + 100 * int(counter)

print(price)
Buggy python submission (verdict: Runtime Error):
a,b,c,x = map(int,open(0).read().split())

ans = 0 
counta = 0

for i in range(a+1):
  for j in range(b+1):
    for k in range(c+1):
      ans = ((i*500 + (j*100 + (k*50)
      if ans == x:
        counta += 1
      else:
        pass
      
print(counta)


Fixed submission:
a,b,c,x = map(int,open(0).read().split())

ans = 0 
counta = 0

for i in range(a+1):
  for j in range(b+1):
    for k in range(c+1):
      ans = ((i*500) + (j*100) + (k*50))
      if ans == x:
        counta += 1
      else:
        pass
      
print(counta)
Buggy python submission (verdict: Runtime Error):
a,b,c=list(int,input().split())
if  (a+b)>=c:
    print("Yes")
else:
    print("No")

Fixed submission:
a,b,c=map(int,input().split())
if  (a+b)>=c:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
a,b,c=[int(input()) for i in range(3)]
if  (a+b)>=c:
    print("Yes")
else:
    print("No")

Fixed submission:
a,b,c=map(int,input().split())
if  (a+b)>=c:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a,b,c=[input() for i range(3)]
print(a[0]+b[1]+c[2])

Fixed submission:
a,b,c=[input() for i in range(3)]
print(a[0]+b[1]+c[2])

Buggy python submission (verdict: Runtime Error):
a,b,c=list(input().split())
print(a[0]+b[1]+c[2])

Fixed submission:
a,b,c=[input() for i in range(3)]
print(a[0]+b[1]+c[2])
Buggy python submission (verdict: Runtime Error):
n,a=[int(input())for i range(2)]
b=n%500
if a>=b:
    print("Yes")
else:
    print("No")

Fixed submission:
n,a=[int(input()) for i in range(2)]
b=n%500
if a>=b:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n,a=map(int,input().split())
b=n%500
if a>=b:
    print("Yes")
else:
    print("No")

Fixed submission:
n,a=[int(input()) for i in range(2)]
b=n%500
if a>=b:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
x,a,b=[int(input())for i in range(3)
c=int(x-a)
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=[int(input()) for i range(3)]
c=int(x-a)
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=[int(input()) for i range(3)]
c=x-a
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=[int, input for i range(3)]
c=x-a
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=map(int,input().split())
c=x-a
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=map(int,input().split())
c=int(x-a)
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=list(int,input().split())
c=x-a
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)

Buggy python submission (verdict: Runtime Error):
x,a,b=map(int,input().split())
c=x-a
print(c%b)

Fixed submission:
x,a,b=[int(input()) for i in range(3)]
c=x-a
print(c%b)
Buggy python submission (verdict: Runtime Error):
import math
a=int(input())
b=int(input())
c=(a+b)/2
print(math.ceil(c))

Fixed submission:
import math
a,b=map(int,input().split())
c=(a+b)/2
print(math.ceil(c))

Buggy python submission (verdict: Runtime Error):
import math
a=int(input())
b=int(input())
c=(a+b)/2
print(math.ceil(c))

Fixed submission:
import math
a,b=map(int,input().split())
c=(a+b)/2
print(math.ceil(c))
Buggy python submission (verdict: Runtime Error):
X=input()
Y=input()
if X>Y:
  print('>')
elif X<Y:
  print('<')
else:
  print('=')

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Buggy python submission (verdict: Runtime Error):
X=input()
Y=input()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Buggy python submission (verdict: Runtime Error):
X=int(input(),16)
Y=int(input(),16)
if X>Y:
  print('>')
elif X<Y:
  print('<')
else:
  print('=')

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Buggy python submission (verdict: Runtime Error):
X=int(input(),16)
Y=int(input(),16)
if X>Y:
    print('>')
elif X<Y:
    print('<')
else:
    print('=')

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Buggy python submission (verdict: Runtime Error):
X=int(input(),16)
Y=int(input(),16)
if X>Y:
 print(">")
elif X<Y:
 print("<")
else:
 print("=")

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Buggy python submission (verdict: Runtime Error):
X=int(input(),16)
Y=int(input(),16)
if X>Y:
  print(">")
elif X<Y:
  print("<")
else:
  print("=")

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Buggy python submission (verdict: Runtime Error):
X=int(input(),16)
Y=int(input(),16)
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")

Fixed submission:
X,Y=input().split()
if X>Y:
    print(">")
elif X<Y:
    print("<")
else:
    print("=")
Buggy python submission (verdict: Runtime Error):
r,g=list(map(int,input().split()))
print(2*g-r)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
r,g=map(int,input().split())
print(2*g-r)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R, G= map(int,input().split())
print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R,G= map(int,input().split())
print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R, G=map(int,input().split())
print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R,G=map(int,input().split())
  print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
  R,G=map(int,input().split())
  print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R,G=map(int,input().split())
print(G*2-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R,G=map(int,input().split())
print((2*G)-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

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

print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)

Buggy python submission (verdict: Runtime Error):
R,G=map(int,input().split())
print(2*G-R)

Fixed submission:
r=int(input())
g=int(input())
print(2*g-r)
Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
if a==b:
  print(int(c))
elif a==c:
  print(int(b))
elif b==c:
  print(int(a))

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
  print(a)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
 
if a == b:
  print(int(c))
elif a == c:
  print(int(b))
elif b == c:
  print(int(a))

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
  print(a)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
if a == b:
 print(int(c))
elif a == c:
 print(int(b))
elif b == c:
 print(int(a))

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
  print(a)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()

if a == b:
    print(int(c))
elif a == c:
    print(int(b))
elif b == c:
    print(int(a))

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
  print(a)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
if a == b:
    print(int(c))
elif a == c:
    print(int(b))
elif b == c:
    print(int(a))

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
  print(a)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
c=input()
s1=set(a)
s2=set(b)
s3=set(c)
if s1&s2:
    print(s3)
elif s1&s3:
    print(s2)
elif s2&s3:
    print(s1)

Fixed submission:
a,b,c=map(int,input().split())
if a==b:
    print(c)
elif b==c:
  print(a)
else:
  print(b)
Buggy python submission (verdict: Runtime Error):
if input().find("9")>-1:
  print("Yes")
  else:
    print("No")


Fixed submission:
if input().find('9')>-1:
  print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
if input().find('9')>-1:
  print("Yes")
  else:
    print("No")


Fixed submission:
if input().find('9')>-1:
  print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
if input().find("9")>-1:
  print("Yes")
 else:
    print("No")


Fixed submission:
if input().find('9')>-1:
  print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
if input().find("9")>-1:
  print("Yes")
  else:
    print("No")

Fixed submission:
if input().find('9')>-1:
  print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
W = 0
for i in range(len(S)):
    if S[i] != T[i]:
        w += 1
print(W)

Fixed submission:
S = input()
T = input()
W = 0
for i in range(len(S)):
    if S[i] != T[i]:
        W += 1
print(W)