Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
mod = 1000000007
H, W, A, B = map(int, raw_input().split())

factorial = [1]
for n in range(1, H+W):
    factorial.append(factorial[n-1]*n%mod)

def power(x, y):
    if   y == 0     : return 1
    elif y == 1     : return x % mod
    elif y % 2 == 0 : return power(x, y/2)**2 % mod
    else            : return power(x, y/2)**2 * x % mod

inverseFactorial = [0] * (H+W)
inverseFactorial[H+W-1] = power(factorial[H+W-1], mod-2)
for n in range(H+W-2, -1, -1):
    inverseFactorial[n] = inverseFactorial[n+1] * (n+1) % mod

def combi(n, m):
    return factorial[n] * inverseFactorial[m] * inverseFactorial[n-m] % mod

sum = 0
for i in range(B+1, W+1):
    sum = (sum + combi(H-A-1+i-1, i-1) * combi(A-1+W-i, W-i)) % mod
print (sum)

Fixed submission:
mod = 1000000007
H, W, A, B = map(int, input().split())
import sys
sys.setrecursionlimit(10000)
factorial = [1]
for n in range(1, H+W):
    factorial.append(factorial[n-1]*n % mod)

def power(x, y):
    if y == 0:
        return 1
    elif y == 1:
        return x % mod
    elif y % 2 == 0:
        return (power(x, y//2)**2) % mod
    else:
        return (power(x, y//2)**2 * x) % mod
inverseFactorial = [0 for i in range(H+W)]
inverseFactorial[H+W-1] = power(factorial[H+W-1], mod-2)
for n in range(H+W-2, -1, -1):
    inverseFactorial[n] = (inverseFactorial[n+1] * (n+1) )% mod

def combi(n, m):
    return (factorial[n] * inverseFactorial[m] * inverseFactorial[n-m] )% mod
 
sum = 0
for i in range(B+1, W+1):
    sum = (sum + combi(H-A-1+i-1, i-1) * combi(A-1+W-i, W-i)) % mod
print(sum)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = LI()
    a.sort()
    if a = [5, 5, 7]:
        print("YES")
    else:

        print("NO")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()


Fixed submission:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = LI()
    a.sort()
    if a == [5, 5, 7]:
        print("YES")
    else:

        print("NO")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()
Buggy python submission (verdict: Runtime Error):
def larger(x, y):
	if x > y: return x
	return y

A, B = map(int, input().split())
p = A + B
m = A - B
t = A * B
print(larger(p. larger(m, t)))

Fixed submission:
def larger(x, y):
	if x > y: return x
	return y

A, B = map(int, input().split())
p = A + B
m = A - B
t = A * B
print(larger(p, larger(m, t)))
Buggy python submission (verdict: Runtime Error):
def smaller(x, y):
	if x < y: return x
	return y

P, Q, R = map(int, input().split())

r1 = P + Q
r2 = Q + R
r3 = R + P

print(smaller(r1, smaller(r2, r3)))

Fixed submission:
def smaller(x, y):
	if x < y: return x
	return y

P, Q, R = map(int, input().split())

r1 = P + Q
r2 = Q + R
r3 = R + P

print(smaller(r1, smaller(r2, r3)))
Buggy python submission (verdict: Time Limit Exceeded):
def larger(x, y):
	if x > y:
		return x
	return y

H, W = map(int, input().split())
field = []
for i in range(0, H):
	field.append(input())
upper = []
down = []
left = []
right = []
for i in range(0, H):
	lst1 = []
	lst2 = []
	lst3 = []
	lst4 = []
	for j in range(0, W):
		lst1.append(0)
		lst2.append(0)
		lst3.append(0)
		lst4.append(0)
	upper.append(lst1)
	down.append(lst2)
	left.append(lst3)
	right.append(lst4)
for i in range(0, H):
	for j in range(0, W):
		if field[i][j] == '.':
			
			for k in range(1, H):
				if i - k < 0:
					break
				if field[i-k][j] == '#':
					break
				upper[i][j] += 1
			for k in range(1, H):
				if i + k >= H:
					break
				if field[i+k][j] == '#':
					break
				down[i][j] += 1
			for k in range(1, W):
				if j - k < 0:
					break
				if field[i][j-k] == '#':
					break
				left[i][j] += 1
			for k in range(1, W):
				if j + k >= W:
					break
				if field[i][j+k] == '#':
					break
				right[i][j] += 1
max = 0
for i in range(0, H):
	for j in range(0, W):
		if field[i][j] == '.':
			lamp = upper[i][j] + down[i][j] + left[i][j] + right[i][j] + 1
			max = larger(max, lamp)
print(max)

Fixed submission:
def larger(x, y):
	if x > y:
		return x
	return y

H, W = map(int, input().split())
field = []
for i in range(0, H):
	field.append(input())
upper = []
down = []
left = []
right = []
for i in range(0, H):
	lst1 = []
	lst2 = []
	lst3 = []
	lst4 = []
	for j in range(0, W):
		lst1.append(0)
		lst2.append(0)
		lst3.append(0)
		lst4.append(0)
	upper.append(lst1)
	down.append(lst2)
	left.append(lst3)
	right.append(lst4)
for i in range(0, H):
	cnt1 = 0
	cnt2 = 0
	for j in range(0, W):
		if field[i][j] == '#':
			cnt1 = 0
		else:
			left[i][j] = cnt1
			cnt1 += 1
		if field[i][-1-j] == '#':
			cnt2 = 0;
		else:
			right[i][-1-j] = cnt2
			cnt2 += 1
for i in range(0, W):
	cnt1 = 0
	cnt2 = 0
	for j in range(0, H):
		if field[j][i] == '#':
			cnt1 = 0
		else:
			upper[j][i] = cnt1
			cnt1 += 1
		if field[-1-j][i] == '#':
			cnt2 = 0
		else:
			down[-1-j][i] = cnt2
			cnt2 += 1
max = 0
for i in range(0, H):
	for j in range(0, W):
		if field[i][j] == '.':
			lamp = upper[i][j] + down[i][j] + left[i][j] + right[i][j] + 1
			max = larger(max, lamp)
print(max)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
K = int(input())
anslist = []
for i in range(0, len(S)):
	now = str(S[i])
	if len(anslist) != K and now not in anslist:
		anslist.append(now)
	elif len(anslist) == K and now < anslist[-1] and now not in anslist:
		anslist[-1] = now
	anslist.sort()
	for j in range(i+1, len(S)):
		now = now + str(S[j])
		if len(anslist) != K and now not in anslist:
			anslist.append(now)
		elif len(anslist) == K and now < anslist[-1] and now not in anslist:
			anslist[-1] = now
		anslist.sort()
print(anslist[-1])

Fixed submission:
S = input()
K = int(input())
anslist = []
for i in range(0, len(S)):
	now = ''
	for j in range(i, len(S)):
		now = now + str(S[j])
		flag = True
		if len(anslist) != K and now not in anslist:
			flag = False
			anslist.append(now)
		elif len(anslist) == K and now < anslist[-1] and now not in anslist:
			flag = False
			anslist[-1] = now
		elif now in anslist:
			flag = False
		anslist.sort()
		if flag:
			break
print(anslist[-1])
Buggy python submission (verdict: Runtime Error):
def smaller(x, y):
	if x < y:
		return x
	return y

N = int(input())
anscounter = []
for i in range(0, 26):
	anscounter.append(0)
S = input()
for i in range(0, len(S)):
	anscounter[ord(S[i])-97] += 1
for i in range(1, N):
	tmpcounter = []
	for j in range(0, 26):
		tmpcounter.append(0)
	newS = input()
	for j in range(0, len(S)):
		tmpcounter[ord(newS[j])-97] += 1
	for j in range(0, 26):
		anscounter[j] = smaller(anscounter[j], tmpcounter[j])
ans = ''
for i in range(0, 26):
	for j in range(0, anscounter[i]):
		ans = ans + str(chr(i+97))
print(ans)

Fixed submission:
def smaller(x, y):
	if x < y:
		return x
	return y

N = int(input())
anscounter = []
for i in range(0, 26):
	anscounter.append(0)
S = input()
for i in range(0, len(S)):
	anscounter[ord(S[i])-97] += 1
for i in range(1, N):
	tmpcounter = []
	for j in range(0, 26):
		tmpcounter.append(0)
	newS = input()
	for j in range(0, len(newS)):
		tmpcounter[ord(newS[j])-97] += 1
	for j in range(0, 26):
		anscounter[j] = smaller(anscounter[j], tmpcounter[j])
ans = ''
for i in range(0, 26):
	for j in range(0, anscounter[i]):
		ans = ans + str(chr(i+97))
print(ans)

Buggy python submission (verdict: Runtime Error):
def smaller(x, y):
	if x < y:
		return x
	return y

N = int(input())
anscounter = []
for i in range(0, 26):
	anscounter.append(0)
S = input()
for i in range(0, len(S)):
	anscounter[ord(S[i])-97] += 1
for i in range(1, N):
	tmpcounter = []
	for j in range(0, 26):
		tmpcounter.append(0)
	newS = input()
	for j in range(0, len(S)):
		tmpcounter[ord(newS[j])-97] += 1
	for j in range(0, 26):
		anscounter[j] = smaller(anscounter[j], tmpcounter[j])
ans = ''
for i in range(0, 26):
	for j in range(0, anscounter[i]):
		ans = ans + str(chr(i+97))
print(ans)

Fixed submission:
def smaller(x, y):
	if x < y:
		return x
	return y

N = int(input())
anscounter = []
for i in range(0, 26):
	anscounter.append(0)
S = input()
for i in range(0, len(S)):
	anscounter[ord(S[i])-97] += 1
for i in range(1, N):
	tmpcounter = []
	for j in range(0, 26):
		tmpcounter.append(0)
	newS = input()
	for j in range(0, len(newS)):
		tmpcounter[ord(newS[j])-97] += 1
	for j in range(0, 26):
		anscounter[j] = smaller(anscounter[j], tmpcounter[j])
ans = ''
for i in range(0, 26):
	for j in range(0, anscounter[i]):
		ans = ans + str(chr(i+97))
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())

ACcount = 0 
WAcount = 0
TLEcount = 0
REcount = 0
for i in range(N):
	S=input()

	if S == "AC":
		ACcount = ACcount + 1
	elif S == "WA":
		WAcount = WAcount + 1
	elif S == "TLE":
		TLEcount = TLEcount + 1
	elif S == "RE":
		REcount = REcount + 1

print("AC x", ACcount)
print("WA x", WAcount)
print("TLE x", TLEcount)
print("RE x", REcount)

Fixed submission:
N = int(input())

if N % 1000 == 0:
	print(0)
else:
	print(1000 - (N % 1000))

Buggy python submission (verdict: Runtime Error):
N = int(input())

ACcount = 0 
WAcount = 0
TLEcount = 0
REcount = 0
for i in range(N):
	S=input()

	if S == "AC":
		ACcount = ACcount + 1
	elif S == "WA":
		WAcount = WAcount + 1
	elif S == "TLE":
		TLEcount = TLEcount + 1
	elif S == "RE":
		REcount = REcount + 1

print("AC x" + str(ACcount))
print("WA x" + str(WAcount))
print("TLE x" + str(TLEcount))
print("RE x" + str(REcount))

Fixed submission:
N = int(input())

if N % 1000 == 0:
	print(0)
else:
	print(1000 - (N % 1000))
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()

count = 0
for i in range(len(S)):
	if S[i] != T[i]:
		count = count + 1

print(count)

Fixed submission:
a = int(input())

print(a + a * a  + a * a * a)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()

cout = 0
for i in range(len(S)):
	if S[i] != T[i]:
		count = count + 1

print(count)

Fixed submission:
S = input()
T = input()
 
count = 0
for i in range(len(S)):
	if S[i] != T[i]:
		count = count + 1
 
print(count)
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int,input().split()))
P = list(map(int,input().split()))

def bubblesort(l):
    for index in range(len(l)-1, 0, -1):
        for low in range(index):
            if l[low] > l[low+1]:
                tmp = l[low+1]
                l[low+1] = l[low]
                l[low] = tmp
    return l

bubblesort(P)
sum = 0
for i in range(K):
	sum = sum + P[i]
print(sum)

Fixed submission:
a = input()

if a.isupper():
	print("A")
else:
	print("a")

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

if a.isupper():
	print(A)
else:
	print(a)

Fixed submission:
a = input()

if a.isupper():
	print("A")
else:
	print("a")
Buggy python submission (verdict: Runtime Error):
A,B = int(input.split())

print(A * B)

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

print(A * B)

Buggy python submission (verdict: Runtime Error):
A,B = int(input().split())

print(A * B)

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

print(A * B)
Buggy python submission (verdict: Runtime Error):
for okashi_number in range(k):
	di = int(input())
	D = map(int,input().split())
	for x in range(di)
		A[[x]-1] = 1

for i in range(N):
	if A[i] == 0:
	print(A[i])


Fixed submission:
S = input()

if S == "ABC":
	print("ARC")
else:
	print("ABC")
Buggy python submission (verdict: Runtime Error):
for okashi_number in range(k):
	di = int(input())
	D = map(int,input().split())
	for x in range(di)
		A[[x]-1] = 1

for i in range(N):
	if A[i] == 0:
	print(A[i])


Fixed submission:

N,k = map(int,input().split())

A = [0] * N
#print(A)
#print(type(A))

for okashi_number in range(k):
	di = int(input())
	D = list(map(int,input().split()))
	for x in range(di):
		A[D[x]-1]= 1
#print(A)
count = 0
for i in range(N):
	if A[i] == 0:
		count = count + 1
print(count)
Buggy python submission (verdict: Runtime Error):
k = int(input())
a , b = map(int(input().split()))

flag = 0
for i in range(a ,b + 1, 1)
	if i % k == 0:
		flag = flag + 1
		break
		print("OK")
elif flag == 0:
	print("NO")

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

flag = 0
for i in range(a ,b + 1, 1):
	if i % k == 0:
		flag = flag + 1
		break

if flag == 0:
	print("NG")
else:
	print("OK")
Buggy python submission (verdict: Runtime Error):
N =input()

flag = 0
for i in range(len(N)):
	if N[i] == "7":
		flag = 1
		break

if flag == 1:
	print("Yes")
else:
	print("No"

Fixed submission:
N = input()

flag = 0
for i in range(len(N)):
	if N[i] == "7":
		flag = 1
		break

if flag == 1:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
S = input()

if S[3] == S[4] and S [5] == S[6]:
	print("Yes")
else:
	print("No")

Fixed submission:
S = input()

if S[2] == S[3] and S [4] == S[5]:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())

number_turn = N //(A + B)
nokori = N % (A + B)

if nokori <= A: #nokoriが全てAの場合
	print((number_turn * A) + nokori)
else:　#nokoriがAとBの両方の場合
	print((number_turn * A) + A)

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

c = N//(A + B)

rem = N - c * (A + B)

if rem >= A:
	sum = c * A + A
else:
	sum =c * A + rem

print(sum)
Buggy python submission (verdict: Runtime Error):
s = 3
arr =[]
for _ in range(s):
        arr.append(list(map(int, input().rstrip().split())))
#print(arr)
 
check = [[0,0,0],[0,0,0],[0,0,0]]
#print(check)
 
#check データ
N = int(input())
#print(N)
 
for i in range(N):
    data = int(input())
    for k in range(3):
        for j in range(3):
            if data == arr[j][k]:
                check[j][k]= 1
#print(check)
 
#chek ビンゴ
answer = "No"
for k in range(3):
    if check[k][0] == 1 and check[k][1]== 1 and check[k][2] == 1:
        answer = "Yes"
 
for j in range(3):
    if check[0][j] == 1 and check[1][j] == 1 and check[2][j] == 1:
        answer = "Yes"
 
if check[0][0] == 1 and check[1][1] == 1 and check[2][2] == 1:
    answer = "Yes"
 
if check[0][2] == 1 and check[1][1] == 1 and check[2][0] == 1:
    answer = "Yes"
 
 
print(answer)
s = 3
arr =[]
for _ in range(s):
        arr.append(list(map(int, input().rstrip().split())))
print(arr)

check = [[0,0,0],[0,0,0],[0,0,0]]
#print(check)

#check データ
N = int(input())
#print(N)

for i in range(N):
    data = int(input())
    for k in range(3):
        for j in range(3):
            if data == arr[j][k]:
                check[j][k]= 1
#print(check)

#chek ビンゴ
answer = "No"
for k in range(3):
    if check[k][0] == 1 and check[k][1]== 1 and check[k][2] == 1:
        answer = "Yes"

for j in range(3):
    if check[0][j] == 1 and check[1][j] == 1 and check[2][j] == 1:
        answer = "Yes"

if check[0][0] == 1 and check[1][1] == 1 and check[2][2] == 1:
    answer = "Yes"

if check[0][2] == 1 and check[1][1] == 1 and check[2][0] == 1:
    answer = "Yes"


print(answer)
提出情報

Fixed submission:
s = 3
arr =[]
for _ in range(s):
        arr.append(list(map(int, input().rstrip().split())))
#print(arr)
 
check = [[0,0,0],[0,0,0],[0,0,0]]
#print(check)
 
#check データ
N = int(input())
#print(N)
 
for i in range(N):
    data = int(input())
    for k in range(3):
        for j in range(3):
            if data == arr[j][k]:
                check[j][k]= 1
#print(check)
 
#chek ビンゴ
answer = "No"
for k in range(3):
    if check[k][0] == 1 and check[k][1]== 1 and check[k][2] == 1:
        answer = "Yes"
 
for j in range(3):
    if check[0][j] == 1 and check[1][j] == 1 and check[2][j] == 1:
        answer = "Yes"
 
if check[0][0] == 1 and check[1][1] == 1 and check[2][2] == 1:
    answer = "Yes"
 
if check[0][2] == 1 and check[1][1] == 1 and check[2][0] == 1:
    answer = "Yes"
 
 
print(answer)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())

