Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def judge(x,y):
    if (x*y) % 2 == 0:
        return "Even"
    return "Odd"

print(judge(map(int,input().split(" "))))
    


Fixed submission:
def judge(x,y):
    if (a*b) % 2 == 0:
        return "Even"
    return "Odd"

a,b = map(int,input().split())
print(judge(a,b))

Buggy python submission (verdict: Runtime Error):
def judge(x,y):
    if (a*b) % 2 == 0:
        return "Even"
    return "Odd"

a,b = map(int,input().split())
print(judge(a,b)
    

Fixed submission:
def judge(x,y):
    if (a*b) % 2 == 0:
        return "Even"
    return "Odd"

a,b = map(int,input().split())
print(judge(a,b))
Buggy python submission (verdict: Runtime Error):
times = int(input())
num = list(map(int,[input() for _ in range(times)]))
print(len(set(num))

Fixed submission:
times = int(input())
num = list(map(int,[input() for _ in range(times)]))
print(len(set(num)))
Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())
# x:10000円, y;5000円, z:1000円
for x in range(N+1):
    for y in range(N+1):
        z = N - (x + y)
        if (z >= 0) & (10000x + 5000y + 1000*z == Y):
            print(x, y, z)
            exit(0)
print(-1, -1, -1)

Fixed submission:
n, y = map(int, input().split())
for i in range(n + 1):
    for j in range(n - i + 1):
        if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
            print(i, j, n - i - j)
            exit()
print("-1 -1 -1")

Buggy python submission (verdict: Runtime Error):
num,total = map(int,input().split())
for i in range(num+1):
    for j in range(num+1):
        if i*10000 + j*5000 + (numsi-j)*1000 == total:
            print(i,j,num-i-j)
            exit()
print("-1 -1 -1")


Fixed submission:
n, y = map(int, input().split())
for i in range(n + 1):
    for j in range(n - i + 1):
        if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
            print(i, j, n - i - j)
            exit()
print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
N,a,b = map(int,[input()  for _ in range(3)])
total= 0
ans = 0
for i in range(1,N+1):
    st_i = str(i)
    for j in range(4):
        try:
            total += int(st_i[j])
        except:
            pass


    if a <= total <= b:
        ans += i
    total = 0

print(ans)

Fixed submission:
N,a,b = map(int,input().split(" "))
total= 0
ans = 0
for i in range(1,N+1):
    st_i = str(i)
    for j in range(4):
        try:
            total += int(st_i[j])
        except:
            pass


    if a <= total <= b:
        ans += i
    total = 0

print(ans)

Buggy python submission (verdict: Runtime Error):
b = map(int,[input()  for _ in range(3)])
total= 0
ans = 0
for i in range(1,N+1):
    st_i = str(i)
    for j in range(4):
        try:
            total += int(st_i[j])
        except:
            pass


    if a <= total <= b:
        ans += i
    total = 0

print(ans)

Fixed submission:
N,a,b = map(int,input().split(" "))
total= 0
ans = 0
for i in range(1,N+1):
    st_i = str(i)
    for j in range(4):
        try:
            total += int(st_i[j])
        except:
            pass


    if a <= total <= b:
        ans += i
    total = 0

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

Fixed submission:
a, b = map(int, input().split())
c = a * b
if (c % 2 == 0):
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
def sumDigit(n):
        sum = 0
        while(n > 0):
            sum += n % 10
            n //= 10
        return sum


n = int(input())
a = int(input())
b = int(input())
total = 0
    
for i in range(1, n+1):
    sum = sumDigit(i)
    if(a<= sumDigit(i) <=b):
        total += i

print(total)




Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
  if a <= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)

Buggy python submission (verdict: Runtime Error):
def sumDigit(n):
    s = 0
    while True:
        n, t = divmod(n, 10)
        s = s + t
        if n == 0:
            break
    return s


n = int(input())
a = int(input())
b = int(input())
total = 0
    
for i in range(1, n+1):
    sum = sumDigit(i)
    if(a<= sumDigit(i) <=b):
        total += i
    print(total)
