Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import numpy as np

n, k = map(int, input().split())
ai = list(map(int, input().split()))

ei = []

for i in range(k,n+1):
    ei.append(np.prod(ai[i-k:i]))


for i in range(n-k):
    if ei[i] < ei[i+1]:
        print("Yes")
    else:
        print("No")

Fixed submission:
kyu = [400,600,800,1000,1200,1400,1600,1800,2000]

x = int(input())

for i, v in enumerate(kyu):
    if x < v:
        print(9-i)
        break
Buggy python submission (verdict: Runtime Error):
h1, m1, h2, m2, k = map(int,input().split())
 
h=h2 - h1
if h < 0:
    h = 24+h
    m=m2 - m1
    du=h*60+m-k
elif h == 0:
    if m1 < m2:
        du = m2-m1-k
else:
    du = h*60+m-k
        
print(du)

Fixed submission:
h1, m1, h2, m2, k = map(int,input().split())
 
h=h2 - h1
if h < 0:
    h = 24+h
    m=m2 - m1
    du=h*60+m-k
elif h == 0:
    if m1 < m2:
        du = m2-m1-k
    else:
        du = 24*60 +(m2-m1)-k
else:
    du = h*60+(m2-m1)-k
        
print(du)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())

while(True):
    if(N <= abs(N-K)):
        print(N)
        break
    else:
        N = abs(N-K)


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

N = N%K
while(True):
    if(N <= abs(N-K)):
        print(N)
        break
    else:
        N = abs(N-K)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L=input().split(' ')
NL = [int(i) for i in L]

counter=0

for i in range(N):
    try:
        index = NL.index(i+1)
    except:
        break
    else:
        NL = NL[index+1:]
        counter += 1


if(counter == 0):
    print(-1)
else:
    print(N - counter)

Fixed submission:
N = int(input())
L=input().split(' ')
NL = [int(i) for i in L]

counter=0
start = 0
end = N

for i in range(N):
    try:
        index = NL.index(i+1, start, end)
        start = index+1
    except:
        break
    else:
        counter += 1


if(counter == 0):
    print(-1)
else:
    print(N - counter)
Buggy python submission (verdict: Time Limit Exceeded):
import math
import itertools
import sys
input = sys.stdin.readline


def f(x, y, z):
    return x**2+y**2+z**2+x*y+y*z+z*x


N = int(input())
NL = []

for n in range(1, N+1):
    lim = int(math.sqrt(n))
    ans = 0
    for x in range(1, lim):
        for y in range(x, lim):
            for z in range(y, lim):
                if f(x, y, z) == n:
                    if len(set([x, y, z])) == 1:
                        ans += 1
                    elif len(set([x, y, z])) == 2:
                        ans += 3
                    else:
                        ans += 6
    print(ans)
# for i in range(1, N):
#     print(NL.count(i))


Fixed submission:
import math
import itertools
import sys
input = sys.stdin.readline


def f(x, y, z):
    return x**2+y**2+z**2+x*y+y*z+z*x


N = int(input())

ans = [0 for _ in range(N)]
lim = 101
for x in range(1, lim):
    for y in range(1, lim):
        for z in range(1, lim):
            A = f(x, y, z)
            if A <= N:
                ans[A-1] += 1
for i in range(N):
    print(ans[i])

Buggy python submission (verdict: Time Limit Exceeded):
import math
import itertools
import sys
input = sys.stdin.readline


def f(x, y, z):
    return x**2+y**2+z**2+x*y+y*z+z*x


N = int(input())
NL = []

for n in range(1, N+1):
    lim = int(math.sqrt(n)) + 1
    ans = 0
    for x in range(1, lim):
        for y in range(x, lim):
            for z in range(y, lim):
                if f(x, y, z) == n:
                    if len(set([x, y, z])) == 1:
                        ans += 1
                    elif len(set([x, y, z])) == 2:
                        ans += 3
                    else:
                        ans += 6
    print(ans)
# for i in range(1, N):
#     print(NL.count(i))


Fixed submission:
import math
import itertools
import sys
input = sys.stdin.readline


