Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
x = int(input())

def fun(x):

    res = []

    for a in range(-100, 100):
        for b in range(-100, 100):
            mult = a**5 - b**5
            if mult == x:
                res = a, b
                break
    print(res[0], res[1])

fun(x)

Fixed submission:
x = int(input())

def fun(x):

    res = []

    for a in range(-1000, 1000):
        for b in range(-1000, 1000):
            mult = a**5 - b**5
            if mult == x:
                res = a, b
                break
    print(res[0], res[1])

fun(x)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

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

checklist = {}

for item in alist:
    if alist.count(item) > 1:
        print('NO')
        exit(0)

print('YES')


Fixed submission:
N = int(input())

alist = input().split()

checklist = {}

for ite in alist:
    if checklist.get(ite) == '1':
        print('NO')
        exit(0)
    else:
        checklist[ite] = '1'

print('YES')

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

alist = map(int,input().split())

checklist = []

for item in alist:
    if item not in checklist:
        checklist.append(item)
    else:
        print('NO')
        exit(0)

print('YES')

Fixed submission:
N = int(input())

alist = input().split()

checklist = {}

for ite in alist:
    if checklist.get(ite) == '1':
        print('NO')
        exit(0)
    else:
        checklist[ite] = '1'

print('YES')
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split(' '))
from functools import reduce
alist = list(map(int,input().split(' ')))
alist = [i // 2  for i in alist]


from math import gcd

def getLCM(a, b):
    return a * b // gcd(a, b)

def get_lcm_for(your_list):
    return reduce(lambda x, y: getLCM(x, y), your_list)

lcmr = get_lcm_for(alist)

result = (m + lcmr)//(lcmr*2)


print(result)

Fixed submission:
from functools import reduce
from math import ceil

n, m = map(int, input().split(' '))

alist = list(map(int,input().split(' ')))
# alist = [i // 2  for i in alist]


from fractions import gcd

def getLCM(a, b):
    return a * b // gcd(a, b)

def get_lcm_for(your_list):
    return reduce(lambda x, y: getLCM(x, y), your_list)

lcmr = get_lcm_for(alist)

for a in alist:
    if (lcmr//a)%2 == 0:
        if (lcmr != a):
            print(0)
            exit(0)

result = m//lcmr + 2*m//lcmr%2


print(result)

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split(' '))
from functools import reduce
alist = list(map(int,input().split(' ')))
alist = [i // 2  for i in alist]


from math import gcd

def getLCM(a, b):
    return a * b // gcd(a, b)

def get_lcm_for(your_list):
    return reduce(lambda x, y: getLCM(x, y), your_list)

lcmr = get_lcm_for(alist)

result = (m + lcmr)//(lcmr*2)


print(result)

Fixed submission:
from functools import reduce
from math import ceil

n, m = map(int, input().split(' '))

alist = list(map(int,input().split(' ')))
# alist = [i // 2  for i in alist]


from fractions import gcd

def getLCM(a, b):
    return a * b // gcd(a, b)

def get_lcm_for(your_list):
    return reduce(lambda x, y: getLCM(x, y), your_list)

lcmr = get_lcm_for(alist)

for a in alist:
    if (lcmr//a)%2 == 0:
        if (lcmr != a):
            print(0)
            exit(0)

result = m//lcmr + 2*m//lcmr%2


print(result)
Buggy python submission (verdict: Time Limit Exceeded):
number_of_sticks = int(input())

sticks = [int(x) for x in input().split(' ')]

sticks.sort()

# print(sticks)

triangles = 0

import bisect

for i in range (number_of_sticks - 2):
    for j in range (i+2, number_of_sticks):
        # print(sticks[i], sticks[j])
        # find number of sticks between range range sticks[j]-sticks[i], sticks[i] + sticks[j]
        # max_range = bisect.bisect_left(sticks, sticks[i] + sticks[j]) - 1
        max_range = j
        min_range = max(bisect.bisect(sticks, sticks[j] - sticks[i]), i + 1)
        # print("max range: " + str(max_range))
        # print("min range: " + str(min_range))
        triangles += max(0, max_range - min_range)

print(triangles)

Fixed submission:
number_of_sticks = int(input())

sticks = [int(x) for x in input().split(' ')]

sticks.sort()

triangles = 0

import bisect

for i in range (number_of_sticks - 2):
    for j in range (i+2, number_of_sticks):
        max_range = j
        min_range = max(bisect.bisect(sticks, sticks[j] - sticks[i]), i + 1)
        triangles += max_range - min_range

print(triangles)

Buggy python submission (verdict: Time Limit Exceeded):
a = input()

a = int(a)

b = [int(x) for x in input().split(' ')]

b.sort()

from itertools import combinations

comb = combinations(b, 3)

possible_triangles = 0

first_num = -1
second_num = -1

skip = False

for i in comb:
    if skip:
        if i[0] == first_num and i[1] == second_num:
            continue
        else:
            skip = False
    if i[2] >= i[0] + i[1]:
        first_num = i[0]
        second_num = i[1]
        skip = True
        continue
    possible_triangles += 1

print(possible_triangles)

Fixed submission:
number_of_sticks = int(input())

sticks = [int(x) for x in input().split(' ')]

sticks.sort()

triangles = 0

import bisect

for i in range (number_of_sticks - 2):
    for j in range (i+2, number_of_sticks):
        max_range = j
        min_range = max(bisect.bisect(sticks, sticks[j] - sticks[i]), i + 1)
        triangles += max_range - min_range

print(triangles)

Buggy python submission (verdict: Time Limit Exceeded):
a = input()

a = int(a)

b = input().split(' ')

from itertools import combinations

comb = combinations(b, 3)

possible_triangles = 0

for i in list(comb):
    if int(i[0]) >= int(i[1]) + int(i[2]):
        continue
    if int(i[1]) >= int(i[0]) + int(i[2]):
        continue
    if int(i[2]) >= int(i[0]) + int(i[1]):
        continue
    possible_triangles += 1

print(possible_triangles)

Fixed submission:
number_of_sticks = int(input())

sticks = [int(x) for x in input().split(' ')]

sticks.sort()

triangles = 0

import bisect

for i in range (number_of_sticks - 2):
    for j in range (i+2, number_of_sticks):
        max_range = j
        min_range = max(bisect.bisect(sticks, sticks[j] - sticks[i]), i + 1)
        triangles += max_range - min_range

print(triangles)
Buggy python submission (verdict: Runtime Error):
predict = raw_input()

actual = raw_input()

count = 0

for index in range(0, len(predict)):
    if predict[index] == actual[index]:
        count += 1

print (count)

Fixed submission:
predict = input()

actual = input()

count = 0

for index in range(0, len(predict)):
    if predict[index] == actual[index]:
        count += 1

print (count)
Buggy python submission (verdict: Time Limit Exceeded):
number = input()

heights = input().split(' ')

heights = [int(x) for x in heights]



count = 0

temp = 0

nxt_pos = 0

for n in range (0, int(number)):
    if n == nxt_pos:
        continue
    if count > len(heights) - n:
        break
    temp_count = 0
    for i in range (n, int(number)):
        if i == 0:
            continue
        if heights[i] <= heights[i-1]:
            temp_count += 1
        else:
            nxt_pos = i
            break
    if temp_count > count:
        count = temp_count

print (count)

Fixed submission:
number = input()

heights = input().split(' ')

heights = [int(x) for x in heights]



count = 0

temp = 0

nxt_pos = 0

for n in range (0, int(number)):
    if n <= nxt_pos:
        continue
    if count > len(heights) - n:
        break
    temp_count = 0
    for i in range (n, int(number)):
        if i == 0:
            continue
        if heights[i] <= heights[i-1]:
            temp_count += 1
        else:
            nxt_pos = i
            break
    if temp_count > count:
        count = temp_count

print (count)

Buggy python submission (verdict: Time Limit Exceeded):
number = input()

heights = input().split(' ')

heights = [int(x) for x in heights]



count = 0

temp = 0

for n in range (0, int(number)):
    temp_count = 0
    for i in range (n, int(number)):
        if i == 0:
            continue
        if heights[i] <= heights[i-1]:
            temp_count += 1
        else:
            break
    if temp_count > count:
        count = temp_count

print (count)

Fixed submission:
number = input()

heights = input().split(' ')

heights = [int(x) for x in heights]



count = 0

temp = 0

nxt_pos = 0

for n in range (0, int(number)):
    if n <= nxt_pos:
        continue
    if count > len(heights) - n:
        break
    temp_count = 0
    for i in range (n, int(number)):
        if i == 0:
            continue
        if heights[i] <= heights[i-1]:
            temp_count += 1
        else:
            nxt_pos = i
            break
    if temp_count > count:
        count = temp_count

print (count)
Buggy python submission (verdict: Runtime Error):
s=[str(i) for i in input()]
if str[0]=='R' and str[1]=='S':
	print(1)
elif str[1]=='S' and str[2]=='R':
	print(1)
elif str[0]=='S' and str[1]=='R' and str[2]=='S':
	print(1)
elif str[0]=='R' and str[1]=='R' and str[2]=='S':
	print(2)
elif str[0]=='S' and str[1]=='R' and str[2]=='R':
	print(2)
elif str[0]=='R' and str[1]=='R' and str[2]=='R':
	print(3)
else:
	print(0)

Fixed submission:
s=[str(i) for i in input()]
if s[0]=='R' and s[1]=='S':
	print(1)
elif s[1]=='S' and s[2]=='R':
	print(1)
elif s[0]=='S' and s[1]=='R' and s[2]=='S':
	print(1)
elif s[0]=='R' and s[1]=='R' and s[2]=='S':
	print(2)
elif s[0]=='S' and s[1]=='R' and s[2]=='R':
	print(2)
elif s[0]=='R' and s[1]=='R' and s[2]=='R':
	print(3)
else:
	print(0)
Buggy python submission (verdict: Runtime Error):
s = int(input())
w = int(input())
if w>=s:
  print("unsafe")
else:
  print("safe")

Fixed submission:
s,w= map(int,input().split())
if w>=s:
  print('unsafe')
else:
  print('safe')
Buggy python submission (verdict: Runtime Error):
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
for elem in obj:
  if elem in dictOfElems:
    dictOfElems[elem] += 1
  else:
    dictOfElems[elem] = 1
print(len(dict))

Fixed submission:
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
for elem in obj:
  if elem in dictOfElems:
    dictOfElems[elem] += 1
  else:
    dictOfElems[elem] = 1
print(len(dictOfElems))

Buggy python submission (verdict: Runtime Error):
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
    # Iterate over each element in list
    for elem in obj:
        # If element exists in dict then increment its value else add it in dict
        if elem in dictOfElems:
            dictOfElems[elem] += 1
        else:
            dictOfElems[elem] = 1
print(len(dict))

Fixed submission:
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
for elem in obj:
  if elem in dictOfElems:
    dictOfElems[elem] += 1
  else:
    dictOfElems[elem] = 1
print(len(dictOfElems))

Buggy python submission (verdict: Runtime Error):
n = int(input())
obj= []
for i in range (n)
	obj.append(input())
dictOfElems = dict()
    # Iterate over each element in list
    for elem in obj:
        # If element exists in dict then increment its value else add it in dict
        if elem in dictOfElems:
            dictOfElems[elem] += 1
        else:
            dictOfElems[elem] = 1
print(len(dict))


Fixed submission:
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
for elem in obj:
  if elem in dictOfElems:
    dictOfElems[elem] += 1
  else:
    dictOfElems[elem] = 1
print(len(dictOfElems))
Buggy python submission (verdict: Time Limit Exceeded):
k = int(input())
import math
def gcd(a,b,c):
  return (math.gcd(a, math.gcd(b, c)))
tsum=0
for a in range (1,k+1):
  for b in range (1,k+1):
    for c in range (1,k+1):
      tsum+= gcd(a,b,c)
print(tsum)

Fixed submission:
k = int(input())
from math import gcd
tsum=0
for a in range (1,k+1):
  for b in range (1,k+1):
    for c in range (1,k+1):
      tsum+= gcd(a,gcd(b,c))
print(tsum)
Buggy python submission (verdict: Time Limit Exceeded):
A,B,C,K = (int(x) for x in input().split())
s = 0
for i in range(K):
    if A != 0:
        s += 1
        A -= 1
    elif A == 0 and B != 0:
        s = s
        B -= 1
    elif A == 0 and B == 0:
        s -= 1
print(s)


Fixed submission:
A,B,C,K = (int(x) for x in input().split())
s = 0
d = (2*(10**10))
while True:
    if A <= K:
        s += (1*A)
        K = K - A
        A = d
    elif A != d and A > K:
        s = 1*K
        break
    elif A == d and B <= K:
        s = s
        K = K - B
        B = d
    elif A == d and  B != d and B > K:
        pass
        break
    elif A == d and B == d and C <= K:
        s -= (1*C)
        C = d
        break
    elif A == d and B == d and C != d and C > K:
        s -= (1*K)
        break
print(s)
Buggy python submission (verdict: Runtime Error):
f = True
while True:
    if f:
        C = C - B
        f = False
    else:
        A = A - D
        f = True
    if A <= 0:
        print('No')
        break
    elif C <= 0:
        print('Yes')
        break
    else:
        continue



Fixed submission:
A,B,C,D = (int(x) for x in input().split())
f = True
while True:
    if f:
        C = C - B
        f = False
    else:
        A = A - D
        f = True
    if A <= 0:
        print('No')
        break
    elif C <= 0:
        print('Yes')
        break
    else:
        continue
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
l = []
k = 0
for i in range(N):
    S = input()
    l.append(S)
for i in range(N):
    while True:
        try:
            a = l.index(l[i])
        except ValueError:
            k += 1
            break
print(k) 

Fixed submission:
N = int(input())
l = []
k = 1
for i in range(N):
    S = input()
    l.append(S)
l.sort()
for i in range(N-1):
    if l[i] != l[i+1]:
        k += 1
    else:
        pass
print(k)
Buggy python submission (verdict: Runtime Error):
list_1 = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k = int(input())
print(list_1[k])

Fixed submission:
list_1 = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
k = int(input())
print(list_1[k-1])
Buggy python submission (verdict: Runtime Error):
weather = input()

elif weather in ["RRR"]:
    print("3")
elif weather in ["SRR","RRS"]:
    print("2")
elif weather in ["SSR","SRS","RSS","RSR"]:
    print("1")
else:
    print("0")

Fixed submission:
weather = input()

if weather in ["RRR"]:
    print("3")
elif weather in ["SRR","RRS"]:
    print("2")
elif weather in ["SSR","SRS","RSS","RSR"]:
    print("1")
else:
    print("0")

Buggy python submission (verdict: Runtime Error):
weather = input()

if weather in [RRR]:
    print("3")
elif weather in [RR]:
    print("2")
elif weather in [R]:
    print("1")
else:
    print("0")

Fixed submission:
weather = input()

if weather in ["RRR"]:
    print("3")
elif weather in ["SRR","RRS"]:
    print("2")
elif weather in ["SSR","SRS","RSS","RSR"]:
    print("1")
else:
    print("0")

Buggy python submission (verdict: Runtime Error):
X, K, D = [int(i) for i in input().strip().split(' ')]

tmp = X // D
d1 = X - (D * tmp)
d2 = X - (D * (tmp + 1))

if tmp >= K:
  ans = X - (D * K)
else:
  if (tmp % 2) ^ (K % 2) == 0:
    ans = d1
  else:
    ans = d2

print(abs(ans))


Fixed submission:
S = input().strip()
print(max([len(i) for i in S.split('S')]))

Buggy python submission (verdict: Runtime Error):
n = input()
    if n == "RRR":
        print("3")
    elif n[:2] == "RR" or n[1:] == "RR":
        print("2")
    elif n=="SSS":
        print("0")
    else:
        print("1")

Fixed submission:
n = input()
if n == "RRR":
    print("3")
elif n[:2] == "RR" or n[1:] == "RR":
    print("2")
elif n=="SSS":
    print("0")
else:
    print("1")
Buggy python submission (verdict: Runtime Error):
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A, 😎

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):
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A, B)

Fixed submission:
S, a = input(), ""
for x in range(len(S)):
    a += "x"
print(a)
Buggy python submission (verdict: Time Limit Exceeded):
N,K= map(int,input().split())
health = list(map(int,input().split()))
health = sorted(health,reverse=True)

if K > N: 
    print(0)
else:
    for i in range(K):
        health.pop(0)
    res = sum(health)
    print(res)

Fixed submission:

N, K = map(int, input().split())
Hs = map(int,input().split())
print(sum(sorted(Hs, reverse=True)[K::]))
Buggy python submission (verdict: Runtime Error):
num = int(input()).split()
if num[0] * 500 > num[1]: print("Yes")
else: print("No")

Fixed submission:
num = input().split()
if int(num[0])*500 >= int(num[1]):
    print("Yes")
else: 
    print("No")
Buggy python submission (verdict: Runtime Error):
n,m = input(),input
print(n+m)

Fixed submission:
string = input().split()
print(string[1]+string[0])
Buggy python submission (verdict: Runtime Error):
n,m = int(input()), int(input())
i =1
while true:
  if i%n == 0 and i%m == 0:
    print(i)
    break
  i+= 1

Fixed submission:
def gcd(a, b):
    return b if a == 0 else gcd(b%a, a)
num = [int(x) for x in input().split(" ")]
print(int(num[0]*num[1]/gcd(num[0], num[1])))
Buggy python submission (verdict: Runtime Error):
import sys
 
def read_input():
  return sys.stdin.readline().strip().split(' ')
 
def task(s):
  rainy_til = []
  l = len(s)
  i = 0
  while i < l:
    if s[i] == 'R':
      last_rainy = rainy_til[i-1] if i > 0 else 0
      rainy_til[i] = last_rainy + 1
    else:
      rainy_til[i] = 0
  return max(rainy_til)
 
def main():
  s = read_input()
  result = task(s)
  print(result)

main()


Fixed submission:
import sys


def read_input():
    return sys.stdin.readline().strip().split(' ')


def task(s):
    rainy_til = []
    l = len(s)
    i = 0
    while i < l:
        if s[i] == 'R':
            last_rainy = rainy_til[i - 1] if i > 0 else 0
            rainy_til.append(last_rainy + 1)
        else:
            rainy_til.append(0)
        i += 1
    return max(rainy_til)


def main():
    [s] = read_input()
    result = task(s)
    print(result)


main()

Buggy python submission (verdict: Runtime Error):
S = input()
RD = weather.count('R')
if RD < 2:
    print(RD)
else:
    if S[1] == 'R':
        print(RD)
    else:
        print(1)

Fixed submission:
weather = input()
rainyDay = weather.count('R')
if rainyDay < 2:
    print(rainyDay)
else:
    if weather[1] == 'R':
        print(rainyDay)
    else:
        print(1)
Buggy python submission (verdict: Time Limit Exceeded):

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

Con = 10**18

ans = 1
for i in A:
    ans*=i


print(ans if ans<=Con else "-1")

Fixed submission:
# import functools
N = int(input())
A = list(map(int,input().split()))

Con = 10**18

ans = 1
if A.__contains__(0):
    print(0)
else:
    for i in A:
        if ans <=Con:
            ans*=i
        else:
            break
    print(ans if ans<=Con else "-1")

Buggy python submission (verdict: Time Limit Exceeded):
# import functools
import math
N = int(input())
A = list(map(int,input().split()))


Con = 10**18
# ans = functools.reduce(lambda a,b: a*b,A)
# print(ans if ans<=Con else "-1")

ans = math.prod(A)
print(ans if ans<=Con else "-1")

Fixed submission:
# import functools
N = int(input())
A = list(map(int,input().split()))

Con = 10**18

ans = 1
if A.__contains__(0):
    print(0)
else:
    for i in A:
        if ans <=Con:
            ans*=i
        else:
            break
    print(ans if ans<=Con else "-1")

Buggy python submission (verdict: Time Limit Exceeded):
import functools
N = int(input())
A = list(map(int,input().split()))


Con = 10**18
ans = functools.reduce(lambda a,b: a*b,A)
print(ans if ans<=Con else "-1")

Fixed submission:
# import functools
N = int(input())
A = list(map(int,input().split()))

Con = 10**18

ans = 1
if A.__contains__(0):
    print(0)
else:
    for i in A:
        if ans <=Con:
            ans*=i
        else:
            break
    print(ans if ans<=Con else "-1")

Buggy python submission (verdict: Time Limit Exceeded):
import functools
N = int(input())
A = list(map(int,input().split()))


if A.__contains__(0):
    print(0)
else:
    Con = 10**18
    ans = functools.reduce(lambda a,b: a*b,A)
    print(ans if ans<=Con else "-1")

Fixed submission:
# import functools
N = int(input())
A = list(map(int,input().split()))

Con = 10**18

ans = 1
if A.__contains__(0):
    print(0)
else:
    for i in A:
        if ans <=Con:
            ans*=i
        else:
            break
    print(ans if ans<=Con else "-1")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lotteries = []
for i in range(0,N):
    lotteries.append(input())

answer = list()
for i in lotteries:
    if not (answer.__contains__(i)):
        answer.append(i)
    else:
        continue

print(len(answer))

Fixed submission:
N = int(input())
lotteries = []
for i in range(0,N):
    lotteries.append(input())

print(len(set(lotteries)))
Buggy python submission (verdict: Runtime Error):
N = input()
print("Yes" if N.contains("7") else "No")

Fixed submission:
N = input()
print("Yes" if N.__contains__("7") else "No")

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

print("Yes" if N.contains("7") else "No")

Fixed submission:
N = input()
print("Yes" if N.__contains__("7") else "No")
Buggy python submission (verdict: Runtime Error):
x,y,z = map(int,input().split())


temp = x
x = z
z = temp

temp = z
z = y
y = temp

print(f"{x} {y} {z}")

Fixed submission:
x,y,z = map(int,input().split())


temp = x
x = z
z = temp

temp = z
z = y
y = temp

print(x,y,z)
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
A = list(map(int,input().split()))



def check(A,M):
    flag = 0
    sumOfA = 0
    for i in A:
        sumOfA+=A
    condition = sumOfA/(4*M)
    if(M==1 and max(A)>condition):
        return "Yes"
    for i in A:
        if(i <= condition):
            continue
        else:
            flag+=1
            if(flag==M):
                return "Yes"
    return "No"

print(check(A,M) else "No")





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



def check(A,M):
    flag = 0
    condition = sum(A)/(4*M)
    if(M==1 and max(A)>condition):
        return "Yes"
    for i in A:
        if(i < condition):
            continue
        elif(i >= condition):
            flag+=1
            if(flag==M):
                return "Yes"
    return "No"

print(check(A,M))
Buggy python submission (verdict: Runtime Error):
S = input()
S = input("")
if(S[2].__eq__(S[3]) and S[4].__eq__(S[5])):
    print("Yes")
else:
    print("No")

Fixed submission:
S = input("")
if(S[2].__eq__(S[3]) and S[4].__eq__(S[5])):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split(" "))
if N<10:
  print(a+(100*(10-N)))
else:
  print(M)

Fixed submission:
N,M = map(int,input().split(" "))
if N<10:
  print(M+(100*(10-N)))
else:
  print(M)

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
if N<10:
  print(a+(100*(10-N)))
else:
   print(M)

Fixed submission:
N,M = map(int,input().split(" "))
if N<10:
  print(M+(100*(10-N)))
else:
  print(M)

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
if N<10:
  print(a+(100*(10-N)))
 else:
  print(M)

Fixed submission:
N,M = map(int,input().split(" "))
if N<10:
  print(M+(100*(10-N)))
else:
  print(M)