if A == B and A != C :
	answer　= "Yes"
    
elif A == C and A != B :
	answer　= "Yes"
    
elif B == C and B != A :
	answer　= "Yes"
else:
	answer = "No"

print(answer)
    

Fixed submission:
A,B,C = map(int,input().split())
 
if A == B and A != C :
	answer = "Yes"
elif A == C and A != B :
	answer = "Yes"
    
elif B == C and B != A :
	answer = "Yes"
else:
	answer = "No"
 
print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K = map(int,input().split())

for i in range(K):
	if A >= 1:
		A = A - 1
	elif B >= 1:
		B = B -1
	else:
		break
print(A,B)

Fixed submission:
A,B,K = map(int,input().split())

if K <= A:
	print(A - K ,B)
elif K <= (A + B):
	print(0,B-(K-A))
else:
	print(0,0)
Buggy python submission (verdict: Runtime Error):
#２分探索
A = [1,5,7,15,26,45,60,256] #データ

x = int(input()) #探索するデータ

li = 0           #探索範囲の左端
ri = len(A) -1   #探索範囲の右端

while (li != ri):       #探索範囲が２つ以上あるかぎり繰り返す
	mi = (li + ri) // 2 #中央のindexの計算
	if A[mi] < x:       #もし中央の値 < x ならば
		li = mi+1       #左半分を消去
	elif A[mi] > x:     #もし中央の値 > x　ならば
		ri = mi-1       #右半分消去
	else:               #xを発見！!(*´꒳`*)!!
		li = mi
		ri = mi