def f(x, y, z):
    return x**2+y**2+z**2+x*y+y*z+z*x


N = int(input())

ans = [0 for _ in range(N)]
lim = 101
for x in range(1, lim):
    for y in range(1, lim):
        for z in range(1, lim):
            A = f(x, y, z)
            if A <= N:
                ans[A-1] += 1
for i in range(N):
    print(ans[i])
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(int, input().split()))
ans = 0
for L in itertools.permutations(A):
    temp = 0
    for i in range(1, N):
        temp += min(L[0], L[i-1])
    ans = max(ans, temp)
print(ans)


Fixed submission:
import itertools
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)

ans = A[0]
for i in range(2, N):
    ans += A[i//2]

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

Fixed submission:
A , B =map(int,input().split())
print(A*B)
Buggy python submission (verdict: Runtime Error):
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N != 0:
  ans += combi(N,2)
if M != 0:
  ans += combi(M,2)
print(ans)


Fixed submission:
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N > 1:
  ans += combi(N,2)
if M > 1:
  ans += combi(M,2)
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N != 0:
  ans += combi(M,2)
if M != 0:
  ans += combi(N,2)
print(ans)


Fixed submission:
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N > 1:
  ans += combi(N,2)
if M > 1:
  ans += combi(M,2)
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
ans += combi(M,2)
ans += combi(N,2)
print(ans)


Fixed submission:
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N > 1:
  ans += combi(N,2)
if M > 1:
  ans += combi(M,2)
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
def combi(n,r):
  ans = math.factorial(N) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
ans += combi(M,2)
ans += combi(N,2)
print(ans)


Fixed submission:
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N > 1:
  ans += combi(N,2)
if M > 1:
  ans += combi(M,2)
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
def combi(n,r):
  ans = math.factorial(N) // (math.factorial(n-r) * math.factorial(r))
  return ans

M = int(input())
N = int(input())

ans = 0
ans += combi(M,2)
ans += combi(N,2)
print(ans)


Fixed submission:
import math
def combi(n,r):
  ans = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
  return ans

N, M = map(int,input().split())

ans = 0
if N > 1:
  ans += combi(N,2)
if M > 1:
  ans += combi(M,2)
print(ans)
Buggy python submission (verdict: Runtime Error):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

A, B, M = map(int, input().split())
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
List_discount = [list(map(int, input().split())) for i in range(M)]

# print(List_discount)
ans = 2 * 10**5
for d in List_discount:
    # print(d)
    p = List_A[d[0]-1] + List_B[d[0]-1] - d[2]
    ans = min(ans, p)
no_discount = min(List_A) + min(List_B)
ans = min(ans, no_discount)
print(ans)


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

A, B, M = map(int, input().split())
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
List_discount = [list(map(int, input().split())) for i in range(M)]

# print(List_discount)
ans = 2 * 10**5
for d in List_discount:
    # print(d)
    p = List_A[d[0]-1] + List_B[d[1]-1] - d[2]
    ans = min(ans, p)
no_discount = min(List_A) + min(List_B)
ans = min(ans, no_discount)
print(ans)
Buggy python submission (verdict: Runtime Error):
N, R = map(int,input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-K))

Fixed submission:
N, R = map(int,input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-N))
Buggy python submission (verdict: Runtime Error):
S, T = input().split()
A, B = map(int,iunput().split())
U = input()

if U == S:
  A -= 1
else:
  B -= 1

print(A, B)

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

if U == S:
  A -= 1
else:
  B -= 1

print(A, B)
Buggy python submission (verdict: Runtime Error):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
import itertools
import math
input = sys.stdin.readline

N = int(input())
list_P = tuple(map(int, input().split()))
list_Q = tuple(map(int, input().split()))

List_All = list(itertools.permutations(list(range(1, N+1))))
# print(List_All)
Pi = List_All.index(list_P)
Qi = List_All.index(list_Q)
print(abs(Pi-Qi))


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

MP = int(input())
M = 1
ans = 0

while MP > 1:
    ans += M
    M = 2*M
    MP = MP//2
ans += M

print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
print(S+T)


