Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

N = int(input())

As = list(map(int, input().split()))
Bs = list(map(int, input().split()))
Cs = list(map(int, input().split()))

As.sort()
Bs.sort()
Cs.sort()

ans = 0
for a in As:
    for b in Bs:
        if a >= b:
            continue
        for c in Cs:
            if b >= c:
                continue
            #print(a,b,c)
            ans += 1

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-
import bisect
N = int(input())

As = list(map(int, input().split()))
Bs = list(map(int, input().split()))
Cs = list(map(int, input().split()))

As.sort()
Bs.sort()
Cs.sort()

ans = 0
# for a in As:
#     for b in Bs:
#         if a >= b:
#             continue
#         for c in Cs:
#             if b >= c:
#                 continue
#             #print(a,b,c)
#             ans += 1
#
# print(ans)

Bcnt = [0 for i in range(N)]
i = 0
for b in Bs:
    cnt = N - bisect.bisect_right(Cs, b)
    # print(b, cnt)
    Bcnt[i] = cnt
    i += 1

Bsum = [0 for i in range(N)]
Bsum[N-1] = Bcnt[N-1]
for i in range(N-2, -1, -1):
    Bsum[i] = Bsum[i+1] + Bcnt[i]
    # print(i, Bsum)

for a in As:
    cnt = bisect.bisect_right(Bs, a)
    if cnt == N:
        ans += 0
    else:
        ans += Bsum[cnt]

# print(Bcnt)
# print(Bsum)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

K = int(input())

N = 50
As = [N-1 for _ in range(N)]
ind = 0

for k in range(K):
    for i in range(N):
        As[i] -= 1
    As[ind] += N + 1
    ind += 1
    ind = ind % N
print(N)
print(*As)


Fixed submission:
# -*- coding: utf-8 -*-
import math
K = int(input())

N = 50
As = [N-1 for _ in range(N)]
ind = 0

modk = K % 50
L = K // 50
base = 49 + L - modk

ans = []

if modk != 0:
    for i in range(N):
        if i >= N - modk:
            ans.append(base + N + 1)
        else:
            ans.append(base)
    # for i in range(0,modk,1):
    #     ans.append(base + N + 1)
    # for i in range(modk,N,1):
    #     ans.append(base)
else:
    for i in range(N):
        ans.append(49 + L)
# for k in range(K):
#     for i in range(N):
#         As[i] -= 1
#     As[ind] += N + 1
#     ind += 1
#     ind = ind % N
# print(N)
# print(*As)
print(N)
print(*ans)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a=int(input())
b=int(input())
c=int(input())

if 7 == a:
    if 5 == b and 5 == c:
        print("YES", end="\n")
elif 5 == a:
    if (7 == b and 5 == c) or (5 == b and 7 == c):
        print("YES", end="\n")
else:
    print("NO", end="\n")

Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a = list(map(int, input().split()))

if 7 == a[0]:
    if 5 == a[1] and 5 == a[2]:
        print("YES", end="\n")
    else:
        print("NO", end="\n")   

elif 5 == a[0]:
    if (7 == a[1] and 5 == a[2]) or (5 == a[1] and 7 == a[2]):
        print("YES", end="\n")
    else:
        print("NO", end="\n")   
else:
    print("NO", end="\n")

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a=int(input())
b=int(input())
c=int(input())

if 7 == a:
    if 5 == b and 5 == c:
        print("YES", end="\n")
elif 5 == a:
    if (7 == b and 5 == c) or (5 == b and 7 == c):
        print("YES", end="\n")
else:
    print("NO", end="\n")

Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a = list(map(int, input().split()))

if 7 == a[0]:
    if 5 == a[1] and 5 == a[2]:
        print("YES", end="\n")
    else:
        print("NO", end="\n")   

elif 5 == a[0]:
    if (7 == a[1] and 5 == a[2]) or (5 == a[1] and 7 == a[2]):
        print("YES", end="\n")
    else:
        print("NO", end="\n")   
else:
    print("NO", end="\n")

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a=int(input())
b=int(input())
c=int(input())

if 7 == a:
    if 5 == b and 5 == c:
        print("YES")
elif 5 == a:
    if (7 == b and 5 == c) or (5 == b and 7 == c):
        print("YES")
else:
    print("NO")

Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a = list(map(int, input().split()))

if 7 == a[0]:
    if 5 == a[1] and 5 == a[2]:
        print("YES", end="\n")
    else:
        print("NO", end="\n")   

