Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
    maxx = 2**29
    ans = 0
    for _ in range(int(input())):
        a, b = map(int, input().split(' '))
        if b < maxx:
            maxx = b
            ans = a
    print(ans + maxx)

Fixed submission:
al = []
bl = []
for _ in range(int(input())):
    a, b = map(int, input().split(' '))
    al.append(a)
    bl.append(b)
print(max(al) + min(bl))
Buggy python submission (verdict: Runtime Error):
import math
 
a = []
for i in range(2):
    a.append(input())
tmp = math.floor(a[0]/500)
tmp1 = a[0] - tmp*500
if a[1] >= tmp1:
    print('Yes')
else:
    print('No')

Fixed submission:
import math
 
a = []
for i in range(2):
    a.append(int(input()))
tmp = math.floor(a[0]/500)
tmp1 = a[0] - tmp*500
if a[1] >= tmp1:
    print('Yes')
else:
    print('No')

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

a = []
for i in range(2):
    a.append(input)
tmp = math.floor(a[0]/500)
tmp1 = a[0] - tmp*500
if a[1] >= tmp1:
    print('Yes')
else:
    print('No')

Fixed submission:
import math
 
a = []
for i in range(2):
    a.append(int(input()))
tmp = math.floor(a[0]/500)
tmp1 = a[0] - tmp*500
if a[1] >= tmp1:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
print(str(a+a*a+a*a*a))

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# スペース区切りの整数の入力
1<=a<=10
print(a*a*a+a*a+a)