#print(total)




Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
  if a <= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)

Buggy python submission (verdict: Runtime Error):
def sumDigit(n):
        sum = 0
        while(n > 0):
            sum += n % 10
            n //= 10
        return sum


n = int(input())
a = int(input())
b = int(input())
total = 0
    
for i in range(1, n+1):
    sum = sumDigit(i)
    if(a<= sumDigit(i) <=b):
        total += i

print(total)




Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
  if a <= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)

Buggy python submission (verdict: Runtime Error):
def sumDigit(n):
        sum = 0
        while(n > 0):
            sum += n % 10
            n //= 10
        return sum


n = int(input())
a = int(input())
b = int(input())
total = 0
    
for i in range(1, n+1):
    sum = sumDigit(i)
    if(a<= sumDigit(i) <=b):
        total += i

print(total)




Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
  if a <= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []

for i in range(n):
    a.append(int(input()))

count = 0

while(True):
    odd = False
    for i in range(n):
        if((a[i] % 2) != 0):
            odd = True
    if(odd):
        break
    for i in range(n):
        a[i] /= 2 
    count += 1


print(count)


Fixed submission:
s = input()
c = 0
if(s[0] == "1"):
    c += 1


if(s[1] == "1"):
    c += 1


if(s[2] == "1"):
    c += 1

print(c)

Buggy python submission (verdict: Runtime Error):
s = input()
c = 0
if(s[0] == "1"):
    c++


if(s[1] == "1"):
    c++


if(s[2] == "1"):
    c++




Fixed submission:
s = input()
c = 0
if(s[0] == "1"):
    c += 1


if(s[1] == "1"):
    c += 1


if(s[2] == "1"):
    c += 1

print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []

for i in range(n):
    a.append(int(input()))

count = 0

while(True):
    odd = False
    for i in range(n):
        if((a[i] % 2) != 0):
            odd = True
    if(odd):
        break
    for i in range(n):
        a[i] /= 2 
    count += 1


print(count)


Fixed submission:
n = int(input())

a = list(map(int, input().split()))
     #a = [].append(input())
count = 0

while(True):
    odd = False
    for i in range(0,n):
        if a[i]%2==1:
            odd = True
    if(odd):
        break
    for i in range(0,n):
        a[i] /= 2 
    count += 1


print(count)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []

for i in range(n):
    a.append(int(input()))

count = 0

while(True):
    odd = False
    for i in range(n):
        if((a[i] % 2) != 0):
            odd = True
    if(odd):
        break
    for i in range(n):
        a[i] /= 2 
        count += 1
print(count)


Fixed submission:
n = int(input())

a = list(map(int, input().split()))
     #a = [].append(input())
count = 0

while(True):
    odd = False
    for i in range(0,n):
        if a[i]%2==1:
            odd = True
    if(odd):
        break
    for i in range(0,n):
        a[i] /= 2 
    count += 1


print(count)
Buggy python submission (verdict: Runtime Error):
i = input()
sp = i.spint()

multid = sp[0] * sp[1]

if multid % 2 == 0:
    print("Even")
else:
    print("Odd")


Fixed submission:
i = input()
sp = i.split()

multid = int(sp[0]) * int(sp[1])

if multid % 2 == 0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
d = '2 7 4'
 d = input()
d = [int(i) for i in d.split()]
d.sort()
s1 = 0
s2 = 0
i = len(d)-1
while(i>=0):
    s1 = s1 + d[i]
    if((i-1)>=0):
        s2 = s2 + d[i-1]
    i = i-2
print(s1-s2)




Fixed submission:
d = '2 7 4'
d = input()
d = input()
d = [int(i) for i in d.split()]
d.sort()
s1 = 0
s2 = 0
i = len(d)-1
while(i>=0):
    s1 = s1 + d[i]
    if((i-1)>=0):
        s2 = s2 + d[i-1]
    i = i-2
print(s1-s2)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
x = input()

