Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n,m,x = map(input().split())

min_money = 999999999999
for i in range(2**n):
	bag = []
	a = list(map(int,input().split()))
	for j in range(n):
		if ((i >> j) & 1):
			bag.append(a)

	money = 0
	skill = [0] * m
	enogh = [0] * m
	for sub in bag:
		money += sub[0]
		for k in range(1,m+1):
			skill[k-1] += sub[k]
			if skill[k-1] >= x:
				enough[k-1] = 1

	if 0 not in enough and min_money > money:
		min_money = money

if min_money != 999999999999:
	print(min_money)
else:
	print(-1)


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

min_money = 999999999

l=[]
for i in range(n):
	a=list(map(int,input().split()))
	l.append(a)

for i in range(2**n):
	bag = []
	for j in range(n):
		if ((i >> j) & 1):
			bag.append(l[j])

	money = 0
	skill = [0] * m
	enough = [0] * m
	for sub in bag:
		money += sub[0]
		for k in range(1,m+1):
			skill[k-1] += sub[k]
			if skill[k-1] >= x:
				enough[k-1] = 1

	if 0 not in enough and min_money > money:
		min_money = money

if min_money != 999999999:
	print(min_money)
else:
	print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()

c = 0
for i in range(n):
	for j in range(i+1, n):
		for k in range(j+1, n):
			if s[i] != s[j] and s[i] != s[k] and s[j] != s[k] and j-i != k-j:
				c += 1
				# print(s[i], s[j], s[k])
print(c)


Fixed submission:
n=int(input())
s=str(input())
t=len(s)
r=set()
g=set()
b=set()
a=0
for i in range(n):
    if s[i]=='R':
        r.add(i)
    if s[i]=='G':
        g.add(i)
    if s[i]=='B':
        b.add(i)
d=len(r)*len(g)*len(b)
for ri in r:
    for gi in g:
        dist = abs(ri-gi)
        if ri > gi:
            bi = dist + ri
            if bi in b:
                d -= 1
            bi = gi - dist
            if bi in b:
                d -= 1
        else:
            bi = dist + gi
            if bi in b:
                d -= 1
            bi = ri - dist
            if bi in b:
                d -= 1

        if (ri + gi) % 2 == 0:
            bi = (ri+gi)/2
            if bi in b:
                d -= 1
print(d)
Buggy python submission (verdict: Runtime Error):
from collections import deque

k = int(input())
q = deque(range(1, 10))

for i in range(k-1):
    # popをk-1回やる
    x = q.popleft()
    y = int(str(x)[-1])
    if y-1 >= 0:
        print(int(str(x)+str(y-1)))
        q.append(int(str(x)+str(y-1)))
    q.append(int(str(x)+str(x)[-1]))
    if y+1 < 10:
        q.append(int(str(x)+str(y+1)))

print(q[0])




Fixed submission:
a, b, c = list(map(int, input().split()))
print(c,a,b)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = list(map(int, input().split()))

while(True):
    if n % k == 0:
        n = 0
        break

    if k % n == 0:
        break

    new = abs(n-k)
    if new < n:
        n = new
        continue
    else:
        break

print(n)

Fixed submission:
n, k = list(map(int, input().split()))
if n < k:
    print(min(n, k-n))
else:
    print(min(n%k, k-(n%k)))

Buggy python submission (verdict: Time Limit Exceeded):
n, k = list(map(int, input().split()))

if n % k == 0:
    print(0)
    exit()

if k % n == 0:
    print(n)
    exit()

while(True):
    new = abs(n-k)
    if new < n:
        n = new
        continue
    else:
        break

print(n)

Fixed submission:
n, k = list(map(int, input().split()))
if n < k:
    print(min(n, k-n))
else:
    print(min(n%k, k-(n%k)))
Buggy python submission (verdict: Runtime Error):
from collections import deque

k = int(input())
q = deque(range(1, 10))

