Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# AtCoder Beginner Contest 121
# https://atcoder.jp/contests/abc121
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    A, B = i2nn()
    n = A
    for i in range(A+1, B+1):
        n ^= i
    print(n)

main()

Fixed submission:
# AtCoder Beginner Contest 121
# https://atcoder.jp/contests/abc121
import sys
#import numpy as np

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main_lte():
    A, B = i2nn()
    n = A
    for i in range(A+1, B+1):
        n ^= i
    print(n)

# t桁目
def calc_t(n, t):
    d = n % (2**t)
    h = 2**(t-1)
    if d >= h and d % 2 == 0:
        return h
    else:
        return 0

# 0～n の xor
def calc_old(n):
    ans = 0
    # 10^3  < 2^10   # 1000 < 1024
    # 10^12 < 2^40
    # 1桁目
    d = n % 4
    if d == 1 or d == 2:
        ans += 1
    # 2桁目
    d = n % 4
    if d == 2:
        ans += 2
    # 3桁目
    d = n % 8
    if d == 4 or d == 6:
        ans += 4
    # 4桁目
    d = n % 16
    if d == 8 or d == 10 or d == 12 or d == 14:
        ans += 8
    return ans

def calc(n):
    ans = 0
    # 1桁目
    d = n % 4
    if d == 1 or d == 2:
        ans += 1
    # 2桁目以降
    for t in range(2, 40+1):
        ans += calc_t(n, t)
    return ans

# (A^...^B)
# = (1^...^A-1) ^ (1^...^A-1) ^ (A^...^B)
# = (1^...^A-1) ^ (1^...^B)
def main():
    A, B = i2nn()
    n = calc(A-1) ^ calc(B)
    print(n)

main()
Buggy python submission (verdict: Runtime Error):
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]

ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]

i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())

ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]

def main(N, M, PYm):
    # 県番号pと市誕生年yから認識番号を得られる辞書
    # dic[p][y] -> 認識番号
    dic = {}
    # 県ごとに、市誕生年を昇順ソートし、認識番号を1,2,...と対応づける
    # dic2[p] -> [(1, sorted_y1), (2, sorted_y2), ...]
    # dic2tmp[p] -> [y1, y2, ...]
    #dic2 = {}
    dic2tmp = {}
    for p in range(N+1):
        dic[p] = {}
        #dic2[p] = []
        dic2tmp[p] = []
    for p, y in PYm:
        dic2tmp[p].append(y)
    for p in range(N+1):
        dic2tmp[p].sort()
        nby = [(i+1, y) for i, y in enumerate(dic2tmp[p])]
        #dic2[p] = nby
        for nb, y in nby:
            dic[p][y] = nb
    # 表示
    for p, y in PYm:
        nb = dic[p][y]
        print('%06d%06d' % (p, nb))
N, M = i2nn()
PYs = ss2nnn(ii2ss())
main(N, M, PYs)


Fixed submission:
import sys
 
s2nn = lambda s: [int(c) for c in s.split(' ')]
 
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
 
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
 
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
 
def main(N, M, PYm):
    # 県番号pと市誕生年yから認識番号を得られる辞書
    # dic[p][y] -> 認識番号
    dic = {}
    # 県ごとに、市誕生年を昇順ソートし、認識番号を1,2,...と対応づける
    # dic2[p] -> [(1, sorted_y1), (2, sorted_y2), ...]
    # dic2tmp[p] -> [y1, y2, ...]
    #dic2 = {}
    dic2tmp = {}
    for p in range(N+1):
        dic[p] = {}
        #dic2[p] = []
        dic2tmp[p] = []
    for p, y in PYm:
        dic2tmp[p].append(y)
    for p in range(N+1):
        dic2tmp[p].sort()
        nby = [(i+1, y) for i, y in enumerate(dic2tmp[p])]
        #dic2[p] = nby
        for nb, y in nby:
            dic[p][y] = nb
    # 表示
    for p, y in PYm:
        nb = dic[p][y]
        print('%06d%06d' % (p, nb))