if A[li] == x:
	print("発見！",li)
else:
	print("ないよ！")

Fixed submission:
S = input()
if S == "SUN" :
	answer = 7
elif S == "MON" :
	answer = 6
elif S == "TUE" :
	answer = 5
elif S == "WED" :
	answer = 4
elif S == "THU" :
	answer = 3
elif S == "FRI" :
	answer = 2
elif S == "SAT" :
	answer = 1
 
print(answer)

Buggy python submission (verdict: Runtime Error):
S = input()
if S == "SUN" :
	answer = 7
elif S == "MON" :
	answer = 6
elif S == "THE" :
	answer = 5
elif S == "WED" :
	answer = 4
elif S == "THU" :
	answer = 3
elif S == "FRI" :
	answer = 2
elif S == "SAT" :
	answer = 1

print(answer)

Fixed submission:
S = input()
if S == "SUN" :
	answer = 7
elif S == "MON" :
	answer = 6
elif S == "TUE" :
	answer = 5
elif S == "WED" :
	answer = 4
elif S == "THU" :
	answer = 3
elif S == "FRI" :
	answer = 2
elif S == "SAT" :
	answer = 1
 
print(answer)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())

x = A + B
y = A - B
z = A * B

if x > y and x > z:
	answer = x

elif y > x and y >z:
	answer = y