# a = 2
# b = 2
# c = 2
# x = 100

cnt = 0
for i1 in range(0,a+1):
    for i2 in range(0,b+1):
        for i3 in range(0,c+1):
            s = 500*i1+100*i2+50*i3
            if(s==x):
                cnt = cnt + 1
print(cnt)


Fixed submission:
a = input()
b = input()
c = input()
x = input()

a = int(a)
b = int(b)
c = int(c)
x = int(x)

# a = 2
# b = 2
# c = 2
# x = 100

cnt = 0
for i1 in range(0,a+1):
    for i2 in range(0,b+1):
        for i3 in range(0,c+1):
            s = 500*i1+100*i2+50*i3
            if(s==x):
                cnt = cnt + 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
a = input()
d = a.split()
b = d[0]*d[1]
if(b%2==0):
    print('Even')
else:
    print('Odd')


Fixed submission:
a = input()
d = a.split()
b = int(d[0])*int(d[1])
if(b%2==0):
    print('Even')
else:
    print('Odd')
Buggy python submission (verdict: Runtime Error):
n = 20
a = 2
b = 5

n = int(input())
a = int(input())
b = int(input())

sum1 = 0

for i in range(1,n+1):
    d = list(str(i))
    sum2 = 0
    for i2 in d:
        sum2 = sum2 + int(i2)
    if(a<=sum2 and sum2<=b):
        sum1 = sum1 + int(i)

print(sum1)


Fixed submission:
n = 20
a = 2
b = 5

i = input()
d = i.split()
n = int(d[0])
a = int(d[1])
b = int(d[2])

sum1 = 0

for i in range(1,n+1):
    d = list(str(i))
    sum2 = 0
    for i2 in d:
        sum2 = sum2 + int(i2)
    if(a<=sum2 and sum2<=b):
        sum1 = sum1 + int(i)

print(sum1)
Buggy python submission (verdict: Runtime Error):
input = input()
num = 0

for i in range(2):
  if (input[i] == 1):
    num++

print(i)

Fixed submission:
input = str(input())
num = 0

for i in input:
  if i == "1":
    num += 1
    
print(num)

Buggy python submission (verdict: Runtime Error):
input = input()
num = 0

for i in range(3):
  if (input[i] == 1):
    num++

print(i)

Fixed submission:
input = str(input())
num = 0

for i in input:
  if i == "1":
    num += 1
    
print(num)
Buggy python submission (verdict: Runtime Error):
input_num = input()
input = input().split()

times = 0
i = 0

while True:
  if int(input[i]) % 2 == 0:
    i += 1
    if i == input_num:
      i = 0
      times += 1
  else:
    break

print(times)

Fixed submission:
input_num = input()
input = input().split()

times = 0
i = 0
    
while True:
  if int(input[i]) % 2 == 0:
    input[i] = int(input[i]) / 2
    i += 1
    if i == int(input_num) - 1:
      i = 0
      times += 1
  else:
    break
print(times)

Buggy python submission (verdict: Runtime Error):
input_num = input()
input = input().split()

times = 0
i = 0

while true:
  if input % 2 == 0:
    i += 1
    if i % input_num == 0:
      times += 1
  else:
    break

print(times)

Fixed submission:
input_num = input()
input = input().split()

times = 0
i = 0
    
while True:
  if int(input[i]) % 2 == 0:
    input[i] = int(input[i]) / 2
    i += 1
    if i == int(input_num) - 1:
      i = 0
      times += 1
  else:
    break
print(times)
Buggy python submission (verdict: Runtime Error):
n = int(input())
t1,x1,y1 = map(int, input().split())

for p in [x1,y1]:
    if p < 0 or n < p:
        print('No')
        exit()

t2,x2,y2 = map(int, input().split())

for p in [x2,y2]:
    if p < 0 or n < p:
        print('No')
        exit()

dt = t2 - t1
d  = abs(x2 - x1) + abs(y2 - y1)

if (d < dt) and (dt%2 == d%2):
    print('Yes')