elif 5 == a[0]:
    if (7 == a[1] and 5 == a[2]) or (5 == a[1] and 7 == a[2]):
        print("YES", end="\n")
    else:
        print("NO", end="\n")   
else:
    print("NO", end="\n")

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a=int(input())
b=int(input())
c=int(input())

if 7 == a:
    if 5 == b and 5 == c:
        print("Yes")
elif 5 == a:
    if (7 == b and 5 == c) or (5 == b and 7 == c):
        print("Yes")
else:
    print("No")

Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

a = list(map(int, input().split()))

if 7 == a[0]:
    if 5 == a[1] and 5 == a[2]:
        print("YES", end="\n")
    else:
        print("NO", end="\n")   

elif 5 == a[0]:
    if (7 == a[1] and 5 == a[2]) or (5 == a[1] and 7 == a[2]):
        print("YES", end="\n")
    else:
        print("NO", end="\n")   
else:
    print("NO", end="\n")
Buggy python submission (verdict: Runtime Error):
S = input()

import math
N = len(S)
for i in range(math.ceil(N/2), N):
    if S[N-i:i] == '0'*(i-(N-i)) or S[N-i:i] == '1'*(i-(N-i)):
        K = i
print(K)


Fixed submission:
S = input()

N = len(S)
K = N
for i in range(1, N):
    if S[i-1] != S[i]:
        K = min(K, max(i, N-i))
print(K)
Buggy python submission (verdict: Runtime Error):
s = input()
x, y = map(int, input().split())


def part_sum0(integer_list, target_sum,  i=0, sum_=0):
    if i == len(integer_list):
        return sum_ == target_sum
    if (part_sum0(integer_list, target_sum, i + 1, sum_)):
        return True
    if (part_sum0(integer_list, target_sum, i + 1, sum_ + integer_list[i])):
        return True
    return False


fs = s.split('T')
f_num = [len(f) for f in fs]
dir_lst = [[], []]
for i in range(len(f_num)):
    dir_lst[i % 2].append(f_num[i])
x_lst = dir_lst[0]
y_lst = dir_lst[1]

can_x = False
can_y = False

dx = abs(sum(x_lst)) - abs(x)
if (dx % 2 == 1) or (dx < 0):
    pass
elif dx == 0:
    can_x = True