Buggy python submission (verdict: Runtime Error):
for a in range (1,11)
print(str(a+a*a+a*a*a))

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# スペース区切りの整数の入力
1<=a<=10
print(a*a*a+a*a+a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
st = [input() for i in range(N)]
print('AC x ' + str(st.count("AC")))
print('WA x ' + str(st.count("WA")))
print('TLE x ' + str(st.count("TLE")))
print('RE x ' + str(st.count("RE")))

Fixed submission:
n = int(input())
st = [input() for i in range(n)]
print('AC x ' + str(st.count("AC")))
print('WA x ' + str(st.count("WA")))
print('TLE x ' + str(st.count("TLE")))
print('RE x ' + str(st.count("RE")))
Buggy python submission (verdict: Runtime Error):
a,b,c,d,e=map(int,input()split())
if a==0:
  print("1")
elif b==0:
  print("2")
elif c==0:
    print("3")
elif d==0:
  print("4")
else:
  print("5")

Fixed submission:
a,b,c,d,e=map(int,input().split())
if a==0:
  print("1")
elif b==0:
  print("2")
elif c==0:
    print("3")
elif d==0:
  print("4")
else:
  print("5")
Buggy python submission (verdict: Runtime Error):
x,y=map(int,input().split())
a=0
b=0
if y == 2*x or y == 4*x:
  print("Yes")
else:
  count=0
  for i in range(0,x):
    for j in range(0,x):
      if (i+j)==x:
        if 2*i + 4 * j == y:
          count=1     
if count==0:
  print("No")
else:
  print("Yes")

Fixed submission:
x,y=map(int,input().split())
count=0
if y == 2*x or y == 4*x:
    count=1
else:
  for i in range(x):
    for j in range(x):
      if (i+j)==x:
        if (2*i) + (4 * j) == y:
          count+=1     
if count<1:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

while n != 0:
	x = 1
	while x < n // 2:
		x *= 2
	b = []
	for i in range(x, n):
		b.append(abs(a[i - x] - a[i]))
	a = b
	n -= digit
	if len(b) == 1:
		break
print(a[0])


Fixed submission:
N = int(input())
a = list(map(int, list(input())))
 
while N != 0:
	digit = 1
	while digit < N // 2:
		digit *= 2
 
	x = []
	for i in range(digit, N):
		x.append(abs(a[i - digit] - a[i]))
 
	a = x
	N -= digit
	if len(x) == 1:
		break
 
print(a[0])

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    l = int(input())
    li = []
    b = input()
    for i in range(l):
      li.append(int(b[i]))
    for j in range(l):
      for i in range(l-j-1):
        li[i] = abs(li[i] - li[i+1])
    print(li[0])

if __name__ == '__main__':
    main()

Fixed submission:
N = int(input())
a = list(map(int, list(input())))
 
while N != 0:
	digit = 1
	while digit < N // 2:
		digit *= 2
 
	x = []
	for i in range(digit, N):
		x.append(abs(a[i - digit] - a[i]))
 
	a = x
	N -= digit
	if len(x) == 1:
		break
 
print(a[0])
Buggy python submission (verdict: Runtime Error):
test_list=[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]
index=int(input())
print(test_list[index]+1)

Fixed submission:
n=int(input())
li = [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]
print(li[n-1])

Buggy python submission (verdict: Runtime Error):
test_list=[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]
index=int(input())
print(test_list[index])
      

Fixed submission:
n=int(input())
li = [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]
print(li[n-1])
Buggy python submission (verdict: Runtime Error):
n,d = map(int,input().split())
a=[]
b=[]
cnt = 0
for i in range(n):
    a[i],b[i] = map(int,input().split())
    if a[i]**2+b[i]**2<=d**2:
        cnt += 1
print("{}".format(cnt))

Fixed submission:
n,d = map(int,input().split())
a=[]
b=[]
cnt = 0
for i in range(n):
    c, e = map(int,input().split())
    if c**2+e**2<=d**2:
        cnt += 1
print("{}".format(cnt))

Buggy python submission (verdict: Runtime Error):
import numpy
n,d = map(int,input().split())
a=[]
b=[]
cnt = 0
for i in range(n):
    a[i],b[i] = map(int,input().split())
    if numpy.sqrt(a[i]**2+b[i]**2)<=d:
        cnt += 1
print("{}".format(cnt))

Fixed submission:
n,d = map(int,input().split())
a=[]
b=[]
cnt = 0
for i in range(n):
    c, e = map(int,input().split())
    if c**2+e**2<=d**2:
        cnt += 1
print("{}".format(cnt))

Buggy python submission (verdict: Runtime Error):
n,d = map(int,input().split())
a=[]
b=[]
cnt = 0
for i in range(n):
    a[i],b[i] = map(int,input().split())
    if(sqrt(a[i]**2+b[i]**2)<=d)
        cnt += 1
print("{}".format(cnt))

Fixed submission:
n,d = map(int,input().split())
a=[]
b=[]
cnt = 0
for i in range(n):
    c, e = map(int,input().split())
    if c**2+e**2<=d**2:
        cnt += 1
print("{}".format(cnt))
Buggy python submission (verdict: Runtime Error):
X = int(input())
if X >= 30:
  print("Yes")
else:
  pritn("No")

Fixed submission:
X = int(input())
if X >= 30:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
X = input()
if X >= 30:
  print("Yes")
else:
  print("No")

Fixed submission:
X = int(input())
if X >= 30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input().split()[0])
D = int(input().split()[1])
count = 0
for i in range(N):
  Xi = int(input().split()[0])
  Yi = int(input().split()[1])
  R = (Xi**2+Yi**2)**(1/2)
  if R<=D:
    count += 1
print(count)

Fixed submission:
ND = input()
N = int(ND.split()[0])
D = int(ND.split()[1])
count = 0
for i in range(N):
  XiYi = input()
  Xi = int(XiYi.split()[0])
  Yi = int(XiYi.split()[1])
  R = (Xi**2+Yi**2)**(1/2)
  if R <= D:
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
X = int((input().split())[0])
Y = int((input().split())[1])
c = (4*X-Y)/2
t = (Y-2*X)/2
if c >= 0 and int(c) == c:
    if t >= 0 and int(t) == t:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Fixed submission:
XY = input().split()
X = int(XY[0])
Y = int(XY[1])
c = (4*X-Y)/2
t = (Y-2*X)/2
if c >= 0 and int(c) == c:
    if t >= 0 and int(t) == t:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
X = int(input().split()[0])
Y = int(input().split()[1])
c = (4*X-Y)/2
t = (Y-2*X)/2
if c >= 0 and int(c) == c:
    if t >= 0 and int(t) == t:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Fixed submission:
XY = input().split()
X = int(XY[0])
Y = int(XY[1])
c = (4*X-Y)/2
t = (Y-2*X)/2
if c >= 0 and int(c) == c:
    if t >= 0 and int(t) == t:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
X = int(input().split()[0])
Y = int(input().split()[1])
c = (4*X-Y)/2
t = (Y-2*X)/2
if c >= 0 and int(c) == c:
  if t >= 0 and int(t) == t:
  	print("Yes")
  else:
    print("No")
else:
  print("No")

Fixed submission:
XY = input().split()
X = int(XY[0])
Y = int(XY[1])
c = (4*X-Y)/2
t = (Y-2*X)/2
if c >= 0 and int(c) == c:
    if t >= 0 and int(t) == t:
        print("Yes")
    else:
        print("No")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
XN = input().split()
X = int(XN[0])
N = int(XN[1])
if N == 0:
    print(X)
else:
    p = input.split()
    A = [None]*N
    for i in range(N):
        A[i] = abs(int(p[i])-X)
    j = 0
    while j in A:
        j += 1
    if j == 1:
        print(X-j)
    else:
        if A.count(j-1) == 2:
            print(X-j)
        else:
            if str(X-(j-1)) in p:
                print(X+(j-1))
            else:
                print(X-(j-1))

Fixed submission:
XN = input().split()
X = int(XN[0])
N = int(XN[1])
if N == 0:
    print(X)
else:
    p = input().split()
    A = [None]*N
    for i in range(N):
        A[i] = abs(int(p[i])-X)
    if 0 not in A:
        print(X)
    else:
        j = 1
        while A.count(j) == 2:
            j += 1
        if A.count(j) == 0:
            print(X-j)
        else:
            if str(X-j) in p:
                print(X+j)
            else:
                print(X-j)
Buggy python submission (verdict: Runtime Error):
str(input())
n = int(n[-1]) 
 
if n == 3:
    print("bon")
elif n in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")

Fixed submission:
N = str(input())
last_num = int(N[-1]) 
 
if last_num == 3:
    print("bon")
elif last_num in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
str(input())
n = int(n[-1]) 
 
if n == 3:
    print("bon")
elif n in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")

Fixed submission:
N = str(input())
last_num = int(N[-1]) 
 
if last_num == 3:
    print("bon")
elif last_num in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
str(input())
n = int(n[-1]) 

if n == 3:
    print('bon')
elif n in [0, 1, 6, 8]:
    print('pon')
else:
    print('hon')

Fixed submission:
N = str(input())
last_num = int(N[-1]) 
 
if last_num == 3:
    print("bon")
elif last_num in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
str(input())
n = int(n[-1]) 

if n == 3:
    print('bon')
elif n in [0, 1, 6, 8]:
    print('pon')
else:
    print('hon')

Fixed submission:
N = str(input())
last_num = int(N[-1]) 
 
if last_num == 3:
    print("bon")
elif last_num in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")

Buggy python submission (verdict: Runtime Error):
str(input())
n = int(n[-1]) 

if n == 3:
    print('bon')
elif n in [0, 1, 6, 8]:
    print('pon')
else:
    print('hon')

Fixed submission:
N = str(input())
last_num = int(N[-1]) 
 
if last_num == 3:
    print("bon")
elif last_num in [0, 1, 6, 8]:
    print("pon")
else:
    print("hon")
Buggy python submission (verdict: Runtime Error):
import math

R = str(input())

circum = R * 2 * math.pi 

print(circum)