Fixed submission:
S, T = input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
print(S+T)


Fixed submission:
S, T = input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
print(S+T)

Fixed submission:
S, T = input().split()
print(T+S)
Buggy python submission (verdict: Time Limit Exceeded):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

N = int(input())
list_A = list(map(int, input().split()))

ans = ""
for i in range(N):
    ans += str(list_A.index(i+1) + 1)
    ans += " "
ans = ans.strip()
print(ans)


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

N = int(input())
list_A = list(map(int, input().split()))
student = list(range(N))

student.sort(key=lambda i: list_A[i])

ans = ""
for i in range(N):
    ans += str(student[i]+1) + " "
    # print(ans)
ans = ans.strip()

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

N = int(input())
list_A = list(map(int, input().split()))

ans = ""
for i in range(N):
    ans += str(list_A.index(i+1) + 1)
    ans += " "
ans = ans.strip()
print(ans)


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

N = int(input())
list_A = list(map(int, input().split()))
student = list(range(N))

student.sort(key=lambda i: list_A[i])

ans = ""
for i in range(N):
    ans += str(student[i]+1) + " "
    # print(ans)
ans = ans.strip()

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

N, K, Q = map(int, input().split())
list_A = [int(input()) for i in range(Q)]
list_P = [K] * N

for i in range(Q):
    for j in range(N):
        if list_A[i] != j+1:
            list_P[j] -= 1

for i in range(N):
    if list_P[i] <= 0:
        print("No")
    else:
        print("Yes")


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

N, K, Q = map(int, input().split())
list_P = [K-Q] * N
for i in range(Q):
    A = int(input())
    list_P[A-1] += 1

for i in range(N):
    if list_P[i] <= 0:
        print("No")
    else:
        print("Yes")
Buggy python submission (verdict: Runtime Error):
S = list(input())
for i in range(1,4):
  if S[i] == S[i-1]:
    print("Bad")
	break
print("Good")

Fixed submission:
S = list(input())
for i in range(1,4):
  if S[i] == S[i-1]:
    print("Bad")
    exit()
print("Good")
Buggy python submission (verdict: Runtime Error):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

N = int(input())
L = []
for i in range(N):
    c, p = input().split()
    p = int(p)
    L.append([i+1, c, p])
L = sorted(L, lambda x: (x[1], -x[2]))
for i in range(N):
    print(L[i][0])


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

N = int(input())
L = []
for i in range(N):
    c, p = input().split()
    p = int(p)
    L.append([i+1, c, p])
L = sorted(L, key=lambda x: (x[1], -x[2]))
for i in range(N):
    print(L[i][0])
Buggy python submission (verdict: Runtime Error):
N, K = map(int,input().split())
S = list(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 = list(input().split())

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):
A, B = map(int,input().split())
ans = 0
for i in range(2):
  ans += max(A,B)
  if max(A) == A:
    A -= 1
  else:
    B -= 1
print(ans)

Fixed submission:
A, B = map(int,input().split())
ans = 0
for i in range(2):
  ans += max(A,B)
  if max(A,B) == A:
    A -= 1
  else:
    B -= 1
print(ans)
Buggy python submission (verdict: Runtime Error):
V = []
for i in range(5):
  V.append(int(input()))
               
k = int(input())
               
d = max(V) = min(V)

if d > k:
  print(":(")
else:
  print("Yay!")


Fixed submission:
V = []
for i in range(5):
  V.append(int(input()))
               
k = int(input())
               
d = max(V) - min(V)

if d > k:
  print(":(")
else:
  print("Yay!")