else:
    print('No')


Fixed submission:
n = int(input())
for i in range(n):
    t, x, y = map(int, input().split())
    if x + y > t or (x + y + t) % 2 == 1:
        print("No")
        exit()
print("Yes")

Buggy python submission (verdict: Runtime Error):
n = int(input())
t1,x1,y1 = map(int, input().split())
t2,x2,y2 = map(int, input().split())

dt = t2 - t1
d  = abs(x2 - x1) + abs(y2 - y1)

if (d < dt) and (dt%2 == d%2):
    print('Yes')
else:
    print('No')


Fixed submission:
n = int(input())
for i in range(n):
    t, x, y = map(int, input().split())
    if x + y > t or (x + y + t) % 2 == 1:
        print("No")
        exit()
print("Yes")

Buggy python submission (verdict: Runtime Error):
n = int(input())
t1,x1,y1 = map(int, input().split())
t2,x2,y2 = map(int, input().split())


for p in [x1,y1,x2,y2]:
    if p < 0 or n < p:
        print('No')
        exit()

dt = t2 - t1
d  = abs(x2 - x1) + abs(y2 - y1)

if (d < dt) and (dt%2 == d%2):
    print('Yes')
else:
    print('No')


Fixed submission:
n = int(input())
for i in range(n):
    t, x, y = map(int, input().split())
    if x + y > t or (x + y + t) % 2 == 1:
        print("No")
        exit()
print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
n, y = map(int, input().split())
ans_flg = False
ans_ct = {}

for i in range(n+1):
    for j in range(n-i+1):
        for k in range(n-i-j+1):
            if y == 10000*i + 5000*j + 1000*k and i+j+k == n:
                ans_flg = True
                ans_ct = {"i": i, "j": j, "k": k}
                break

if ans_flg:
    print("{} {} {}".format(ans_ct["i"], ans_ct["j"], ans_ct["k"]))
else:
    print("-1 -1 -1")





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

for i in range(n+1):
    for j in range(n-i+1):
        if y == 10000*i + 5000*j + 1000*(n-i-j):
            print(i, j, n-i-j)
            exit()

print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())

count = 0
for i in range(a+1):
 if 500*i>x: break
 for j in range(b+1):
  if x-500*i-100*j > 50*c: break
   count += 1

print(count)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
x = int(input())

count = 0
for i in range(a+1):
 for j in range(b+1):
  for k in range(c+1):
   if 500*i+100*j+50*k == x:
    count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
a, b = map(string, input().split())
ab = int(a+b)
if ab**0.5 - int(ab**0.5) == 0:
 print("Yes")
else:
 print("No")

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(string, input().split())
ab = int(a+b)
if ab**0.5 - int(ab**0.5) == 0:
 print("Yes")
else:
 print("No")

Fixed submission:
a, b = map(str, input().split())
ab = int(a+b)
if ab**0.5 - int(ab**0.5) == 0:
 print("Yes")
else:
 print("No")
Buggy python submission (verdict: Runtime Error):
s = int(list(input()))
print(sum(s))

Fixed submission:
s = list(input())
print(int(s[0])+int(s[1])+int(s[2]))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

end = 0
count = 0
while:
 for i in range(n):
  if a[i]%2 == 1:
   end = 1
   break
  a[i] = a[i]/2
 
 if end == 1: break
 count += 1

print(count)

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

end = 0
count = 0

while(True):
 for i in range(n):
  if a[i]%2 == 1:
   end = 1
   break
  a[i] = a[i]/2
 
 if end == 1: break
 count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
import sys
import itertools
import math
input = sys.stdin.readline
#sys.setrecursionlimit(1e9)
N,M = map(int,input().split())

ab = [list(map(int,input().split())) for _ in range(M)]

graph=[[0]*8 for _ in range(8)]
def dfs(v,visited):
    if sum(visited) == N:
        return 1
    ret =0
    for i in range(N):
        if graph[v][i] == 1 and visited[i] == 0:
            visited[i]=1
            ret += dfs(i,visited)
            visited[i]=0
    return ret