elif z > x and z > y:
	answer = z
    
print(answer)
	

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

x = A + B
y = A - B
z = A * B

if x >= y and x >= z:
	answer = x

elif y >= x and y >=z:
	answer = y

elif z >= x and z >= y:
	answer = z
    
print(answer)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())

answer = 0
if A - B <= C
	answer = C - (A - B )
  
else:
	answer = 0

print(answer)

Fixed submission:
A,B,C = map(int,input().split())

answer = 0
if A - B <= C:
	answer = C - (A - B )
  
else:
	answer = 0
    
print(answer)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())

k = (A + B) / 2

answer = 0
if A - k >= 0 and -B + k <=0 :
	answer = 1
    
elif -A + K <=0 and B - k >= 0 :
	answer = 1 
    
if anaswer == 1 and (A + B) % 2 == 0  :
	print(k)
else :
	print("IMPOSSIBLE")

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

k = (A + B) / 2

answer = 0

if A != B and (A + B) % 2 == 0 and (A - k) * (B - k) < 0:
	print(int(k))
else:
	print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())

if 6 <= A <= 12 :
	amswer = B / 2
elif A <=5 :
	answer = 0
else:
answer = B

print(answer)

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

if 6 <= A <=12 :
	answer = B / 2
elif A <=5 :
	answer = 0