Buggy python submission (verdict: Runtime Error):
v = []
for i in range(5):
  V.append(int(input()
               
k = int(input())
               
d = []
for i in range(1,5):
  d.append(V[i]-v[i-1])

if max(v) > k:
  print(":(")
else:
  print(("Yay!")

Fixed submission:
V = []
for i in range(5):
  V.append(int(input()))
               
k = int(input())
               
d = max(V) - min(V)

if d > k:
  print(":(")
else:
  print("Yay!")
Buggy python submission (verdict: Runtime Error):
S = input()
ans = ""
if S == "A":
  ans = "T"
elif S == "T":
  ans = "A"
elif S == "C":
  ans = "G"
else S == "G":
  ans = "C"

print(ans)

Fixed submission:
S = input()
ans = ""
if S == "A":
  ans = "T"
elif S == "T":
  ans = "A"
elif S == "C":
  ans = "G"
elif S == "G":
  ans = "C"

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
import sys
input = sys.stdin.readline

S = input().rstrip('\n')
N = len(S)

for i in itertools.count():
    # print(S)
    S = S.replace('01', '').replace('10', '')
    if not S:
        break
    if S.count('0') == 0 or S.count('1') == 0:
        break

print(N-len(S))


Fixed submission:
import itertools
import sys
input = sys.stdin.readline

S = input().rstrip('\n')
N = len(S)

print(2*min(S.count('0'), S.count('1')))

# for i in itertools.count():
#     # print(S)
#     S = S.replace('01', '').replace('10', '')
#     if not S:
#         break
#     if S.count('0') == 0 or S.count('1') == 0:
#         break

# print(N-len(S))

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
import sys
input = sys.stdin.readline

S = list(map(int, list(input().rstrip('\n'))))
temp = S.copy()

for k in itertools.count():
    for i in range(len(temp) - 1):
        if temp[i] != temp[i + 1]:
            temp.pop(i)
            temp.pop(i)
            break
    if temp.count(0) == len(temp) or temp.count(1) == len(temp):
        break

print(len(S)-len(temp))


Fixed submission:
import itertools
import sys
input = sys.stdin.readline

S = input().rstrip('\n')
N = len(S)

print(2*min(S.count('0'), S.count('1')))

# for i in itertools.count():
#     # print(S)
#     S = S.replace('01', '').replace('10', '')
#     if not S:
#         break
#     if S.count('0') == 0 or S.count('1') == 0:
#         break

# print(N-len(S))
Buggy python submission (verdict: Runtime Error):
S = list(map(int,inpuy().split()))
S.sort()
print((S[0]+S[1])/2)


Fixed submission:
S = list(map(int,input().split()))
S.sort()
print((S[0]*S[1])//2)
Buggy python submission (verdict: Runtime Error):
S = list(input())
for n in S:
  if N == '1':
  	N = '9'
  elif N == '9':
    N = '1'
A = int(''.join(S))
print(A)

Fixed submission:
S = list(input())
for i in range(3):
  if S[i] == '1':
  	S[i] = '9'
  elif S[i]== '9':
    S[i] = '1'
A = int(''.join(S))
print(A)
Buggy python submission (verdict: Time Limit Exceeded):
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import math
import sys
input = sys.stdin.readline

D, G = map(int, input().split())
# print(D, G)
P = []
C = []
for i in range(D):
    p,  c = map(int, input().split())
    P.append(p)
    C.append(c)

INF = 10**15


def F(i, n, GetPoint):
    if i == D:
        if GetPoint >= G:
            return n, GetPoint
        else:
            return INF, INF

    PerPoint = (i+1)*100

    if GetPoint < G:
        temp = INF, INF
        for j in range(P[i]+1):
            if j != P[i]:
                N, GP = F(i+1, n+j, GetPoint+j*PerPoint)
            else:
                N, GP = F(i+1, n+j, GetPoint+j*PerPoint + C[i])
            if N < temp[0]:
                temp = N, GP
        return temp
    else:
        return n, GetPoint


print(F(0, 0, 0)[0])


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

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import math
import sys
input = sys.stdin.readline

D, G = map(int, input().split())
# print(D, G)
P = []
C = []
for i in range(D):
    p,  c = map(int, input().split())
    P.append(p)
    C.append(c)

INF = 10**15


def F(i, n, GetPoint):
    if i == D:
        if GetPoint >= G:
            return n, GetPoint
        else:
            return INF, INF

    PerPoint = (i+1)*100

    if GetPoint < G:
        ANS = INF, INF
        # ALL
        N, GP = F(i+1, n+P[i], GetPoint+PerPoint*P[i] + C[i])
        if N < ANS[0]:
            ANS = N, GP
        # through
        N, GP = F(i+1, n, GetPoint)
        if N < ANS[0]:
            ANS = N, GP

        # part
        # 上位合計
        PupperAll = sum([(j+1)*100*P[j] + C[j] for j in range(i+1, D)])
        rN = math.ceil((G - GetPoint - PupperAll)/PerPoint)
        if 0 < rN < P[i]:
            GP = GetPoint + PerPoint*rN + PupperAll
            N = n + rN + sum(P[i+1:])
            if N < ANS[0]:
                ANS = N, GP

        return ANS
    else:
        return n, GetPoint


print(F(0, 0, 0)[0])
Buggy python submission (verdict: Runtime Error):
n = int(input())
ans = ''
if n > 999:
  ans = "ABD" + str(n-999).zfill(3)
else:
  ans = "ABC" + str(n).zfill(3)
print(ans

Fixed submission:
n = int(input())
ans = ''
if n > 999:
  ans = "ABD"
else:
  ans = "ABC"
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
a = set(a)
if len(a) == 3:
  print("Yes")
else:
  print("No")

Fixed submission:
s = input()
a = set(s)
if len(a) == 3:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
S = input()
S[3] = '8'
print(S)

Fixed submission:
S = list(input())
S[3] = '8'
a = ''.join(S)
print(a)
Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int,input().split())
if A+B > C+D:
  print("Left")
elif A+B = C+D:
  print("Balanced")
else:
  print("Right")

Fixed submission:
A, B, C, D = map(int,input().split())
if A+B > C+D:
  print("Left")
elif A+B == C+D:
  print("Balanced")
else:
  print("Right")
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int,input().split())
print(min(N*A, B)

Fixed submission:
N, A, B = map(int,input().split())
print(min(N*A, B))
Buggy python submission (verdict: Runtime Error):
N = input()
if len(set(N[1:]) == 1 or len(set(N[:3])) == 1:
  print("Yes")
else
  print("No")


Fixed submission:
N = input()
if len(set(N[1:])) == 1 or len(set(N[:3])) == 1:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if len(set(N[1:]) == 1 and len(set(N[:3])) == 1:
  print("Yes")
else
  print("No")


Fixed submission:
N = input()
if len(set(N[1:])) == 1 or len(set(N[:3])) == 1:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if len(set(N[1:]) == 1 and len(set(N[:3])):
  print("Yes")
else
  print("No")

Fixed submission:
N = input()
if len(set(N[1:])) == 1 or len(set(N[:3])) == 1:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S = input()
N = 0
for i in range(1,len(S))
  if S[i-1] == S[i]:
    N += 1
if N >= 2:
  print("Yes")
else:
  print("No")

Fixed submission:
N = input()
if len(set(N[1:])) == 1 or len(set(N[:3])) == 1:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
A, B = map(lambda S: int(S,16), input().split())
if A < B:
  print("<")
elif A = B:
  print("=")
else:
  print(">")


Fixed submission:
A, B = map(lambda S: int(S,16), input().split())
if A < B:
  print("<")
elif A == B:
  print("=")
else:
  print(">")

Buggy python submission (verdict: Runtime Error):
A, B = map(lambda S: int(s,16), input().split())
if A < B:
  print("<")
elif A = B:
  print("=")
else:
  print(">")

Fixed submission:
A, B = map(lambda S: int(S,16), input().split())
if A < B:
  print("<")
elif A == B:
  print("=")
else:
  print(">")
Buggy python submission (verdict: Runtime Error):
C = []
C.append(list(map(int,input().split())))
C.append(list(map(int,input().split())))

if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0]:
  print("YES")
else:
  print("NO")

Fixed submission:
C = []
C.append(input())
C.append(input())
 
if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0]:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
A = list(map(int,input().split()))
B = set(A)
if A.count(B[0]) == 1:
  print(B[0])
else:
  print(B[1])

Fixed submission:
A = list(map(int,input().split()))
B = list(set(A))
if A.count(B[0]) == 1:
  print(B[0])
else:
  print(B[1])