def main():
    """code here"""

    for i in range(N):
        a=ab[i][0]
        b=ab[i][1]
        graph[a-1][b-1]=1
        graph[b-1][a-1]=1

    visited=[0]*N
    visited[0]=1
    print(dfs(0,visited))




    
    
if __name__ == '__main__':
    main()

Fixed submission:
import sys
import itertools
import math
input = sys.stdin.readline
#sys.setrecursionlimit(1e9)
N,M = map(int,input().split())

ab = [list(map(int,input().split())) for _ in range(M)]

graph=[[0]*8 for _ in range(8)]
def dfs(v,visited):
    if sum(visited) == N:
        return 1
    ret =0
    for i in range(N):
        if graph[v][i] == 1 and visited[i] == 0:
            visited[i]=1
            ret += dfs(i,visited)
            visited[i]=0
    return ret
def main():
    """code here"""

    for i in range(M):
        a=ab[i][0]
        b=ab[i][1]
        graph[a-1][b-1]=1
        graph[b-1][a-1]=1

    visited=[0]*N
    visited[0]=1
    print(dfs(0,visited))
    
if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
import sys
import itertools
import math
input = sys.stdin.readline
#sys.setrecursionlimit(1e9)
N,M = map(int,input().split())

ab = [list(map(int,input().split())) for _ in range(M)]

graph=[[0]*N for _ in range(N)]
def dfs(v,visited):
    if sum(visited) == N:
        return 1
    ret =0
    for i in range(N):
        if graph[v][i] == 1 and visited[i] == 0:
            visited[i]=1
            ret += dfs(i,visited)
            visited[i]=0
    return ret
def main():
    """code here"""

    for i in range(N):
        a=ab[i][0]
        b=ab[i][1]
        graph[a-1][b-1]=1
        graph[b-1][a-1]=1

    visited=[0]*N
    visited[0]=1
    print(dfs(0,visited))




    
    
if __name__ == '__main__':
    main()

Fixed submission:
import sys
import itertools
import math
input = sys.stdin.readline
#sys.setrecursionlimit(1e9)
N,M = map(int,input().split())

ab = [list(map(int,input().split())) for _ in range(M)]

graph=[[0]*8 for _ in range(8)]
def dfs(v,visited):
    if sum(visited) == N:
        return 1
    ret =0
    for i in range(N):
        if graph[v][i] == 1 and visited[i] == 0:
            visited[i]=1
            ret += dfs(i,visited)
            visited[i]=0
    return ret
def main():
    """code here"""

    for i in range(M):
        a=ab[i][0]
        b=ab[i][1]
        graph[a-1][b-1]=1
        graph[b-1][a-1]=1

    visited=[0]*N
    visited[0]=1
    print(dfs(0,visited))
    
if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
s=raw_input().sprit(' ')
print 'A'+s[1][0]+'C'

Fixed submission:
s=raw_input().split(' ')
print 'A'+s[1][0]+'C'
Buggy python submission (verdict: Runtime Error):
# 文字列の入力
s = raw_input()
dst = s.replace(',', ' ')
# 出力
print(dst)

Fixed submission:
# -*- coding: utf-8 -*-
# 文字列の入力
s = raw_input()
dst = s.replace(',', ' ')
# 出力
print(dst)

Buggy python submission (verdict: Runtime Error):
# 文字列の入力
s = raw_input()
dst = s.replace(',', ' ')
# 出力
print(dst)

Fixed submission:
# -*- coding: utf-8 -*-
# 文字列の入力
s = raw_input()
dst = s.replace(',', ' ')
# 出力
print(dst)
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

sumA = 0
sumB = 0

for i in range(n):
    sumA = A[i] + sumA
    sumB = B[i] + sumB

if sumA <= sumB:
    print("Yes")
else:
    print("No")


Fixed submission:
x, y =  map(int, input().split())
i = 1
if x % y == 0:
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue

Buggy python submission (verdict: Runtime Error):