else:
	answer = B

print(int(answer))
Buggy python submission (verdict: Runtime Error):
N,K =  map(int,input().split())
S = input()
SL = list(S)

SL[K] = SL[K].lower()
answer = "".join(SL)
print(answer)

Fixed submission:
N,K =  map(int,input().split())
S = input()
SL = list(S)
 
SL[K - 1] = SL[K - 1].lower()
answer = "".join(SL)
print(answer)

Buggy python submission (verdict: Runtime Error):
N,K =  map(int,input().split())
S = input()
SL = list(S)

SL[K] = SL[K].lower()
answer = "".join(SL)
print(answer)

Fixed submission:
N,K =  map(int,input().split())
S = input()
SL = list(S)
 
SL[K - 1] = SL[K - 1].lower()
answer = "".join(SL)
print(answer)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())

scoew = 0
if A >= B:
	score = score + A
    A = A -1
else:
	score = score + B
    B = B -1

if A >= B:
	score = score + A
    A = A -1
else:
	score = score + B
    B = B -1
    
print(score)

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

score = 0
if A >= B:
    score= score + A
    A = A - 1    
else:
    score = score + B
    B = B - 1

if A >= B:
    score = score + A
    A = A - 1
else:
    score = score + B
    B = B - 1
    
print(score)

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A >= B:
	answer = A - 1
else:
	amswer = B -1
    
if A - 1 >= B - 1:
	answer = A - 2
else:
	amswer = B - 2
    
print(answer)

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

score = 0
if A >= B:
    score= score + A
    A = A - 1    
else:
    score = score + B
    B = B - 1

if A >= B:
    score = score + A
    A = A - 1
else:
    score = score + B
    B = B - 1
    
print(score)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
d = input()
e = input()
k = input()

if e -a > k
	print(":(")
else:
	print("Yay!")
    

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a > k:
	print(":(")
else:
	print("Yay!")
Buggy python submission (verdict: Runtime Error):
AB,BC,CA = map(int,input().split())

answer = (|BC| * |AB|) /2

print(int(answer))

Fixed submission:
AB,BC,CA = map(int,input().split())

answer = (BC * AB) /2

print(int(answer))