for i in range(k-1):
    # popをk-1回やる
    x = q.popleft()
    y = int(str(x)[-1])
    if y-1 >= 0:
        print(int(str(x)+str(y-1)))
        q.append(int(str(x)+str(y-1)))
    q.append(int(str(x)+str(x)[-1]))
    if y+1 < 10:
        q.append(int(str(x)+str(y+1)))

    print(q)




Fixed submission:
from collections import deque

k = int(input())
q = deque(range(1, 10))

for i in range(k-1):
    # popをk-1回やる
    x = q.popleft()
    y = int(str(x)[-1])
    if y-1 >= 0:
        q.append(int(str(x)+str(y-1)))
    q.append(int(str(x)+str(x)[-1]))
    if y+1 < 10:
        q.append(int(str(x)+str(y+1)))

print(q[0])
Buggy python submission (verdict: Time Limit Exceeded):
from collections import defaultdict
import math
def comb(n, r):
    if n < r:
        return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

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

count = defaultdict(int)
for a in A:
    count[a] += 1

combi = defaultdict(int)
for a in count:
    combi[a] = comb(count[a],2)

for i in range(n):
    print(sum(list(combi.values())) - combi[A[i]] + comb(count[A[i]]-1, 2))

Fixed submission:
from collections import defaultdict
import math
def comb(n, r):
    if n < r:
        return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

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

count = defaultdict(int)
for a in A:
    count[a] += 1

combi = defaultdict(int)
for a in count:
    combi[a] = comb(count[a],2)

total = sum(list(combi.values()))
for i in range(n):
    print(total - (count[A[i]] - 1))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8


def main():
    N = int(input())
    A = list(map(int, input().split()))

    for i in range(N):
        b = int(input())
        tmp = A[i] - b
        if tmp < 0:
            ans += A[i]
            if A[i + 1] < -tmp:
                ans += A[i + 1]
                A[i + 1] = 0
            else:
                ans += -tmp
                A[i + 1] += tmp
        else:
            ans += b

    print(ans)

if __name__ == "__main__":
    main()


Fixed submission:
# coding: utf-8


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

    for i in range(N):
        tmp = A[i] - B[i]
        if tmp < 0:
            ans += A[i]
            if A[i + 1] < -tmp:
                ans += A[i + 1]
                A[i + 1] = 0
            else:
                ans += -tmp
                A[i + 1] += tmp
        else:
            ans += B[i]

    print(ans)

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
# coding: utf-8

def main():
    N = int(input())
    d = sorted(list(map(int, input().split())))
    ans = 0
    if d[N / 2] != d[N / 2 - 1]:
        ans = d[N / 2] - d[N / 2 - 1]

    print(ans)


if __name__ == "__main__":
    main()


Fixed submission:
# coding: utf-8

