Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
K = int(input())
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)


Fixed submission:
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)

Buggy python submission (verdict: Runtime Error):
N = int(input())
K = int(input())
S = input()
s1 = S[:K - 1]
s2 = S[K + 1:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)


Fixed submission:
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)

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

if S[K - 1] == 'A':
  s = S.replace('A', 'a')

elif S[K - 1] == 'B':
  s = S.replace('B', 'b')

else:
  s = S.replace('C', 'c')

print(s)


Fixed submission:
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)

Buggy python submission (verdict: Runtime Error):
import fileinput

if __name__ == '__main__':
  for line in fileinput.input():
    tokens = list(map(int, line.strip().split()))
    N, K, S = tokens[0], tokens[1], tokens[2]


if S[K - 1] == 'A':
  s = S.replace('A', 'a')

elif S[K - 1] == 'B':
  s = S.replace('B', 'b')

else:
  s = S.replace('C', 'c')

print(s)


Fixed submission:
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)

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

if S[K - 1] == 'A':
  s = S.replace('A', 'a')

elif S[K - 1] == 'B':
  s = S.replace('B', 'b')

else:
  s = S.replace('C', 'c')

print(s)


Fixed submission:
nums = input().split()
N = int(nums[0])
K = int(nums[1])
S = input()
s1 = S[:K - 1]
s2 = S[K:]

if S[K - 1] == 'A':
    s = s1 + 'a' + s2

elif S[K - 1] == 'B':
    s = s1 + 'b' + s2

else:
    s = s1 + 'c' + s2

print(s)
Buggy python submission (verdict: Runtime Error):
def month(num):
    if 0 < num <= 12:
        return True
    else:
        return False


S = input()
first = int(S[:2])
second = int(S[2:])

if month(first)
    if month(second):
        print('AMBIGUOUS')
    else:
        print('MMYY')

elif not month(first) and month(second):
    print('YYMM')

else:
    print('NA')





Fixed submission:
def month(num):
    if 0 < num <= 12:
        return 1
    else:
        return 0


S = input()
first = int(S[:2])
second = int(S[2:])

if month(first) == 1 and month(second) == 1:
    print('AMBIGUOUS')

elif month(first) == 1 and month(second) == 0:
    print('MMYY')

elif month(first) == 0 and month(second) == 1:
    print('YYMM')

else:
    print('NA')
Buggy python submission (verdict: Runtime Error):
a, b = int(input())
if (a+b)%2 == 0:
    print(abs(a+b)//2)
else:
    print("IMPOSSIBLE")

Fixed submission:
a, b = map(int, input().split())
if (a+b)%2 == 0:
    print(abs(a+b)//2)
else:
    print("IMPOSSIBLE")
Buggy python submission (verdict: Time Limit Exceeded):
n, q = map(int, input().split())
S = input()
lr = []
ans = []
for i in range(q):
    LR = list(map(int, input().split()))
    lr.append(LR)

for i in range(q):
    s = S.count("AC", lr[i][0]-1, lr[i][1])
    print(s)

Fixed submission:
n, q = map(int, input().split())
S = input()
lr = []
s = [0]*(n+1)
count = 0

for i in range(q):
    LR = list(map(int, input().split()))
    lr.append(LR)

for i in range(n-1):
    if S[i:i+2] == "AC":
        count += 1
        s[i+1] = count
    else:
        s[i+1] = s[i]
        
for i in range(q):
    print(s[lr[i][1] - 1] - s[lr[i][0] - 1])

Buggy python submission (verdict: Time Limit Exceeded):
n, q = map(int, input().split())
S = input()
ans = []
for i in range(q):
    l, r = map(int, input().split())
    s = S.count("AC", l-1, r)
    ans.append(s)
for i in ans:
    print(i)

Fixed submission:
n, q = map(int, input().split())
S = input()
lr = []
s = [0]*(n+1)
count = 0

for i in range(q):
    LR = list(map(int, input().split()))
    lr.append(LR)

for i in range(n-1):
    if S[i:i+2] == "AC":
        count += 1
        s[i+1] = count
    else:
        s[i+1] = s[i]
        
for i in range(q):
    print(s[lr[i][1] - 1] - s[lr[i][0] - 1])
Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
ans = []
for i in range(1, min(a, b)):
    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):
a, b, k = map(int, input().split())
ans = []
for i in range(1, max(a, b)):
    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: Time Limit Exceeded):