Fixed submission:
import math

R = int(input())

circum = R * 2 * math.pi 

print(circum)

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

R = str(input())

circum = R * 2 * math.pi 

print(circum)

Fixed submission:
import math

R = int(input())

circum = R * 2 * math.pi 

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

if 7 in N:
    print("Yes")
else:
    print("No")

Fixed submission:
N = input()

if "7" in N:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
K = int(input())
if K % 2 == 0:
    print(-1)
    exit()
else:
    n = 7
    n_before = 7
    count = 1
    while n % K != 0:
        n = n % K
        count += 1
        n_before = 10 * n_before % K
        n = n + n_before
print(count)


Fixed submission:
K = int(input())
if K % 2 == 0 or K % 5 ==0:
    print(-1)
    exit()
else:
    n = 7
    n_before = 7
    count = 0
    while True:
        count += 1
        n = n % K
        if n == 0:
            print(count)
            exit()
        else:
            n_before = 10 * n_before % K
            n = n + n_before
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N-1):
    if A[i+1] > A[i]:
        stock = money // A[i]
        money = money % A[i]
        money = stock * A[i+1]
print(money)


Fixed submission:
X = int(input())
a = X // 200
print(10 - a)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())
A = list(map(int, input().split()))
B = [1] * (N-K+1)
for i in range(N-K+1):
    for j in A[i:K+i]:
        B[i] *= j
for i in range(N-K):
    if B[i+1] > B[i]:
        print('Yes')
    else:
        print('No')


Fixed submission:
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N-K):
    if A[i+K] > A[i]:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
dic = collections.Counter(a)
sum_list = [x * y for (x, y) in dic.items()]
sum = sum(sum_list)
for i in range(q):
    if b in dic:
        b, c = map(int, input().split())
        print(sum - (b - c) * dic[b])


Fixed submission:
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
dic = collections.Counter(a)
sum_list = [x * y for (x, y) in dic.items()]
sum = sum(sum_list)
for i in range(q):
    b, c = map(int, input().split())
    if b in dic and c not in dic:
        sum -= (b - c) * dic[b]
        print(sum)
        dic[c] = dic[b]
        del dic[b]
    elif b in dic and c in dic:
        sum -= (b - c) * dic[b]
        print(sum)
        dic[c] += dic[b]
        del dic[b]
    else:
        print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
dic = collections.Counter(a)
for i in range(q):
    b, c = map(int, input().split())
    if b in dic and c not in dic:
        dic[c] = dic[b]
        del dic[b]
    elif b in dic and c in dic:
        dic[c] += dic[b]
        del dic[b]
    sum_list = [x * y for (x, y) in dic.items()]
    print(sum(sum_list))


Fixed submission:
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
dic = collections.Counter(a)
sum_list = [x * y for (x, y) in dic.items()]
sum = sum(sum_list)
for i in range(q):
    b, c = map(int, input().split())
    if b in dic and c not in dic:
        sum -= (b - c) * dic[b]
        print(sum)
        dic[c] = dic[b]
        del dic[b]
    elif b in dic and c in dic:
        sum -= (b - c) * dic[b]
        print(sum)
        dic[c] += dic[b]
        del dic[b]
    else:
        print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
q = int(input())
ans = 0
for i in range(q):
    b, c = map(int, input().split())
    if b in a:
        l = [i for i, x in enumerate(a) if x == b]
        for j in l:
            a[j] = c
    print(sum(a))


Fixed submission:
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
dic = collections.Counter(a)
sum_list = [x * y for (x, y) in dic.items()]
sum = sum(sum_list)
for i in range(q):
    b, c = map(int, input().split())
    if b in dic and c not in dic:
        sum -= (b - c) * dic[b]
        print(sum)
        dic[c] = dic[b]
        del dic[b]
    elif b in dic and c in dic:
        sum -= (b - c) * dic[b]
        print(sum)
        dic[c] += dic[b]
        del dic[b]
    else:
        print(sum)