N, M = i2nn()
PYs = ss2nnn(ii2ss(M))
main(N, M, PYs)
Buggy python submission (verdict: Runtime Error):
# python template for atcoder1 
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

print(input % 1000)

Fixed submission:
num = int(input())
if num % 1000 == 0:
  print(0)
else:
  print(1000 - num % 1000)
Buggy python submission (verdict: Runtime Error):
import collections
# python template for atcoder
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

n = int(input())
arr = list(map(int, input().split()))
dic = collections.Counter(arr)

for s in ('AC', 'WA', 'TLE', 'RE'):
  print(s + ' x ' + str(dic[s]))

Fixed submission:
n = int(input())
dic = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for i in range(n):
  s = input()
  dic[s] += 1
  
for s in ('AC', 'WA', 'TLE', 'RE'):
  print(s + ' x ' + str(dic[s]))
Buggy python submission (verdict: Runtime Error):
def main():
  a = []
  ans = "No"
  hit_examples = [[0, 1, 2], [3, 4, 5], [6, 7, 8], [0, 3, 6], [1, 4, 7], [2, 5, 8], [0, 4, 8], [2, 4, 6]]
  for i in range(3):
    a.extend(list(map(int, input().split())))
  n = int(input())
  b = []
  for i in range(n):
    b.append(int(input()))
  for b_value in b:
    for i in range(len(a)):
      if b_value == a[i]:
        a[i] = -1

  for hit_example in hit_examples:
    cnt = 0
    for i in range(len(a)):
      if a[i] == -1 and i in hit_example:
        cnt += 1
      if cnt == 3:
        ans = "Yes"
        print(ans)
        return
  print(ans)

if __name__ == '__main__':
  main()

Fixed submission:
n = int(input())
ans = 0
if n % 2 == 0:
  ans = int(n / 2)
else:
  ans = int(n / 2) + 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
cnt = 1
while True:
  if n <= k**cnt + 1:
    cnt += 1
print(cnt)

Fixed submission:
n, k = map(int, input().split())
cnt = 1
while True:
  if n <= k**cnt - 1:
    break
  cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
cnt = 1
while True:
  if n <= k**cnt + 1:
    cnt++
print(cnt)

Fixed submission:
n, k = map(int, input().split())
cnt = 1
while True:
  if n <= k**cnt - 1:
    break
  cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
ans = None
for i in a:
  if a.find(i) != -1:
    ans = 'NO'
    break
else:
  ans = 'YES'
print(ans)
  

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = None
for i in range(len(a) - 1):
  if a[i] == a[i + 1]:
    ans = 'NO'
    break
else:
  ans = 'YES'
print(ans)
Buggy python submission (verdict: Runtime Error):
x=int(input(''))
if x%1000=0:
  print(0)
else:
  print(1000-x%1000)
  

Fixed submission:
x=int(input(''))
if x%1000==0:
  print(0)
else:
  print(1000-x%1000)
Buggy python submission (verdict: Runtime Error):
x=int(input(''))
y=[0]*x
for i in range(x):
  y[i]=input('')
a=0
w=0
t=0
r=0
for i in range(x):
  if y[i]==AC:
    a=a+1
  elif y[i]==WA:
    w=w+1
  elif y[i]==TLE:
    t=t+1
  else:
    r=r+1
print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {r}'.format(a,w,t,r))
  

Fixed submission:
x=int(input(''))
y=[0]*x
for i in range(x):
  y[i]=input('')
a=0
w=0
t=0
r=0
for i in range(x):
  if y[i]=='AC':
    a=a+1
  elif y[i]=='WA':
    w=w+1
  elif y[i]=='TLE':
    t=t+1
  else:
    r=r+1
print('AC x {0}\nWA x {1}\nTLE x {2}\nRE x {3}'.format(a,w,t,r))
Buggy python submission (verdict: Runtime Error):
N = input()
if n[-1] in ('0','1','6','8'):
	print('pon')
else if n[-1] =="3":
	print('bon')
else:
	print("bon")
    

Fixed submission:
N = input()
if N[-1] in ('0','1','6','8'):
    print('pon')