s = input()
count = 0
while True:
    if "01" in s:
        count += 2 * s.count("01")
        s = s.replace("01", "")
    elif "10" in s:
        count += 2 * s.count("10")
        s = s.replace("10", "")
    else:
        break
print(count)

Fixed submission:
s = input()
print(min(s.count("0"), s.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
count = 0
while True:
    if "01" in s:
        s = s.replace("01", "", 1)
        count += 2
    elif "10" in s:
        s = s.replace("10", "", 1)
        count += 2
    else:
        break
print(count)

Fixed submission:
s = input()
print(min(s.count("0"), s.count("1"))*2)
Buggy python submission (verdict: Runtime Error):
def judge(n):
    if n % 2 == 0:
        return n / 2
    else:
        return 3*n + 1

s = int(input())
ans = 1

while s != 4 and s != 2 and s != 1:
    s = judge(s)
    ans += 1

print(ans+3)

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

print(x[0] * x[1] // 2)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ans = 0

while n > ans:
    ans += ans
print(ans)

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

while n > ans:
    ans += 111
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
x = []
b = 0
ans = 0

for i in range(n):
    x.append(a[i] - i-1)
x = sorted(x)


if n%2 == 0:
    b = (x[n//2]-x[(n-1)//2])/2
else:
    b = (x[(n//2)])

for i in range(n):
    ans += abs(a[i]-b-i-1)

print(ans)

Fixed submission:
n = int(input())

if n % 2 == 0:
    print(n)
else:
    print(n*2)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
x = 1
while x % 2 != 0 or x % n != 0:
    x += 1
print(x)

Fixed submission:
n = int(input())

if n % 2 == 0:
    print(n)
else:
    print(n*2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = str(n)
x = 0

for i in s:
    x += int(i)
print(x)
if n % x == 0:
    print("Yes")
else:
    print("No")

Fixed submission:
s = str(input())
ans = s.count("+") - s.count("-")

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

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

for i in a:
    x = i%2
    if x != 0:
        count += 1
    else:
        continue

if count==n:
    print(0)
else:
    print(n)

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

for i in range(n):
    while a[i]%2 == 0:
        a[i] = a[i]//2
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
def solv():
    n = int(input())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    ans = 0

    for i in range(n):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i+1],0))
    return print(ans)

solv()


Fixed submission:
def solv():
    n = int(input())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    ans = 0

    for i in range(n):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i],0))
    return print(ans)

solv()

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

    for i in range(n+1):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i+1],0))
    return print(ans)

solv()

Fixed submission:
def solv():
    n = int(input())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    ans = 0

    for i in range(n):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i],0))
    return print(ans)

solv()

Buggy python submission (verdict: Runtime Error):

def solv():
    n = int(input())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    ans = 0

    for i in range(n+1):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i+1],0))
    return print(ans)

solve()

Fixed submission:
def solv():
    n = int(input())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    ans = 0

    for i in range(n):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i],0))
    return print(ans)

solv()

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

    for i in range(n+1):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i+1],0))
    print(ans)

solve()


Fixed submission:
def solv():
    n = int(input())
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))
    ans = 0

    for i in range(n):
        x = A[i] + A[i+1]
        ans += min(x,B[i])
        A[i+1] = min(A[i+1],max(x-B[i],0))
    return print(ans)

solv()
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input.split())


#iから進める場所をリストにして保管
edges = {i:[] for i in range(1,N+1)}
for i in range(M):
  a,b = [int(a) for a in input().split()]
  edges[a].append(b)
  edges[b].append(a)


#深さ優先探索
def dfs(list):
    #lst(通過点)の数がN(頂点数)と等しくなったら探索終了（成功）
  if len(list) == N:
    return 1
  else:
    a = list[-1]
    #lstの最後尾（現在地）が次に進める場所をnextとしてリスト化
    #nextに以前通った場所が入っていないか確認
    next = [n for n in edges[a] if n not in list]
    #次に進める場所がなくなったら探索終了（失敗）
    if len(next) == 0:
      return 0

    total = 0
    #再帰でさらに探索
    for n in next:
      total += dfs(list + [n])

    return total


ans = dfs([1])

print(ans)


Fixed submission:
N,M = [int(a) for a in input().split()]
edges = {i:[] for i in range(1,N+1)}
for i in range(M):
  a,b = [int(a) for a in input().split()]
  edges[a].append(b)
  edges[b].append(a)