Buggy python submission (verdict: Runtime Error):
2 100

Fixed submission:
X, Y = map(int, input().split())
for i in range(X+1):
    if 2 * i + 4 * (X - i) == Y:
        print('Yes')
        exit()
print('No')
Buggy python submission (verdict: Runtime Error):
A, B = int(input().split())
C  = A * B
print(C)


Fixed submission:
A, B = map(int, input().split())
C  = A * B
print(C)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
ans = 1
for i in A:
    ans *= i
if ans > 10 ** 18:
    print('-1')
else:
    print(ans) 


Fixed submission:
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
ans = 1
for i in A:
    ans *= i
    if ans > 10 ** 18:
        print('-1')
        exit()
print(ans)
Buggy python submission (verdict: Runtime Error):
import itertools
N, M, Q = map(int,input().split())
s = [tuple(map(int, input().split())) for i  in range(Q)]
l = list(range(1,M+1))
ans = []
for v in itertools.combinations(l, N):
    new_v = sorted(v)
    count = 0
    for i in range(Q):
        a, b, c, d = s[i]
        if new_v[b-1] - new_v[a-1] == c:
            count += d
    ans.append(count)
print(max(0, max(ans)))


Fixed submission:
import itertools
N, M, Q = map(int,input().split())
s = [tuple(map(int, input().split())) for i  in range(Q)]
l = list(range(1,M+1))
ans = []
for v in itertools.combinations_with_replacement(l, N):
    count = 0
    for i in range(Q):
        a, b, c, d = s[i]
        if v[b-1] - v[a-1] == c:
            count += d
    ans.append(count)
print(max(0, max(ans)))
Buggy python submission (verdict: Time Limit Exceeded):
A, B, N = map(int, input().split())
ans = []
for x in range(N+1):
    a = int(A * x / B) - A * int(x / B)
    ans.append(a)
print(max(ans))

Fixed submission:
A, B, N = map(int, input().split())
if N < B:
    ans = int(A * N / B) - A * int(N / B)
else:
    ans = int((B - 1) / B * A)
print(ans)
Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
    C = C - B
    A = A - D
if A == 0:
    ans = 'No'
else:
    ans = 'Yes'
print(ans)


Fixed submission:
S, W = map(int, input().split())
if S <= W:
    print('unsafe')
else:
    print('safe')
Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
    C = C - B
    A = A - D
if: A == 0:
    ans = 'No'
else:
    ans = 'Yes'
print(ans)


Fixed submission:
A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
    C = C - B
    if C <= 0:
        break
    else:
        A = A - D
if A <= 0:
    ans = 'No'
else:
    ans = 'Yes'
print(ans)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input(),split()))
sum = sum(A)
if sum > N:
    ans = -1
else:
    ans = N - sum
print(ans)


Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = sum(A)
if B > N:
    ans = -1
else:
    ans = N - B
print(ans)

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input(),split()))
sum = sum(A)
if sum > N:
    ans = -1
else:
    ans = N - sum
print(ans)


Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = sum(A)
if B > N:
    ans = -1
else:
    ans = N - B
print(ans)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
S = sum(A)
if A[M-1] >=  S / (4 * M):
    print('Yes')
else:
    print('No')


Fixed submission:
li= list(map(int, input().split()))
li.insert(1, li.pop(0))
li.insert(2, li.pop(0))
li.insert(0, li.pop(1))
print(li[0], li[1], li[2])

Buggy python submission (verdict: Runtime Error):
li= list(map(int, input().split()))
li.insert(1, li.pop(0))
li.insert(2, li.pop(0))
li.insert(0, li.pop(1))
print(li(0), li(1), li(2))


Fixed submission:
li= list(map(int, input().split()))
li.insert(1, li.pop(0))
li.insert(2, li.pop(0))
li.insert(0, li.pop(1))
print(li[0], li[1], li[2])