x, y =  map(int, input().split())
i = 1
if x % y == 0;
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue


Fixed submission:
x, y =  map(int, input().split())
i = 1
if x % y == 0:
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue

Buggy python submission (verdict: Runtime Error):
x, y =  map(int, raw_input().split())

if x % y == 0;
    print(-1)
else:
    for i = 1 in range(10 ** 18 + 1):
        if i * x % y != 0:
            print(i * x)
            break
        else:
            continue



Fixed submission:
x, y =  map(int, input().split())
i = 1
if x % y == 0:
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue

Buggy python submission (verdict: Runtime Error):
x, y =  map(int, raw_input().split())

if x < y:
    print(x)
else:
    print(x * (y-1) )


Fixed submission:
x, y =  map(int, input().split())
i = 1
if x % y == 0:
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue

Buggy python submission (verdict: Runtime Error):
x, y =  map(int, raw_input().split())
z = 0
i = 1
a = 0

while z < 10 ** 18 or a ==  0:
    z = x * i
    i = i + 1
    if z mod y != 0:
        a = 1
print (z)


Fixed submission:
x, y =  map(int, input().split())
i = 1
if x % y == 0:
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue

Buggy python submission (verdict: Runtime Error):

x, y =  map(int ,int)
z = 0
i = 1
a = 0

while z < 10 ** 18 or a =  0:
    z = x * i
    i = i + 1
    if z mod y != 0:
        a = 1



Fixed submission:
x, y =  map(int, input().split())
i = 1
if x % y == 0:
    print(-1)
else:
    for i in range(10 ** 18 + 1):
        if (i * x) % y != 0:
            print(i * x)
            break
        else:
            continue
Buggy python submission (verdict: Runtime Error):

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

sumA = 0
sumB = 0
sumAB = 0

for i in range(n):
    sumA += A[i]
    sumB += B[i]

for i in range(n):
    if A[i] < B[i]:
        sumAB += int((b[i] - a[i]) / 2 + 0.5)

if sumAB <= sumB - sumA:
    print("Yes")
else:
    print("No")


Fixed submission:

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

sumA = 0
sumB = 0
sumAB = 0

for i in range(n):
    sumA += A[i]
    sumB += B[i]

for i in range(n):
    if A[i] < B[i]:
        sumAB += int((B[i] - A[i]) / 2 + 0.5)

if sumAB <= sumB - sumA:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

for i in range(n):
    sumA = A[i] + sumA
    sumB = B[i] + sumB

if sumA < sumB:
    print("Yes")
else:
    print("No")


Fixed submission:

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

sumA = 0
sumB = 0
sumAB = 0

for i in range(n):
    sumA += A[i]
    sumB += B[i]

for i in range(n):
    if A[i] < B[i]:
        sumAB += int((B[i] - A[i]) / 2 + 0.5)

if sumAB <= sumB - sumA:
    print("Yes")
else:
    print("No")

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

for i in range(n):
    sumA = A[i] + sumA
    sumB = B[i] + sumB

if sumA < sumB:
    print("Yes")
else:
    print("No")


Fixed submission:

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

sumA = 0
sumB = 0
sumAB = 0

for i in range(n):
    sumA += A[i]
    sumB += B[i]

for i in range(n):
    if A[i] < B[i]:
        sumAB += int((B[i] - A[i]) / 2 + 0.5)

if sumAB <= sumB - sumA:
    print("Yes")
else:
    print("No")

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

for i in range(n):
    sumA = A[i] + sumA
    sumB = B[i] + sumB

if sumA < sumB:
    print("Yes")
else:
    print("No")


Fixed submission:

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

sumA = 0
sumB = 0
sumAB = 0

for i in range(n):
    sumA += A[i]
    sumB += B[i]

for i in range(n):
    if A[i] < B[i]:
        sumAB += int((B[i] - A[i]) / 2 + 0.5)

if sumAB <= sumB - sumA:
    print("Yes")
else:
    print("No")