def search(lst):
  if len(lst) == N:
    return 1
  else:
    a = lst[-1]
    next = [n for n in edges[a] if n not in lst]
    if len(next) == 0:
      return 0

    tot = 0
    for n in next:
      tot += search(lst + [n])
    
    return tot


ans = search([1])

print(ans)

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
edges = {i:[] for i in range(1,M+1)}
for i in range(M):
    a,b = map(int,input().split())
    edges[a].append(b)
    edges[b].append(a)

#深さ優先探索
def dfs(list):
    #lst(通過点)の数がN(頂点数)と等しくなったら探索終了（成功）
    if len(list) == N:
        return 1
    else:
        x = list[-1]
        #lstの最後尾（現在地）が次に進める場所をnextとしてリスト化
        #nextに以前通った場所が入っていないか確認
        next = [n for n in edges[x] if n not in list]
        #次に進める場所がなくなったら探索終了（失敗）
        if len(next) == 0:
          return 0

        total = 0
        #再帰でさらに探索
        for n in next:
          total += dfs(list + [n])

        return total

Fixed submission:
N,M = [int(a) for a in input().split()]
edges = {i:[] for i in range(1,N+1)}
for i in range(M):
  a,b = [int(a) for a in input().split()]
  edges[a].append(b)
  edges[b].append(a)

def search(lst):
  if len(lst) == N:
    return 1
  else:
    a = lst[-1]
    next = [n for n in edges[a] if n not in lst]
    if len(next) == 0:
      return 0

    tot = 0
    for n in next:
      tot += search(lst + [n])
    
    return tot


ans = search([1])

print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
count = 0
count_list = []

for i in range(len(s)):
    if s[i] == "I":
        count += 1
        count_list.append(count)
    else:
        count -= 1
        count_list.append(count)

print(max(count_list,0))

Fixed submission:
n = int(input())
s = input()
count = 0
count_list = [0]

for i in range(len(s)):
    if s[i] == "I":
        count += 1
        count_list.append(count)
    else:
        count -= 1
        count_list.append(count)

print(max(count_list))
Buggy python submission (verdict: Runtime Error):
n = int(input())

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

m = int(input())

drink_num_time = []
drink_time = []

for i in range(m):
    drink_num_time.append(list(map(int,input().split())))

normal_time = sum(time_list)


for i in range(m):
    drink_time.append(normal_time+drink_num_time[i][1]-time_list[i])

for i in range(m):
    print(drink_time[i])


Fixed submission:
n = int(input())

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

m = int(input())

drink_num_time = []
drink_time = []

for i in range(m):
    drink_num_time.append(list(map(int,input().split())))

normal_time = sum(time_list)


for i in range(m):
    drink_time.append(normal_time+drink_num_time[i][1]-time_list[(drink_num_time[i][0])-1])

for i in range(m):
    print(drink_time[i])
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x = map(int,input().split())
count = 0

for i in range(a,b+1):
    if i % x == 0:
        count += 1
    else:
        pass

print(count)

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

if a+b = c or a+c = b or b+c = a:
    print("Yes")
else:
    print("No")

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

if a+b == c or b+c == a or a+c == b:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
list = []

for i in range(3):
    list.append(int(input()))

area = (list[0]+list[1])*list[2]/2)


print(int(area))

Fixed submission:
a = int(input())
b = int(input())
h = int(input())

def area():
    return (a+b)*h/2

print(int(area()))
Buggy python submission (verdict: Runtime Error):
sa = list(reversed(input()))
sb = list(reversed(input()))
sc = list(reversed(input()))

turn = sa.pop()

while True:
    if (turn == "a" and not sa) or (turn == "b" and not sb) or (turn == "c" and not sc):
        break
    elif turn == "a":
        turn = sa.pop()
    elif turn == "b":
        turn = sb.pop()
    else turn == "c":
        turn = sc.pop()

print(turn.upper())


Fixed submission:
sa = list(reversed(input()))
sb = list(reversed(input()))
sc = list(reversed(input()))

turn = sa.pop()

while True:
    if (turn == "a" and not sa) or (turn == "b" and not sb) or (turn == "c" and not sc):
        break
    elif turn == "a":
        turn = sa.pop()
    elif turn == "b":
        turn = sb.pop()
    else:
        turn = sc.pop()

print(turn.upper())
Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
x = int(input())
y = int(input())

price = 0

for i in range(1,n+1):
    if i < k+1:
        price += x
    elif:
        price += y

print(price)

Fixed submission:
n = int(input())
k = int(input())
x = int(input())
y = int(input())