else:
    if part_sum0(x_lst, dx // 2):
        can_x = True

if can_x:
    dy = abs(sum(y_lst)) - abs(y)
    if (dy % 2 == 1) or (dy < 0):
        pass
    elif dy == 0:
        can_y = True
    else:
        if part_sum0(y_lst, dy // 2):
            can_y = True

if can_y:
    print('Yes')
else:
    print('No')


Fixed submission:
s = input()
x, y = map(int, input().split())

fs = s.split('T')
f_num = [len(f) for f in fs]
dir_lst = [[], []]
for i in range(len(f_num)):
    dir_lst[i % 2].append(f_num[i])
x_lst = dir_lst[0]
x -= x_lst[0]
x_lst = x_lst[1:]
y_lst = dir_lst[1]

can_x = False
can_y = False

s = set([0])
for x_ in x_lst:
    s_ = set()
    for e in s:
        s_.add(e+x_)
        s_.add(e-x_)
    s = s_
if x in s:
    can_x = True

s = set([0])
for y_ in y_lst:
    s_ = set()
    for e in s:
        s_.add(e+y_)
        s_.add(e-y_)
    s = s_
if y in s:
    can_y = True

if can_x and can_y:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().Split())
print(a+b if a+b<10 else "error") 

Fixed submission:
a,b = map(int, input().split())
print(a+b if a+b<10 else "error")

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

if (a + b) >= 10:
  print("error)
else:
  print(a + b)

Fixed submission:
a,b = map(int, input().split())
print(a+b if a+b<10 else "error")
Buggy python submission (verdict: Runtime Error):
    a, b = [int(i) for i in input().split()]

    if (a*b) & 1:
        print('Odd')
    else :
        print('Even')

Fixed submission:
a, b = [int(i) for i in input().split()]

if (a*b)%2 == 0 :
    print ("Even")
else:
    print ("Odd")
Buggy python submission (verdict: Runtime Error):
n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]

total = 0
fugo = 0
count = 0

for i in a:
    total += i

    if(fugo == 0):
        total = i
        if(total > 0):
            fugo = 1
        else:
            fugo = -1
        continue
    elif(fugo > 0):
        fugo = -1
        if(total >= 0):
            while(total>=0):
                count += 1
                total -= 1
    elif(fugo < 0):
        fugo = 1
        if(total <= 0):
            while(total<=0):
                count += 1
                total += 1

print(count)


Fixed submission:
S = [i.upper() for i in input().split()]

TLA = ''
for i  in S:
    s = list(i)
    TLA += s[0]

print(TLA)
Buggy python submission (verdict: Runtime Error):
O = [i for i in input()]
E = [i for i in input()]
psw = ''

for i in range(len(E)):
    psw += O[i] + E[i]

if len(O) > len(E):
    psw += O[-1]


print(psw）

Fixed submission:
O = [i for i in input()]
E = [i for i in input()]
psw = ''

for i in range(len(E)):
    psw += O[i] + E[i]

if len(O) > len(E):
    psw += O[-1]


print(psw)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

power = 1
#power = float(power)

for i in range(N):
    power = power * (i + 1)

power = power % (1000000000+7)
print(power)


Fixed submission:
N = int(input())
power = 1
for i in range(N):
    power = (i+1) * (power % 1000000007)

print(power%1000000007)
Buggy python submission (verdict: Runtime Error):
import sys
N, M = [int(i) for i in input().split()]

A = [[i for i in input()] for j in range(N)]
B = [[i for i in input()] for k in range(M)]

for i in range(N-M):
        for j in range(N-M):
            diff = 0

            for k in range(M):
                for l in range(M):
                    if A[i+k][j+l] != B[k][l]:
                        diff = 1
                        break

                if diff == 1:
                    break

            if diff == 0:
                print('Yes')
                sys.exit()


print('No')


Fixed submission:
A , B = [int(i) for i in input().split()]

if A == B:
    print('Draw')
elif A == 1 or B == 1:
    if B != 1:
        print('Alice')
    else:
        print('Bob')
else:
    if A > B:
        print('Alice')
    else:
        print('Bob')
Buggy python submission (verdict: Time Limit Exceeded):
K, S = [int(i) for i in input().split()]

count = 0

for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if x + y + z == S:
                count += 1

print(count)


Fixed submission:
K, S = [int(i) for i in input().split()]

count = 0
m = K + 1


for x in range(m):
    for y in range(m):
        z = S - x - y
        if 0 <= z <= K:
            count += 1

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
from time import sleep
 
x = int(input())
a = int(input())
b = int(input())
 
ans = (x-a)%b
 
sleep(x * 0.001)

print(ans)


Fixed submission:
from time import sleep

x = int(input())
a = int(input())
b = int(input())

ans = (x - a) % b

sleep(0)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
from time import sleep

x = int(input())
a = int(input())
b = int(input())

ans = (x - a) % b

sleep(x * 0.001)

print(ans)

Fixed submission:
from time import sleep

x = int(input())
a = int(input())
b = int(input())

ans = (x - a) % b

sleep(0)

print(ans)
Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    # n = 100
    # n = 9995
    # n = 3141592653589793
    n = input()

    ary = list(map(int, list(str(n))))

    # x..xxの全探索
    m = -1
    middle = [9 for i in range(0, len(ary[1:-2]))] # 数列の真ん中
    for i in range(0, 10):
        for j in range(0, 10):
            for k in range(0, 10):
                if m < sum([i] + middle + [j, k]) and int(''.join(map(str, [i] + middle + [j, k]))) <= n:
                    m = sum([i] + middle + [j, k])
    print(m)

Fixed submission:
import sys

if __name__ == '__main__':
    # n = 100
    # n = 9995
    # n = 3141592653589793
    n = input()

    ary = list(map(int, list(str(n))))

    # ひと桁のときの対応
    if len(ary) == 1:
       print(sum(ary))
       sys.exit()

    # ふた桁のときの対応
    if len(ary) == 2:
        if sum(ary) <= 9:
            print(9)
            sys.exit()
        else:
            print(sum(ary))
            sys.exit()

    # すでに9が並んでたら上位を減らさない
    if ary[1:-1].count(9) != len(ary[1:-1]):
        ary[0] = ary[0] - 1
        ary[-2] = 9
        ary[-1] = 9

    # 真ん中はすべて9にする
    ary[1:-1] = [9 for i in range(0, len(ary[1:-1]))]

    # 下位が99 or 98でなかったら下位を89にする
    if sum(ary[-2:]) < 18:
        ary[-2] = 8
        ary[-1] = 9

    # print(ary)
    print(sum(ary))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = 1
for i in range(1, n + 1):
    p *= i
print(p % (10 ** 9 + 7))

Fixed submission:
n = int(input())
p = 1
for i in range(1, n + 1):
    p = i * p % (10 ** 9 + 7)
print(p)
Buggy python submission (verdict: Runtime Error):
n = list(map(int, input().split))

a = n[0]
b = n[1]

if a == b:
    print("Draw")
elif a == 1:
    print("Alice")
elif b == 1:
    print("Bob")
elif a > b:
    print("Alice")
elif b > a:
    print("Bob")

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

a = n[0]
b = n[1]

if a == b:
    print("Draw")
elif a == 1:
    print("Alice")
elif b == 1:
    print("Bob")
elif a > b:
    print("Alice")
elif b > a:
    print("Bob")
Buggy python submission (verdict: Time Limit Exceeded):
k, s = list(map(int, input().split()))
count = 0
for x in range(0, k + 1):
    for y in range(0, k + 1):
        for z in range(0, k + 1):
            if (x + y + z == s):
                count+=1
print(count)


Fixed submission:
k, s = list(map(int, input().split()))
count = 0
for x in range(0, k + 1):
    for y in range(0, k + 1):
        z = s - x - y
        if (0 <= z and z <= k):
            count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

if __name__ == '__main__':
    k, s = list(map(int,input().split()))

    a = 0
    for i in itertools.product(range(0, k+1), range(0, k+1), range(0, k+1)):
        if sum(i) == s:
            a += 1
    print(a)

Fixed submission:
k, s = list(map(int, input().split()))
count = 0
for x in range(0, k + 1):
    for y in range(0, k + 1):
        z = s - x - y
        if (0 <= z and z <= k):
            count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
n = input()
                                                                                                            def slv():
    a = ['a', 'e', 'i', 'o', 'u']
                                                                                                                for i in a:
        if i == n:
            print('vowel')
            return
    print('consonant')
                                                                                                            slv()

Fixed submission:
n = input()

def slv():
    a = ['a', 'e', 'i', 'o', 'u']

    for i in a:
        if i == n:
            print('vowel')
            return
    print('consonant')

slv()
Buggy python submission (verdict: Runtime Error):
flag = 0

counter = Counter(w)

for word, cnt in counter.most_common():
    if cnt % 2 != 0:
        flag = 1
        print("NO")

if flag == 0:
    print("YES")

Fixed submission:
from collections import Counter

w = input()
flag = 0

counter = Counter(w)

for word, cnt in counter.most_common():
    if cnt % 2 != 0:
        flag = 1

if flag == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
from functools import reduce

n = int(input())
a = list(map(int,input().split()))

end = max(a)
ansAry = []

b = min(a)
while(True):
    suma = []
    for i in range(0,len(a)):
        if b == a[i]:
            pass
        else:
            suma.append((a[i] - b)*(a[i] - b))
    ansAry.append(reduce(lambda x,y:x+y,suma))
    b += 1
    if b == end:
        break

print(min(ansAry))

Fixed submission:
from functools import reduce

n = int(input())
a = list(map(int,input().split()))

end = max(a)
ansAry = []

b = min(a)
while(True):
    suma = []
    for i in range(0,len(a)):
        if b == a[i]:
            pass
        else:
            suma.append((a[i] - b)*(a[i] - b))

    try:
        ansAry.append(reduce(lambda x,y:x+y,suma))
    except:pass

    if b == end:
        break
    b += 1

if len(ansAry) > 0:
    print(min(ansAry))
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
h,w=map(int,input())
for i in range(h):
  s=list(input().split())
  for j in range(w):
    if s[j]=='snuke':
      print(chr(65+j)+str(i+1))


Fixed submission:
h,w=map(int,input().split())
for i in range(h):
  s=list(input().split())
  for j in range(w):
    if s[j]=='snuke':
      print(chr(65+j)+str(i+1))

Buggy python submission (verdict: Runtime Error):
h,w=map(int,input())
for i in range(h):
  s=list(input().split())
  for j in range(w):
    if s[j]=='snuke':
      print(chr(97+j)+str(i+1))


Fixed submission:
h,w=map(int,input().split())
for i in range(h):
  s=list(input().split())
  for j in range(w):
    if s[j]=='snuke':
      print(chr(65+j)+str(i+1))

Buggy python submission (verdict: Runtime Error):
n,m=map(int,input())
for i in range(h):
  s=list(input().split())
  for j in range(w):
    if s[j]=='snuke':
      print(chr(97+j)+str(i+1))


Fixed submission:
h,w=map(int,input().split())
for i in range(h):
  s=list(input().split())
  for j in range(w):
    if s[j]=='snuke':
      print(chr(65+j)+str(i+1))
Buggy python submission (verdict: Time Limit Exceeded):
x, y  =input().split(' ')
count = 0
for i in range(int(x)+1):
    for j in range(int(x)+1):
        for k in range(int(x)+1):
            if i + j + k == int(y):
                count += 1

print(count)

Fixed submission:
k, s = map(int, input().split(' '))
count = 0
for i in range(k+1):
    for j in range(k+1):
        if i + j <= s and s<=k+i+j:
            count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = int(input())
if n%500<=a:
    plint("Yes")
else:
    print("No")

Fixed submission:
n = int(input())
a = int(input())
if n%500<=a:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = int(input())
if n%500<= a:
    plint("Yes")
else:

Fixed submission:
n = int(input())
a = int(input())
if n%500<=a:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = int(input())
if n%500<= a:
    plint('Yes')
else:
    print('No')

Fixed submission:
n = int(input())
a = int(input())
if n%500<=a:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = (int(input()))
a = (int(input()))
if n%500<= a:
    plint('Yes')
else:
    print('No')

Fixed submission:
n = int(input())
a = int(input())
if n%500<=a:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a = input()
b = 24 - a
c = 24 + b  
print(c)

Fixed submission:
a = input()
b = 24 - int(a)
c = 24 + b  
print(c)
Buggy python submission (verdict: Runtime Error):
a,b = [int(input().split()) for i in range(2)]
c = ( a * a )
print( c - a )

Fixed submission:
m = int(input())
n = int(input())
m = m*m
print(m - n)

Buggy python submission (verdict: Runtime Error):
a,b = [int(input().split()) for i in range(2)]
c = ( a * a )
d = (c - a)
print(d)

Fixed submission:
m = int(input())
n = int(input())
m = m*m
print(m - n)
Buggy python submission (verdict: Runtime Error):
a,b = ((x) for x in input().split())
int(c) = int(a) - int(b)
if c > '0':
    print ( c )
else:
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = ((x) for x in input().split(" "))
int(c) = int(a) - int(b)
if c > '0':
    print ( c )
else:
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = ((x) for x in input().split(" "))
int(c) = int(a) - int(b)
if c > 0:
    print ( c )
else:
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = ((x) for x in input().split(" "))
c = a - b
if c > 0:
    print ( c )
else:
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = ((x) for x in input().split(" "))
c = (a - b)
if c > 0:
    print (c)
else:
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = (int(x) for x in input().split(" "))
int(c) = (int(a) - int(b))
if c > 0:
    print int(c)
else:
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = (int(x) for x in input().split(" "))
int(c) = (int(a) - int(b))
if c > ('-1'):
    print int(c)
elif int(c) < ('0'):
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = (int(x) for x in input().split(" "))
int(c) = (int(a) - int(b))
if c > ('-1'):
    print int(c)
elif int(c) < ('-1'):
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = (int(x) for x in input().split(" "))
int(c) = (int(a - b))
if c > ('-1'):
    print int(c)
elif int(c) < ('-1'):
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = (int(x) for x in input().split())
int(c) = (int(a - b))
if c > ('-1'):
    print int(c)
elif int(c) < ('-1'):
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
a,b = (int(x) for x in input().split())
c = (a - b)
if c > ('-1'):
    print(c)
elif c < ('-1'):
    print('0')

Fixed submission:
X, t = map(int, input().split())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
a,b,c=(int(x) for x in input().split())
if a < b < c:
    print( 'A' )
elif a < c < b:
    print( 'A' )
elif b < a < c:
    print( 'B' )
elif b < c < a:
    print( 'B' )
elif c < a < b:
    print( 'C' )
elif c < b < a

Fixed submission:
x, a, b = (int(x) for x in input().split())
if abs(a-x) < abs(b-x):
    print("A")
else:
    print("B")

Buggy python submission (verdict: Runtime Error):
a,b,c=(int(x) for x in input().split())
if a < b < c:
    print( 'A' )
elif a < c < b:
    print( 'A' )
elif b < a < c:
    print( 'B' )
elif b < c < a:
    print( 'B' )
elif c < a < b:
    print( 'C' )
elif c < b < a

Fixed submission:
x, a, b = (int(x) for x in input().split())
if abs(a-x) < abs(b-x):
    print("A")
else:
    print("B")