def main():
    N = int(input())
    d = sorted(list(map(int, input().split())))
    ans = 0
    if d[N // 2] != d[N // 2 - 1]:
        ans = d[N // 2] - d[N // 2 - 1]

    print(ans)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
print(max(a, b) * 2 - 1)

Fixed submission:
# coding: utf-8
A, B = map(int, input().split())
if A == B:
    print(A * 2)
else:
    print(max(A, B) * 2 - 1)
Buggy python submission (verdict: Runtime Error):
base = input()
a = ['A', 'T']
b = ['G', 'C']
if base in a:
  print([a[0], a[1]][if base == 'A'])
else:
  print([b[0], b[1]][if base == 'G'])

Fixed submission:
base = input()
a = ['A', 'T']
b = ['G', 'C']
if base in a:
  print([a[0], a[1]][base == 'A'])
else:
  print([b[0], b[1]][base == 'G'])
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8


def main():
    A, B, K = map(int, input().split())
    for i in range(A, B + 1):
        if i < A + K or B - K < i:
            print(i)

if __name__ == "__main__":
    main()


Fixed submission:
# coding: utf-8
A, B, K = map(int, input().split())
ans = []
for i in range(K):
    a, b = A + i, B - i
    if a < b:
        ans.extend([a, b])
    elif a == b:
        ans.append(a)
    else:
        break
ans.sort()
for a in ans:
    print(a)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8


def main():
    A, B, K = map(int, input().split())
    for i in range(A, B + 1):
        if i < A + K or B - K < i:
            print(i)

    print(ans)

if __name__ == "__main__":
    main()


Fixed submission:
# coding: utf-8
A, B, K = map(int, input().split())
ans = []
for i in range(K):
    a, b = A + i, B - i
    if a < b:
        ans.extend([a, b])
    elif a == b:
        ans.append(a)
    else:
        break
ans.sort()
for a in ans:
    print(a)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
N = int(input())
S = {}
for _ in range(N):
    s = input()
    if s not in S:
        S[s] = 0
    S[s] += 1
M = int(input())
for _ in range(M):
    s = input()
    if s not in S:
        S[s] = 0
    S[s] -= 1
print(max(*S.values(), 0))

Fixed submission:
# coding: utf-8
N = int(input())
S = {}
for _ in range(N):
    s = input()
    if s not in S:
        S[s] = 0
    S[s] += 1
M = int(input())
for _ in range(M):
    s = input()
    if s not in S:
        S[s] = 0
    S[s] -= 1
T = list(S.values())
T.append(0)
print(max(T))

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
from collections import defaultdict
N = int(input())
S = defaultdict(int)
for _ in range(N):
    S[input()] += 1
M = int(input())
for _ in range(M):
    S[input()] -= 1
print(max(*S.values(), 0))

Fixed submission:
# coding: utf-8
N = int(input())
S = {}
for _ in range(N):
    s = input()
    if s not in S:
        S[s] = 0
    S[s] += 1
M = int(input())
for _ in range(M):
    s = input()
    if s not in S:
        S[s] = 0
    S[s] -= 1
T = list(S.values())
T.append(0)
print(max(T))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
N = int(input())
A = sorted(list(map(int, input().split())), reverse=True)
print(sum(A[::2])-sum([1::2]))

Fixed submission:
# coding: utf-8
N = int(input())
A = sorted(list(map(int, input().split())), reverse=True)
print(sum(A[::2])-sum(A[1::2]))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
a, b = map(int, input().split())
print(['Odd', 'Even'][if a % 2 == 0 or b % 2 == 0])

Fixed submission:
# coding: utf-8
a, b = map(int, input().split())
print(['Odd', 'Even'][a % 2 == 0 or b % 2 == 0])
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
S = int(input().replace(' ', ''))
print(['No', 'Yes'][if S == int(S ** 0.5) ** 2])

Fixed submission:
# coding: utf-8
S = int(input().replace(' ', ''))
print(['No', 'Yes'][S == int(S ** 0.5) ** 2])
Buggy python submission (verdict: Runtime Error):
# coding: utf-8


def main():
    X, Y = map(int, input().split())
    ans = 0
    while (X <= Y){
        x *= 2
        ans += 1
    }
    print(ans)

if __name__ == "__main__":
    main()


Fixed submission:
# coding: utf-8


def main():
    X, Y = map(int, input().split())
    ans = 0
    while X <= Y:
        X *= 2
        ans += 1

    print(ans)

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
div = 10 ** 9 + 7
n = int(input())
ans = 1
for i in range(1, N + 1):
  ans = (ans * i) % div
print(ans)

Fixed submission:
# coding: utf-8
div = 10 ** 9 + 7
n = int(input())
ans = 1
for i in range(1, n + 1):
  ans = (ans * i) % div
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
K, S = map(int, input().split())
ans = 0
for i in range(K + 1):
    if S > 2 * K + i:
        continue
    for j in range(K + 1):
        if S > K + i + j:
            continue
        for k in range(K + 1):
            if i + j + k == S:
                ans += 1
print(ans)


Fixed submission:
# coding: utf-8
K, S = map(int, input().split())
ans = 0
for i in range(K + 1):
    if S - i > 2 * K:
        continue
    elif S - i < 0:
        break
    if S - i > K:
        ans += 2 * K + 1 - S + i
    else:
        ans += S - i + 1
print(ans)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
S = input()
cnt = {}
flg = True
for s in S:
  if s in cnt:
    cnt[s] = 1
  else:
    cnt[s] += 1
for i in cnt.values():
  if j % 2 != 0:
    flg = False
print('Yes' if flg else 'No')

Fixed submission:
# coding: utf-8
S = input()
cnt = {}
flg = True
for s in S:
  if s not in cnt:
    cnt[s] = 1
  else:
    cnt[s] += 1
for i in cnt.values():
  if i % 2 != 0:
    flg = False
print('Yes' if flg else 'No')
Buggy python submission (verdict: Runtime Error):
# coding: utf-8

def main():
    S = input()
    dic = {'N':0, 'S':0, 'E':0, 'W':0}
    ans = 'No'

    for s in S:
        dic[s] += 1

    if (dic['N'] == 0 and dic['S'] == 0) or (dic['N'] > 0 and dic['S'] > 0):
        if (dic['E'] == 0 and dic['W'] == 0) or (dic['E'] > 0 and mp['W'] > 0):
            ans = 'Yes'

    print(ans)

if __name__ == "__main__":
    main()


Fixed submission:
# coding: utf-8

def main():
    S = input()
    dic = {'N':0, 'S':0, 'E':0, 'W':0}
    ans = 'No'

    for s in S:
        dic[s] += 1

    if (dic['N'] == 0 and dic['S'] == 0) or (dic['N'] > 0 and dic['S'] > 0):
        if (dic['E'] == 0 and dic['W'] == 0) or (dic['E'] > 0 and dic['W'] > 0):
            ans = 'Yes'

    print(ans)

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = list(map(int, input().split()))

result = []
for i in range(0, n):
    temp = 0
    for j in range(0, n):
        if i != j:
            temp ^= A[j]
    result += [str(temp)]
print(' '.join(result))

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

total_xor = 0
for a in A:
    total_xor ^= a

result = []
for a in A:
    result += [str(total_xor ^ a)]
print(' '.join(result))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a_list = list(map(int, input().split()))
res = 1
flag0 = False
if 0 in a_list:
  flag0 = True

for i in range(n):
  res = a_list[i]*res
  if res > 1000000000000000000 and flag0==False:
    res = -1
    break

print(res)

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
a_list.sort(reverse=True)
res = 1
flag0 = False
if 0 in a_list:
  res = 0
else:
  for i in range(n):
    res = a_list[i]*res
    if res > 1000000000000000000:
      res = -1
      break

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a_list = list(map(int, input().split()))
res = 1
for i in range(n):
  res = a_list[i]*res
if res > 1000000000000000000:
    print(-1)
else:
  print(res)

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
a_list.sort(reverse=True)
res = 1
flag0 = False
if 0 in a_list:
  res = 0
else:
  for i in range(n):
    res = a_list[i]*res
    if res > 1000000000000000000:
      res = -1
      break

print(res)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a_lst = list(map(int, input().split()))
res_lst = []

for i in range(n):
  cnt = (a_lst.count(i+1))
  print(cnt)

Fixed submission:
import collections

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

cnt = collections.Counter(a_lst)  
for i in range(n):
  print(cnt[i+1])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a_lst = list(map(int, input().split()))
res_lst = []

for i in range(n):
  cnt = (a_lst.count(i+1))
  print(cnt)

Fixed submission:
import collections

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

cnt = collections.Counter(a_lst)  
for i in range(n):
  print(cnt[i+1])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

s = []
for i in range(n):
  k = 0
  for j in range(n):
    if (i==j):
      continue
    k = k^a[j]
  s.append(k)
  
print(*s)

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

x = 0
for i in a:
  x ^= i

s = [x^j for j in a]
  
print(*s)
Buggy python submission (verdict: Runtime Error):
a,p = map(int, input.split())
print((a*3+p) // 2)


Fixed submission:
a,p=map(int,input().split())
print((a*3+p)//2)
Buggy python submission (verdict: Runtime Error):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

x = A + V * T
y = B + W * T

if X >= y:
  print('YES')
else:
  print('NO')

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

x = A + V * T
y = B + W * T

z = A - V * T
w = B - W * T

if A < B:
  if x >= y:
    print('YES')
  else:
    print('NO')
else:
  if z <= w:
    print('YES')
  else:
    print('NO')

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

x_oni = A + V * T
x_kodomo = B + W * T

if x_oni >= X_kodomo:
  print('YES')
else:
  print('NO')


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

x = A + V * T
y = B + W * T

z = A - V * T
w = B - W * T

if A < B:
  if x >= y:
    print('YES')
  else:
    print('NO')
else:
  if z <= w:
    print('YES')
  else:
    print('NO')

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

x_oni = A + V * T
x_kodomo = B + W * T

if x_oni == X_kodomo:
  print('YES')
else:
  print('NO')

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

x = A + V * T
y = B + W * T

z = A - V * T
w = B - W * T

if A < B:
  if x >= y:
    print('YES')
  else:
    print('NO')
else:
  if z <= w:
    print('YES')
  else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
a = input()
if a%10 == 3:
  print('bon')
elif a%10 == 0 or a%10 ==1 or a%10 ==6 or a%10 ==8:
  print('pon')
else:
  print('hon')


Fixed submission:
a = int(input())
if a%10 == 3:
  print('bon')
elif a%10 == 0 or a%10 ==1 or a%10 ==6 or a%10 ==8:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
a = input()
if a%10 == 3:
  print('bon')
elif a%10 == 0 or 1 or 6 or 8:
  print('pon')
else:
  print('hon')


Fixed submission:
a = int(input())
if a%10 == 3:
  print('bon')
elif a%10 == 0 or a%10 ==1 or a%10 ==6 or a%10 ==8:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
a = input()
if a%10 == 3:
  print('bon')
elif a&10 == 0 or 1 or 6 or 8:
  print('pon')
else:
  print('hon')

Fixed submission:
a = int(input())
if a%10 == 3:
  print('bon')
elif a%10 == 0 or a%10 ==1 or a%10 ==6 or a%10 ==8:
  print('pon')
else:
  print('hon')
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split)
count_T = (a-1)//b + 1
count_A = (c-1)//d + 1

if count_T <= count_A:
  print("Yes")
else:
  print("No")

Fixed submission:
a, b, c, d = map(int, input().split())
count_T = (c-1)//b + 1
count_A = (a-1)//d + 1

if count_T > count_A:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
N = int(input())
if int(N[0]) == 7, or int(N[1]) == 7, int(N[2]) == 7:
  print('Yes')
else:
  print('No')


Fixed submission:
N = input()
if '7' in N:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N[0] == 7, or N[1] == 7, N[2] == 7:
  print('Yes')
else:
  print('No')

Fixed submission:
N = input()
if '7' in N:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
a = list(map(int, input().split()))

all_sum = sum(a)
standard = all_sum/(4*M)
ans = 0

for i in a:
  if i >= standard:
    ans += 1

if ans >= m:
  print('Yes')
else:
  print('No')


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

all_sum = sum(a)
standard = all_sum/(4*m)
ans = 0

for i in a:
  if i >= standard:
    ans += 1

if ans >= m:
  print('Yes')
else:
  print('No')

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

all_sum = sum(a)
standard = all_sum//(4*M)
ans = 0

for i in a:
  if i >= standard:
    ans += 1

if and >= m:
  print('Yes')
else:
  print('No')


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

all_sum = sum(a)
standard = all_sum/(4*m)
ans = 0

for i in a:
  if i >= standard:
    ans += 1

if ans >= m:
  print('Yes')
else:
  print('No')

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

all_sum = sum(a)
standard = all_sum//(4*M)
ans = 0

for i in a:
  if a[i] >= standard:
    ans += 1

if and >= m:
  print('Yes')
else:
  print('No')

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

all_sum = sum(a)
standard = all_sum/(4*m)
ans = 0

for i in a:
  if i >= standard:
    ans += 1

if ans >= m:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = input()

n = len(s)
a = (n - 1) // 2
b = (n + 3) // 2

s_reverse = s[::-1]

s_first = s[:a]
s_first_reverse = s_first[::-1]

s_second = s[b-1:]
s_second_reverse = s_second[::-1]

if s == s_reverse and s_first = s_first_reverse and s_second = s_second_reverse:
  print('Yes')
else:
  print('No')

Fixed submission:
s = input()

n = len(s)
a = (n - 1) // 2
b = (n + 3) // 2

s_reverse = s[::-1]

s_first = s[:a]
s_first_reverse = s_first[::-1]

s_second = s[b-1:]
s_second_reverse = s_second[::-1]

if s == s_reverse and s_first == s_first_reverse and s_second == s_second_reverse:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
if A == B and B ==C:
  input('No')
elif A != B and B != C and C != A:
  input('No')
else:
  input('Yes')

Fixed submission:
A, B, C = map(int, input().split())
if A == B and B ==C:
  print('No')
elif A != B and B != C and C != A:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

a = A - 1
b = B - 1

if U == S:
  print({} {}.format(a,B))
else:
  print({} {}.format(A,b))


Fixed submission:
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

a = A - 1
b = B - 1

if U == S:
  print('{} {}'.format(a,B))
else:
  print('{} {}'.format(A,b))

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

a = A - 1
b = B - 1

if U == S:
  print({} {}.format(a,B))
else:
  print({} {}.format(A.b))


Fixed submission:
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

a = A - 1
b = B - 1

if U == S:
  print('{} {}'.format(a,B))
else:
  print('{} {}'.format(A,b))

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

a = A - 1
b = B - 1

if U == S:
  print({} {}.format(a,B))
else:
  print({} {}.format(A.b))


Fixed submission:
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

a = A - 1
b = B - 1

if U == S:
  print('{} {}'.format(a,B))
else:
  print('{} {}'.format(A,b))

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

a = A - 1
b = B - 1

if U == S:
  print({} {}.format(a,B))
else:
  print({} {}.format(A.b))


Fixed submission:
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

a = A - 1
b = B - 1

if U == S:
  print('{} {}'.format(a,B))
else:
  print('{} {}'.format(A,b))

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

a = A - 1
b = B - 1

if U == S:
  print({} {}.format(a,B))
else:
  print({} {}.format(A.b))

Fixed submission:
S, T = map(str, input().split())
A, B = map(int, input().split())
U = input()

a = A - 1
b = B - 1

if U == S:
  print('{} {}'.format(a,B))
else:
  print('{} {}'.format(A,b))
Buggy python submission (verdict: Runtime Error):
H, A = map(int, input())
n = (H-1)//A + 1
print(n)

Fixed submission:
H, A = map(int, input().split())
n = (H-1)//A + 1
print(n)
Buggy python submission (verdict: Runtime Error):
C = input()
print chr(ord('C') + 1)

Fixed submission:
C = input()
print(chr(ord(C) + 1))
Buggy python submission (verdict: Runtime Error):
K, X = map(int, input().split)
a = 500*K

if a >= X:
  print("Yes")
else:
  print("No")

Fixed submission:
K, X = map(int, input().split())
a = 500*K

if a >= X:
  print("Yes")
else:
  print("No")