Buggy python submission (verdict: Runtime Error):
li= list(map(int, input().split()))
li.insert(1) = li.pop(0)
li.insert(2) = li.pop(0)
print(li)

Fixed submission:
li= list(map(int, input().split()))
li.insert(1, li.pop(0))
li.insert(2, li.pop(0))
li.insert(0, li.pop(1))
print(li[0], li[1], li[2])
Buggy python submission (verdict: Runtime Error):
M, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)　
S = sum(A)
if A[M-1] >=  S / 4M
print('Yes')
else:
    ('No')


Fixed submission:
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
S = sum(A)
if A[M-1] >=  S / (4 * M):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
loop = N // (A + B)
amari = N % (A + B)
blue = A * loop + min(A, amari)
print(blue)


Fixed submission:
S = str(input())
if S[0] == S[1] == S[2]:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
list = [A, B, C]
ans = list(set(list))
if len(ans) == 2:
    print('Yes')
else:
    print('No')


Fixed submission:
A, B, C = map(int, input().split())
l = [A, B, C]
ans = list(set(l))
if len(ans) == 2:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
S = input()
print(x * len(S))


Fixed submission:
S = input()
print('x' * len(S))
Buggy python submission (verdict: Runtime Error):
from sys import stdin
INF = float("inf")#無限大の設定1
IINF = 10 ** 18#無限大の設定2
MOD = 10 ** 9 + 7#まれに用いるmodを予め設定しておく
n = (stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(stdin.buffer.readline().decode().rstrip()) for _ in range(h)]
S =['SUN','MON','TUE','WEN','THU','FRI','SAT']
a = S.index(n)
print(len(S) - a)


Fixed submission:
from sys import stdin
INF = float("inf")#無限大の設定1
IINF = 10 ** 18#無限大の設定2
MOD = 10 ** 9 + 7#まれに用いるmodを予め設定しておく
n = (stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(stdin.buffer.readline().decode().rstrip()) for _ in range(h)]
S =['SUN','MON','TUE','WED','THU','FRI','SAT']
a = S.index(n)
print(len(S) - a)
Buggy python submission (verdict: Runtime Error):
def dfs(i, sum, count, nokori):
    global ans
    if i == d:
        # G 点に満たなければ nokori のうち一番大きいものを解く
        if sum < g:
            use = max(nokori)
            # 解く問題が問題数を超えないように注意
            n = min(-(-(g - sum) // (use * 100)))
            count += n
            sum += n * use * 100

        if sum >= g:
            ans = min(ans, count) 
    else:
        # 総合スコア、解いた問題数、まだ解いてない問題を更新
        dfs(i + 1, sum, count, nokori)
        dfs(i + 1, sum + pc[i][0] * (i + 1) * 100\
        + pc[i][1], count + pc[i][0], nokori - {i + 1})


d, g = map(int, input().split())
pc = [list(map(int, input().split())) for i in range(d)]

ans = float("inf")

dfs(0, 0, 0, set(range(1, d + 1)))
print(ans)

Fixed submission:
# まだ解いてない配点を nokori として持つ
def dfs(i, sum, count, nokori):
    global ans
    if i == d:
        # G 点に満たなければ nokori のうち一番大きいものを解く
        if sum < g:
            use = max(nokori)
            # 解く問題が問題数を超えないように注意
            n = min(pc[use - 1][0], -(-(g - sum) // (use * 100)))
            count += n
            sum += n * use * 100

        if sum >= g:
            ans = min(ans, count)
    else:
        # 総合スコア、解いた問題数、まだ解いてない問題を更新
        dfs(i + 1, sum, count, nokori)
        dfs(i + 1, sum + pc[i][0] * (i + 1) * 100 + pc[i][1], count + pc[i][0], nokori - {i + 1})


d, g = map(int, input().split())
pc = [list(map(int, input().split())) for i in range(d)]

ans = float("inf")

dfs(0, 0, 0, set(range(1, d + 1)))
print(ans)