elif N[-1] == '3':
    print('bon')
else:
    print('hon')
Buggy python submission (verdict: Runtime Error):
alist=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k=input()

print(alist[k-1])

Fixed submission:
a=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k=int(input())

print(a[k-1])
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))

ans=0

for x,y in zip(a,a[1:]):
  if y == x+1:
    ans += c[x-1]
    
print(sum(y)+ans)

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

ans=0

for x,y in zip(a,a[1:]):
  if y == x+1:
    ans += c[x-1]
    
print(sum(b)+ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
H=list(map(int,input().split()))

cnt = 0

for i in range(N):
  if H[i] >= H[1+i]:
    cnt += 1

print(cnt)

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

cnt = [0]*n

for i in reversed(range(n-1)):
  if h[i] >= h[i+1]:
    cnt[i] += cnt[i+1] + 1
    
print(max(cnt))
Buggy python submission (verdict: Runtime Error):
n=input()
ans=0
for i in range(1,n+1):
  if len(str(i)) % 2 == 1:
    ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0

for i in range(1, n + 1):
  if len(str(i)) % 2 == 1:
    ans += 1

print(ans)

Buggy python submission (verdict: Runtime Error):
n=input()
ans=0
for i in range(1,n+1):
  if len(str(i)) % 2 == 1:
      ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0

for i in range(1, n + 1):
  if len(str(i)) % 2 == 1:
    ans += 1

print(ans)

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

for i in range(1,n+1):
  if len(str(i)) % 2 == 1:
      ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0

for i in range(1, n + 1):
  if len(str(i)) % 2 == 1:
    ans += 1

print(ans)

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

for i in range(1,n+1):
  if len(str(i)) % 2 == 1:
      ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0

for i in range(1, n + 1):
  if len(str(i)) % 2 == 1:
    ans += 1

print(ans)

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

for i in range(1,n):
  if len(str(i)) % 2 == 1:
      ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = 0

for i in range(1, n + 1):
  if len(str(i)) % 2 == 1:
    ans += 1

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

K=abs(A+B)/2

if abs(A+B) % 2 == 0;
	print(K)
else;
	print("IMPOSSIBLE")

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

K=abs(A+B)/2

if abs(A+B) % 2 == 0:
  print(int(K))
else:
  print("IMPOSSIBLE")

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

K=(B-A)/2

if (B-A) % 2 == 0;
	print(K)
else;
	print("IMPOSSIBLE")

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

K=abs(A+B)/2

if abs(A+B) % 2 == 0:
  print(int(K))
else:
  print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
N=int(input())
P=list(map(int,input().split()))

if P[0] < P[N-1] and P[N-1] > P[2] and P[N-2] > P[0]:
  print("NO")
else:
  print("YES")

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

sort_p=sorted(p)
cnt=0

#i,jにpとソートしたpを代入して比較
for i,j in zip(p,sort_p):
  if i != j:
    cnt += 1

if cnt <= 2:
  print("YES")
else:
  print("NO")

Buggy python submission (verdict: Runtime Error):
N=int(input())
P=[int(input()) for i in range(N)]

if P[0] > P[N-1] and P[N-1] < P[2] and P[3] < P[0]:
  print("YES")
else:
  print("NO")

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

sort_p=sorted(p)
cnt=0

#i,jにpとソートしたpを代入して比較
for i,j in zip(p,sort_p):
  if i != j:
    cnt += 1

if cnt <= 2:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
N=int(input())
D=int(input())

print((N+D*2)//(D*2+1))

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

print((N+2*D) // (2*D+1))

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

print((N+D*2)/(D*2+1))

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

print((N+2*D) // (2*D+1))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(input()) for i range(N)]

x = sorted(A)

for i in range(N):
  if A[i] == x[N-1]:
    print(x[N-2])
  else:
    print(x[N-1])

Fixed submission:
N = int(input())
A = [int(input()) for i in range(N)]

x = sorted(A)

for i in range(N):
  if A[i] == x[N-1]:
    print(x[N-2])
  else:
    print(x[N-1])

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=[int(input()) for i range(N)]

x=sorted(A)

for i in range(N):
  if A[i] == x[N-1]:
    print(x[N-2])
  else:
    print(x[N-1])

Fixed submission:
N = int(input())
A = [int(input()) for i in range(N)]

x = sorted(A)

for i in range(N):
  if A[i] == x[N-1]:
    print(x[N-2])
  else:
    print(x[N-1])
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
if a==b or b==c or c==d:
  print("Bad")
else:
  print("Yes")


Fixed submission:
s=list(input())
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
a,b,c,d=int(input().split())
if a==b or b==c or c==d:
  print("Bad")
else:
  print("Yes")


Fixed submission:
s=list(input())
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
s=list(map(int,input().split()))
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Yes")


Fixed submission:
s=list(input())
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Good")

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
if a==b or b==c or c==d:
  print("Bad")
else:
  print("Yes")


Fixed submission:
s=list(input())
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Good")
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
if k == 1:
  print(0)
else:
  print(x-y)

Fixed submission:
n,k=map(int,input().split())
if k == 1:
  print(0)
else:
  print(n-k)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c)

Fixed submission:
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

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

Fixed submission:
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

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

a = P + Q
b = P + R
c = Q + R
d = Q + P
e = R + Q
f = R + P

mn_list = list[a,b,c,d,e,f]
mn = min(mn_list)

print(mn)

Fixed submission:
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

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

a = P + Q
b = P + R
c = Q + R
d = Q + P
e = R + Q
f = R + P

mn_list = list[a,b,c,d,e,f]
mn = min(mn_list)

print(mn)

Fixed submission:
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

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

a = P + Q
b = P + R
c = Q + R
d = Q + P
e = R + Q
f = R + P

list[a,b,c,d,e,f]
mn = min(list)

print(mn)

Fixed submission:
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

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

a = P + Q
b = P + R
c = Q + R
d = Q + P
e = R + Q
f = R + P

list[a,b,c,d,e,f]

print(min(list))

Fixed submission:
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))
Buggy python submission (verdict: Runtime Error):
A,P = map(int(input().split())

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(int(apple_pie))

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

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(int(apple_pie))

Buggy python submission (verdict: Runtime Error):
A,P = map(int(input(),split())

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(int(apple_pie))

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

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(int(apple_pie))

Buggy python submission (verdict: Runtime Error):
A,P = map(int(input(),split())

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(apple_pie)

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

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(int(apple_pie))

Buggy python submission (verdict: Runtime Error):
apple,apple_piece = map(int(input(),split())

apple_cut = apple * 3

apple_pie = (apple_cut + apple_piece) /2
                 
print(apple_pie)

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

apple_cut = A * 3

apple_pie = (apple_cut + P) /2
                 
print(int(apple_pie))
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B//2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
age = input()
fee = input()

if age >= 13:
	print(fee)
    
elif 6 <= age <= 12:
	print(fee // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
age = map(int,input())
fee = map(int,input())

if age >= 13:
	print(fee)
    
elif 6 <= age <= 12:
	print(fee // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

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

if age >= 13:
	print(fee)
    
elif 6 <= age <= 12:
	print(fee // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
age = input()
fee = input()

if age >= 13:
	print(fee)
    
elif 6 <= age <= 12:
	print(fee // 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

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

if age > 13:
	print(fee)
    
elif 6 <= age <= 12:
	print(fee / 2)

else:
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
age = 12
fee = 1000

if age > 13;
	print(fee)
else if 6 <= age <= 12;
	print(fee / 2)
else;
	print(0)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
age = 12
fee = 1000

if age > 13;
	print(fee)
else;
	print(fee / 2)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)

Buggy python submission (verdict: Runtime Error):
if age > 13;
	print(fee)
else;
	print(fee / 2)

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

if A >= 13:
	print(B)
    
elif 6 <= A <= 12:
	print(B // 2)

else:
	print(0)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
s=input()
s[k-1]=s[k-1].lower()
print("".join(s))


Fixed submission:
n,k=map(int,input().split())
s=list(input())
s[k-1]=s[k-1].lower()
print("".join(s))

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
s=input()
s[k-1]=s[k-1].lower()
print(s)


Fixed submission:
n,k=map(int,input().split())
s=list(input())
s[k-1]=s[k-1].lower()
print("".join(s))
Buggy python submission (verdict: Runtime Error):
a,b,t=map(int,input().split())
int(ans)=(t+0.5)/a*b
print(ans)

Fixed submission:
a,b,t=map(int,input().split())
ans=int((t+0.5)/a)
print(ans*b)
Buggy python submission (verdict: Runtime Error):
N=int(input())
V=list(map(int,input().split()))
C=list(map(int,input().split()))

ans=0

for i in range(N):
  ans += max(0,V[i] - C[i]):
print(ans)

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

ans=0

for i in range(N):
  ans += max(0,V[i] - C[i])
print(ans)

Buggy python submission (verdict: Runtime Error):
N=int(input())
V=[int(input().split()) for i in range(N)]
C=[int(input().split()) for i in range(N)]

for i in range(N):
  if V[i] > C[i]:
    ans += V[i] - C[i]:
    print(ans)

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

ans=0

for i in range(N):
  ans += max(0,V[i] - C[i])
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
m=list(map(int,input().split()))
ans=0

for i in range(n+1):
  if m[0] <= m[i]:
    ans += 1
print(ans)

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

for i in range(1,n):
  if max(m[:i]) <= m[i]:
    ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

s=[a,b,c,d,e,k]

if s[5]-s[0] <= s[6]:
  print("Yay!")
else:
  print(":(")

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("Yay!")
else:
  print(":(")

Buggy python submission (verdict: Runtime Error):
s = [input() for i in range(6)]
if s[5]-s[0] < s[6]:
  print("Yay!")
else:
  print(":(")

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("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
a=input()
s={"A":"T","T":"A","C":"G","G":"C"}
print(a[s])


Fixed submission:
a=input()
s={"A":"T","T":"A","C":"G","G":"C"}
print(s[a])

Buggy python submission (verdict: Runtime Error):
s={"A":"T","T":"A","C":"G","G":"C"}
a=input()
print(a[s])


Fixed submission:
a=input()
s={"A":"T","T":"A","C":"G","G":"C"}
print(s[a])
Buggy python submission (verdict: Runtime Error):
H,W=input().split()
h,w=input().split()

ans=(H-h)*(W-w)

print(ans)

Fixed submission:
H,W=map(int,input().split())
h,w=map(int,input().split())

ans=(H-h)*(W-w)

print(ans)

Buggy python submission (verdict: Runtime Error):
H,W=int(input().split())
h,w=int(input().split())

ans=(H-h)*(W-w)

print(ans)

Fixed submission:
H,W=map(int,input().split())
h,w=map(int,input().split())

ans=(H-h)*(W-w)

print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
ans=[]

if i in range(1,min(a,b)+1):
  if a % i == 0 and b % i == 0:
    ans.append(i)

print(ans[-k])

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

for i in range(1,min(a,b)+1):
  if a % i == 0 and b % i == 0:
    ans.append(i)

print(ans[-k])
Buggy python submission (verdict: Runtime Error):
import datetime

s=input()
h=datetime.date(2019,4,30)

if s <= h:
  print("Heisei")
else:
  print("TBD")

Fixed submission:
s=input()
if s <= "2019/04/30":
  print("Heisei")
else:
  print("TBD")

Buggy python submission (verdict: Runtime Error):
s=input()
if s <= 2019/04/30:
  print("Heisei")
else:
  print("TBD")

Fixed submission:
s=input()
if s <= "2019/04/30":
  print("Heisei")
else:
  print("TBD")
Buggy python submission (verdict: Runtime Error):
N=int(input())
l=list(map(int,input().split()))
l=sorted(l)

if l[-1] < sum([:-1]):
  print("Yes")
else:
  print("No")


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

if l[-1] < sum(l[:-1]):
  print("Yes")
else:
  print("No")