price = 0

for i in range(1,n+1):
    if i < k+1:
        price += x
    else:
        price += y

print(price)
Buggy python submission (verdict: Runtime Error):
n = int(input()

total = 0

for i in range(n+1):
    total += i

print(total)

Fixed submission:
n = int(input())
counter = 1
number = 0
for i in range(1,n+1):
    number += counter
    counter += 1

print(number)

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

total = 0

for i in range(n+1):
    total += i

print(total)

Fixed submission:
n = int(input())
counter = 1
number = 0
for i in range(1,n+1):
    number += counter
    counter += 1

print(number)

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

total = 0

for i in range(n+1):
    total += i

print(total)

Fixed submission:
n = int(input())
counter = 1
number = 0
for i in range(1,n+1):
    number += counter
    counter += 1

print(number)
Buggy python submission (verdict: Runtime Error):
s = input()
s_list = []
input_list = []

for i in range(len(s)):
    s_list.append(s[i])

for i2 in range(len(s)):
    if s_list[i2] == "0":
        input_list.append("0")
    elif s_list[i2] == "1":
        input_list.append("1")
    elif s_list[i2] == "B" and input_list != 0:
        input_list.pop(-1)
    else:
        pass

for i3 in range(len(input_list)):
    print(input_list[i3],end="")


Fixed submission:
s = input()
s_list = []
input_list = []

for i in range(len(s)):
    s_list.append(s[i])

for i2 in range(len(s)):
    if s_list[i2] == "0":
        input_list.append("0")
    elif s_list[i2] == "1":
        input_list.append("1")
    elif input_list == []:
      pass
    else:
      input_list.pop(-1)
      

for i3 in range(len(input_list)):
    print(input_list[i3],end="")
Buggy python submission (verdict: Runtime Error):
list = list(map(int,input().split()))

five = 0
seven = 0

for i in list:
  if i == 5:
    five += 1
  elif i == 7:
    seven += 1
  else:
      pass

if seven == 1 and five == 2:
  print(TRUE)
else:
    print(NO)

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

if list == [5,5,7]:
    print("YES")
elif list == [5,7,5]:
    print("YES")
elif list == [7,5,5]:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
n,l = map(int,input().split())
list = []

for i in range(n):
    word = input()
    list.append(word)

list_connect = "".join(sorted(list))


print(list_connect)

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

if list == [5,5,7]:
    print("YES")
elif list == [5,7,5]:
    print("YES")
elif list == [7,5,5]:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
n,l = map(int,input().split())
list = []

for i in range(n):
    word = input()
    list.append(word)

list_connect = "".join(sorted(list))


print(list_connect)


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

if list == [5,5,7]:
    print("YES")
elif list == [5,7,5]:
    print("YES")
elif list == [7,5,5]:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
n,l = map(int,input().split())
list = []

for i in range(n):
    word = input()
    list.append(word)

list_connect = "".join(sorted(list))


print(list_connect)

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

if list == [5,5,7]:
    print("YES")
elif list == [5,7,5]:
    print("YES")
elif list == [7,5,5]:
    print("YES")
else:
    print("NO")

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

if list == [5,5,7]:
    print(YES)
elif list == [5,7,5]:
    print(YES)
elif list == [7,5,7]:
    print(YES)
else:
    print(NO)

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

if list == [5,5,7]:
    print("YES")
elif list == [5,7,5]:
    print("YES")
elif list == [7,5,5]:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
g=raw_input().split()
a=int(g[0])
b=int(g[1])
if a%2==b%2:
  print((a+b)/2)
else:
  print("IMPOSSIBLE")

Fixed submission:
g=raw_input().split()
a=int(g[0])
b=int(g[1])
if a%2==b%2:
  print((a+b)/2)
else:
  print("IMPOSSIBLE")

Buggy python submission (verdict: Runtime Error):
g=raw_input().split()
a=int(g[0])
b=int(g[1])
if a%2=b%2:
  print((a+b)/2)
else:
  print("IMPOSSIBLE")

Fixed submission:
g=raw_input().split()
a=int(g[0])
b=int(g[1])
if a%2==b%2:
  print((a+b)/2)
else:
  print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
n=int(raw_input())
g=raw_input().split()
a=[int(x) for x in g]
g=raw_input().split()
b=[int(x) for x in g]
#n=len()
acc=0
for i in range(n):
	inc=min(a[i],b[i])
	a[i]-=inc
	b[i]-=inc
	acc+=inc
	print(a,b,inc)
	inc=min(a[i+1],b[i])
	a[i+1]-=inc
	b[i]-=inc
	acc+=inc
	print(a,b,inc)
print(acc)

Fixed submission:
n=int(raw_input())
g=raw_input().split()
a=[int(x) for x in g]
g=raw_input().split()
b=[int(x) for x in g]
#n=len()
acc=0
for i in range(n):
	inc=min(a[i],b[i])
	a[i]-=inc
	b[i]-=inc
	acc+=inc
	inc=min(a[i+1],b[i])
	a[i+1]-=inc
	b[i]-=inc
	acc+=inc
print(acc)
Buggy python submission (verdict: Runtime Error):
[n,m]=map(int,raw_input().split())
l,r=1,n
for i in range(m):
	[li,ri]=map(int,raw_input().split())
	l = max(li, l)
	r = min(ri, r)
ans=l-r+l
print(ans if ans > 0 else 0)

Fixed submission:
[a,b]=map(int,raw_input().split())

if a >= 13:
	print b
elif a >= 6:
	print b/2
else:
	print 0

Buggy python submission (verdict: Runtime Error):
[r,d,x0]=map(int,raw_input().split())

a = [x0]
for i in range(10):
	a += [r * a[-1] - d]
	print a[-1]


Fixed submission:
[a,b]=map(int,raw_input().split())

if a >= 13:
	print b
elif a >= 6:
	print b/2
else:
	print 0
Buggy python submission (verdict: Runtime Error):
antenna = []
for i in range(5):
  antenna[i] = int(input())
k = int(input())
if k < max(antenna) - min(antenna):
  print("Yay!")
else:
  print(":(")

Fixed submission:
antenna = []
for i in range(5):
  antenna.append(int(input()))
k = int(input())
if k >= max(antenna) - min(antenna):
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
b = input()
if b == "A":
  b = "T"
else if b == "T":
  b = "A"
else if b == "C":
  b = "G"
else if b == "G":
  b = "C"
print(b)

Fixed submission:
b = input()
if b == "A":
  b = "T"
elif b == "T":
  b = "A"
elif b == "C":
  b = "G"
elif b == "G":
  b = "C"
print(b)

Buggy python submission (verdict: Runtime Error):
b = input()
if b[i] == "A":
  b[i] = "T"
else if b[i] == "T":
  b[i] = "A"
else if b[i] == "C":
  b[i] = "G"
else if b[i] == "G":
  b[i] = "C"
print(b)

Fixed submission:
b = input()
if b == "A":
  b = "T"
elif b == "T":
  b = "A"
elif b == "C":
  b = "G"
elif b == "G":
  b = "C"
print(b)

Buggy python submission (verdict: Runtime Error):
b = input()
for i in b:
  if b[i] == "A":
    b[i] = "T"
  else if b[i] == "T":
    b[i] = "A"
  else if b[i] == "C":
    b[i] = "G"
  else if b[i] == "G":
    b[i] = "C"
print(b)

Fixed submission:
b = input()
if b == "A":
  b = "T"
elif b == "T":
  b = "A"
elif b == "C":
  b = "G"
elif b == "G":
  b = "C"
print(b)

Buggy python submission (verdict: Runtime Error):
b = input()
for i in b:
  if b[i] == "A":
    b[i] = "T"
  if b[i] == "T":
    b[i] = "A"
  if b[i] == "C":
    b[i] = "G"
  if b[i] == "G":
    b[i] = "C"
print(b)

Fixed submission:
b = input()
if b == "A":
  b = "T"
elif b == "T":
  b = "A"
elif b == "C":
  b = "G"
elif b == "G":
  b = "C"
print(b)
Buggy python submission (verdict: Runtime Error):
date = list(map(int, input().split("/")))
if date[0] >= 2019:
	if date[1] >= 5:
		print("TBD")
    else:
      	print("Heisei")
else:
	print("Heisei")


Fixed submission:
date = list(map(int, input().split("/")))
if date[0] >= 2019 and date[1] >= 5:
	print("TBD")
else:
  print("Heisei")

Buggy python submission (verdict: Runtime Error):
date = map(int, input().split("/"))
if date[0] > 2019:
	if date[1] > 5:
		print("Heisei")
else:
	print("TBD")


Fixed submission:
date = list(map(int, input().split("/")))
if date[0] >= 2019 and date[1] >= 5:
	print("TBD")
else:
  print("Heisei")