Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys;print(int(sys.argv[1][-6:-5])/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
print(int(__file__[-6:-5])/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
print(int(__file__[5])/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
print(int(__file__[6])/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
print(int(__file__[4])/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
print(int(__file__[4])/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
import re;print(int(re.sub('¥D',"",__file__))/2)

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1

Buggy python submission (verdict: Runtime Error):
print __file__

Fixed submission:
_=int(input());c=0
for i in 'i¥½ÃÉ':
  if (_ < ord(i)):
    print(c)
    break
  c+=1
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
p = 1
for i in range(n):
    p *= a[i]
if p > int(1E18):
    print(-1)
else:
    print(p)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
p = 1
if a.count(0):
    print(0)
    exit(0)
for i in range(n):
    p *= a[i]
    if p > int(1E18):
        print(-1)
        exit(0)
print(p)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
p = 1
for i in range(n):
    p *= a[i]
if p > int(1E18):
    print(-1)
else
    print(p)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
p = 1
if a.count(0):
    print(0)
    exit(0)
for i in range(n):
    p *= a[i]
    if p > int(1E18):
        print(-1)
        exit(0)
print(p)
Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
a = list(map(int, input().split()))

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

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

s = set()
for i in range(n):
    pow, cur = 0, a[i]
    while cur % 2 == 0:
        cur //= 2
        pow += 1
    s.add(pow)
if (len(s) > 1):
    print(0)
else:
    l = a[0] // 2
    for i in range(1, n):
        l = lcm(l, a[i] // 2)
    res, cur = 0, l
    while cur <= m:
        res += 1
        cur += 2 * l
    print(m // l - m // (2 * l))

Fixed submission:
from fractions import gcd
n, m = map(int, input().split())
a = [int(i) // 2 for i in input().split()]

def pow2(n):
    cur, res = n, 0
    while cur:
        if cur % 2 == 0:
            cur //= 2
            res += 1
        else:
            return res

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

b = [pow2(i) for i in a]
if (min(b) != max(b)):
    print(0)
    exit(0)
l = 1
for i in range(n):
    l = lcm(l, a[i])
print(m // l - m // (2 * l))

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

def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

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

s = set()
for i in range(n):
    pow, cur = 0, a[i]
    while cur % 2 == 0:
        cur //= 2
        pow += 1
    s.add(pow)
if (len(s) > 1):
    print(0)
else:
    l = a[0] // 2
    for i in range(1, n):
        l = lcm(l, a[i] // 2)
    res, cur = 0, l
    while cur <= m:
        res += 1
        cur += 2 * l
    print(res)

Fixed submission:
from fractions import gcd
n, m = map(int, input().split())
a = [int(i) // 2 for i in input().split()]

def pow2(n):
    cur, res = n, 0
    while cur:
        if cur % 2 == 0:
            cur //= 2
            res += 1
        else:
            return res

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

b = [pow2(i) for i in a]
if (min(b) != max(b)):
    print(0)
    exit(0)
l = 1
for i in range(n):
    l = lcm(l, a[i])
print(m // l - m // (2 * l))
Buggy python submission (verdict: Runtime Error):
N = int(input())
k = 0
x = 0
while N > 1: 
  N = N/10
  k += 1
for i in range(k):
  N = N*10
  a = N//10
  x = x + a
  N = N - a
if x//9 == 0:
  print("yes")
else:
  print("no")

Fixed submission:
s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
a = N//X
b = N%X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

Buggy python submission (verdict: Runtime Error):
[N, X, T] = input[] 

a = N/X
b = N//X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

Fixed submission:
s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
a = N//X
b = N%X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

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

a = N/X
b = N//X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

Fixed submission:
s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
a = N//X
b = N%X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

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

a = N/X
b = N//X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

Fixed submission:
s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
a = N//X
b = N%X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

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

a = N/X
b = N//X
k1 = a*T
k2 = k1 + 1
if b == 0:
  print(k1)
else:
  print(k2)

Fixed submission:
s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
a = N//X
b = N%X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)

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

a = N/X
b = N//X
if b == 0:
  print(a*T)
else:
  print(a*T + 1)
  

Fixed submission:
s = input().split()
N = int(s[0])
X = int(s[1])
T = int(s[2])
a = N//X
b = N%X
k1 = a*T
k2 = k1 + T
if b == 0:
  print(k1)
else:
  print(k2)
Buggy python submission (verdict: Runtime Error):
S = input()
text = ['dream','dreamer','erase','eraser']

def search(s):
  if len(s) == 0:
    return 1
  
  flg = 0
  for t in text:
    if len(s) < len(t):
      continue
    if s.find(t) == 0:
      flg |= search(s[len(t):])
      
  return flg

if search(S):
  print('YES')
else:
  print('NO')
      

Fixed submission:
S = input()[::-1]
text = ['dream','dreamer','erase','eraser']
text = [t[::-1] for t in text]

while len(S) > 0:
  for t in text:
    if S.find(t) == 0:
      S = S[len(t):]
      break
  else:
    print('NO')
    break
else:
  print('YES')

Buggy python submission (verdict: Runtime Error):
S = input()
text = ['dream','dreamer','erase','eraser']

def search(s):
  if len(s) == 0:
    return 1
  
  flg = 0
  for t in text:
    if s.find(t) == 0:
      flg |= search(s[len(t):])
      
  return flg

if search(S):
  print('YES')
else:
  print('NO')
      

Fixed submission:
S = input()[::-1]
text = ['dream','dreamer','erase','eraser']
text = [t[::-1] for t in text]

while len(S) > 0:
  for t in text:
    if S.find(t) == 0:
      S = S[len(t):]
      break
  else:
    print('NO')
    break
else:
  print('YES')
Buggy python submission (verdict: Runtime Error):
S=print()
print(-S.count('-')+S.count('+'))

Fixed submission:
S=input()
print(-S.count('-')+S.count('+'))

Buggy python submission (verdict: Runtime Error):
S=print()
print(-S.count('-'+S.count('+'))

Fixed submission:
S=input()
print(-S.count('-')+S.count('+'))
Buggy python submission (verdict: Runtime Error):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn += int(S[-i])
ans = "No"
if int(S) % Sn == 0:ans = "Yes"

print(ans)

Fixed submission:
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)

Buggy python submission (verdict: Runtime Error):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn += int(S[-i])
ans = "No"
if int(S) % Sn == 0:ans = "Yes"

print(ans)

Fixed submission:
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)

Buggy python submission (verdict: Runtime Error):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if int(S) % Sn == 0:ans = "Yes"

print(ans)

Fixed submission:
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)

Buggy python submission (verdict: Runtime Error):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if int(S) / Sn == 0:ans = "Yes"
print(ans)

Fixed submission:
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)
Buggy python submission (verdict: Runtime Error):
int(x)=input()

if x>=30:
    print('Yes')
else:
    print("No")

Fixed submission:
x=input()
x=int(x)
if x>=30:
    print('Yes')
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
x=inport()
if 400<=x<=599:
  print(8)
elif 600<=x<=799:
  print(7)
elif 800<=x<=999:
  print(6)
elif 1000<=x<=1199:
  print(5)
elif 1200<=x<=1399:
  print(4)
elif 1400<=x<=1599:
  print(3)
elif 1600<=x<=1799:
  print(2)
else:
  print(1)

Fixed submission:
x=input()

x=int(x)
if 400<=x<=599:
  print(8)
elif 600<=x<=799:
  print(7)
elif 800<=x<=999:
  print(6)
elif 1000<=x<=1199:
  print(5)
elif 1200<=x<=1399:
  print(4)
elif 1400<=x<=1599:
  print(3)
elif 1600<=x<=1799:
  print(2)
elif 1800<=x<=1999:
  print(1)
Buggy python submission (verdict: Runtime Error):
n,w = map(int,input().split())
m = 1001
for i in range(n):
    a,b = map(int,input().split())
    if b <= w and a < m:
        m = a
if m == 1001:
    print("TLE")
else:
    print(m)
    


Fixed submission:
a=int(input())

if(a==1):
    print('Hello World')

elif(a==2):
    A=int(input())
    B=int(input())
    print(A+B)
Buggy python submission (verdict: Runtime Error):
K=int(input())

c=K%2

if(c==0):
    print((K/2)^2)
else:
    print(int(K/2)*(int(K/2)+1))


Fixed submission:
K=int(input())

c=K%2

if(c==0):
    print(int((K/2)*(K/2)))
else:
    print(int(K/2)*(int(K/2)+1))
Buggy python submission (verdict: Runtime Error):
a=input().strip().split(" ")
b=[int(i) for in a]

if(b[0]<=8 and b[1]<=8):
    print("Yay!")
else:
    print(":(")


Fixed submission:
a=input().strip().split(" ")
b=[int(i) for i in a]

if(b[0]<=8 and b[1]<=8):
    print("Yay!")
else:
    print(":(")
Buggy python submission (verdict: Time Limit Exceeded):
A,B,K=map(int,input().strip().split(" "))
c=[]

if(A==B and K>=1):
    print(A)
    quit()
elif(A==B and K==0):
    quit()

if(B<=K):
    for i in range(A,B+1):
        print(i)
    quit()

else:

    if(K>B):
        K=B

    for i in range(K):
        if(A+i<=B):
            print(A+i)
        c.append(A+i)

    for i in range(0,A):
        c.append(i)

    if(B-K<=0):
        quit()


    for i in range(B-K+1,B+1):
        if(i not in c and i<=B):
            print(i)


Fixed submission:
A,B,K=map(int,input().strip().split(" "))
c=[]

if(A==B and K>=1):
    print(A)
    quit()
elif(A==B and K==0):
    quit()

if(B<=K):
    for i in range(A,B+1):
        print(i)
    quit()

else:

    if(K>B):
        K=B

    for i in range(K):
        if(A+i<=B):
            print(A+i)
        c.append(A+i)


    if(B-K<=0):
        quit()


    for i in range(B-K+1,B+1):
        if(i not in c and i<=B and i>=A):
            print(i)

Buggy python submission (verdict: Time Limit Exceeded):
A,B,K=map(int,input().strip().split(" "))
c=[]

if(K>B):
    K=B

for i in range(K):
    if(A+i<=B):
        print(A+i)
    c.append(A+i)

for i in range(A):
    c.append(i)

if(B-K<=0):
    quit()


for i in range(B-K+1,B+1):
    if(i not in c and i<=B):
        print(i)


Fixed submission:
A,B,K=map(int,input().strip().split(" "))
c=[]

if(A==B and K>=1):
    print(A)
    quit()
elif(A==B and K==0):
    quit()

if(B<=K):
    for i in range(A,B+1):
        print(i)
    quit()

else:

    if(K>B):
        K=B

    for i in range(K):
        if(A+i<=B):
            print(A+i)
        c.append(A+i)


    if(B-K<=0):
        quit()


    for i in range(B-K+1,B+1):
        if(i not in c and i<=B and i>=A):
            print(i)
Buggy python submission (verdict: Runtime Error):
a=int(input())

b=list(a)

if(b[0]==9 or b[1]==9):
    print("Yes")
else:
    print("No")


Fixed submission:
a=input()

b=list(a)

b=[int(i) for i in b]

if(b[0]==9 or b[1]==9):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a=input()strip().split(" ")

b=[int(i) for i in a]

c=b[0]+b[1]

if(c>=10):
    print("error")
else:
    print(c)


Fixed submission:
a=input().strip().split(" ")

b=[int(i) for i in a]

c=b[0]+b[1]

if(c>=10):
    print("error")
else:
    print(c)

Buggy python submission (verdict: Runtime Error):
a=input()strip().split(" ")

b=[int(i) for i in a]

c=b[0]+c[1]

if(c>=10):
    print("error")
else:
    print(c)

Fixed submission:
a=input().strip().split(" ")

b=[int(i) for i in a]

c=b[0]+b[1]

if(c>=10):
    print("error")
else:
    print(c)
Buggy python submission (verdict: Runtime Error):
a=input().strip().splt(" ")

b=[int(i) for i in a]

if(b[1]-b[0]==b[2]-b[1]):
    print("YES")
else:
    print("NO")


Fixed submission:
a=input().strip().split(" ")

b=[int(i) for i in a]

if(b[1]-b[0]==b[2]-b[1]):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
O=input()
E=input()

b=[]

if(len(O)>len(E)):
    X=O
else:
    X=E

for i in range(len(X)):
    b.append(O[i])
    b.append(E[i])

a=str(b)

a=a.replace("'","")
a=a.replace(",","")
a=a.replace(" ","")
a=a.replace("[","")
a=a.replace("]","")



print(a)


Fixed submission:
O=input()
E=input()

S=''

for i in range(len(E)):
    S+=O[i]+E[i]
if(len(O)>len(E)):
    S+=O[-1]

print(S)
Buggy python submission (verdict: Time Limit Exceeded):
a=int(input())
Sum=1

for i in range(1,a+1):
    Sum*=i

print(Sum%(10**9+7))


Fixed submission:
a=int(input())
Sum=1
b=10**9+7

for i in range(1,a+1):
    Sum=(Sum*i)%b

print(Sum)
Buggy python submission (verdict: Runtime Error):
a=input().strip().split(" ")

b=[int(i) for i in a]

for i in range(2):
    if(b[i]==1):
        b[i]="13"
    else:
        b[i]=b[i]-1

if(b[0]>b[1]):
    print("Alice")
elif(b[0]==b[1]):
    print("Draw")
else:
    print("Bob")



Fixed submission:
a=input().strip().split(" ")

b=[int(i) for i in a]

for i in range(2):
    if(b[i]==1):
        b[i]=int(13)
    else:
        b[i]=b[i]-1

if(b[0]>b[1]):
    print("Alice")
elif(b[0]==b[1]):
    print("Draw")
else:
    print("Bob")
Buggy python submission (verdict: Runtime Error):
a=int(input())

if(a<1200):
    print("ABC")
else:
    print("ARC)


Fixed submission:
a=int(input())

if(a<1200):
    print("ABC")
else:
    print("ARC")
Buggy python submission (verdict: Runtime Error):
a=input().strip().split(" ")

b=[int(i) for i in a]

if(a[0]*a[1]>a[2]*a[3]):
    print(a[0]*a[1])
else:
    print(a[2]*a[3])


Fixed submission:
a=input().strip().split(" ")

b=[int(i) for i in a]

if(b[0]*b[1]>b[2]*b[3]):
    print(b[0]*b[1])
else:
    print(b[2]*b[3])
Buggy python submission (verdict: Time Limit Exceeded):
K,S=map(int,input().strip().split(" "))
count=0

for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if((x+y+z)==S):
                count+=1
                #print(x,y,z)
print(count)
            


Fixed submission:
"""
K,S=map(int,input().strip().split(" "))
count=0

for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if((x+y+z)==S):
                count+=1
                #print(x,y,z)
print(count)
            
"""

K,S=map(int,input().strip().split(" "))
count=0

for x in range(K+1):
    for y in range(K+1):
        if(0<=S-x-y<=K):
            count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
a=input().strip().split(" ")

if(a[1]=="+"):
    print(a[0]+a[2])
else:
    print(a[0]-a[2])
    


Fixed submission:
a=input().strip().split(" ")

a[0]=int(a[0])
a[2]=int(a[2])


if(a[1]=="+"):
    print(a[0]+a[2])
else:
    print(a[0]-a[2])
Buggy python submission (verdict: Runtime Error):
a, b, x = [int(x) for x in input().split()]
print(b // x - a // x + (a % x == 0))a,b,x=map(int,input().strip().split(" "))
count=0

count_a=a//x
count_b=b//x

if(a%x==0):
    count_a-=-1

count=count_b-count_a

print(count)



Fixed submission:
a, b, x = [int(x) for x in input().split()]
print(b // x - a // x + (a % x == 0))

Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=map(int,input().strip().split(" "))
count=0

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

print(count)


Fixed submission:
a, b, x = [int(x) for x in input().split()]
print(b // x - a // x + (a % x == 0))
Buggy python submission (verdict: Runtime Error):
sa=input()
sb=input()
sc=input()

sa=list(sa)
sb=list(sb)
sc=list(sc)

for i in range(len(sa)+len(sb)+len(sc)):
    if(sa[0])


Fixed submission:
def solve(sa, sb, sc, t):
	d = {'a': sa, 'b': sb, 'c': sc}
	if d[t] == '':
		return t.upper()
	u = d[t][0]
	d[t] = d[t][1:]
	return solve(d['a'], d['b'], d['c'], u)

SA = input()
SB = input()
SC = input()
print(solve(SA, SB, SC, 'a'))
Buggy python submission (verdict: Runtime Error):
a=input()

b=[int(i) for i in a]

if(b[0]==5 and b[1]==5 and b[2]==7):
    print("YES")
elif(b[1]==5 and b[2]==5 and b[0]==7)
    print("YES")
elif(b[2]==5 and b[0]==5 and b[1]==7)
    print("YES")
else:
    print("NO")









Fixed submission:
a=input().strip().split(" ")

b=[int(i) for i in a]

if(b[0]==5 and b[1]==5 and b[2]==7):
    print("YES")
elif(b[1]==5 and b[2]==5 and b[0]==7):
    print("YES")
elif(b[2]==5 and b[0]==5 and b[1]==7):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
N,L=map(int,input().strip().split(" "))
a=[]

for i in range(L):
    a.append(input())

a.sort()

b=str(a)
b=b.replace(",","")
b=b.replace("[","")
b=b.replace("]","")
b=b.replace("'","")
b=b.replace(" ","")


print(b)


Fixed submission:
N,L=map(int,input().strip().split(" "))
a=[]

for i in range(N):
    a.append(input())

a.sort()

b=str(a)
b=b.replace(",","")
b=b.replace("[","")
b=b.replace("]","")
b=b.replace("'","")
b=b.replace(" ","")


print(b)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input()))

ans=0

for i in range(n-1):
    if a[i]>a[i+1]:
        ans+=a[i]-a[i+1]
        a[i+1]=a[i]
print(ans)


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

ans=0

for i in range(n-1):
    if a[i]>a[i+1]:
        ans+=a[i]-a[i+1]
        a[i+1]=a[i]
print(ans)

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

ans=0

for i in range(n):
    if [a(i)]>[a(i+1)]:
        ans+=[a(i)]-[a(i+1)]
print(ans)

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

ans=0

for i in range(n-1):
    if a[i]>a[i+1]:
        ans+=a[i]-a[i+1]
        a[i+1]=a[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
N, X, T = map(int,input().split())

ans=N//X*T if N%X==0 else ans=(N//X+1)*T
print(ans)

Fixed submission:
n, x, t = map(int, input().split())
if n % x == 0:
    ans = n//x
else :
    ans = n//x + 1
 
ans *= t
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()

if s = "RRR":
  print(3)
elif s = "RRS" or s = "SRR":
  print(2)
elif s = "SSS":
  print(0)
else:
  print(1)

Fixed submission:
s = input()

if s == "RRR":
  print(3)
elif s == "RRS" or s == "SRR":
  print(2)
elif s == "SSS":
  print(0)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
n=input()
n=list(n)
if n[len(n)-1]==3:
  print("bon")
elif n[len(n)-1]==0 or n[len(n)-1]==1 or n[len(n)-1]==6 or n[len(n)-1]==8:
  print("pon"):
else:
  print("hon")

Fixed submission:
n=int(input())
n=n%10

if n in [2,4,5,7,9]:
  print("hon")
elif n in [0,1,6,8]:
  print("pon")
else:
  print("bon")

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

Fixed submission:
n=int(input())
n=n%10

if n in [2,4,5,7,9]:
  print("hon")
elif n in [0,1,6,8]:
  print("pon")
else:
  print("bon")
Buggy python submission (verdict: Runtime Error):
S,T=input()
a=0
for i in range(len(S)):
  if S[i]!=T[i]:
    a+=1
if a==0:
  print("Yes")
else:
  print("No")

	
  


Fixed submission:
S=input()
T=input()
a=0
for i in range(len(S)):
  if S[i]!=T[i]:
    a+=1
if a==0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
K=int(input())
A,B=map(int,input().split())
for i in range(A,B+1):
  if i%K==0:
    print("OK")
    exec()
print("NG")

Fixed submission:
k=int(input())
a,b=map(int,input().split())
s=""
for i in range(a,b+1):
  if i%k==0:
    s="OK"
    print(s)
    break
if s!="OK":
  print("NG")

Buggy python submission (verdict: Runtime Error):
K=int(input())
A,B=map(int,input().split())
a=0
for i in range(A,B+1):
  if i%k==0:
    a+=1
if a==1:
  print("OK")
else:
  print("NG")

Fixed submission:
k=int(input())
a,b=map(int,input().split())
s=""
for i in range(a,b+1):
  if i%k==0:
    s="OK"
    print(s)
    break
if s!="OK":
  print("NG")

Buggy python submission (verdict: Runtime Error):
K=int(input())
A,B=map(int,input().split())
a=0
if i in range(A,B+1):
  if i%k==0:
    a+=1
if a==1:
  print("OK")
else:
  print("NG")

Fixed submission:
k=int(input())
a,b=map(int,input().split())
s=""
for i in range(a,b+1):
  if i%k==0:
    s="OK"
    print(s)
    break
if s!="OK":
  print("NG")

Buggy python submission (verdict: Runtime Error):
K=int(input())
A,B=map(int,input().split())
a=0
if i in range(A,B+1):
  if k%i==0:
    a+=1
if a==1:
  print("OK")
else:
  print("NG")

Fixed submission:
k=int(input())
a,b=map(int,input().split())
s=""
for i in range(a,b+1):
  if i%k==0:
    s="OK"
    print(s)
    break
if s!="OK":
  print("NG")
Buggy python submission (verdict: Runtime Error):
n=input()
if 7 in n:
  print("Yes")
else:
  print("No")

Fixed submission:
N=input()
if N.count("7"):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s=list(map(str,input().split()))
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Fixed submission:
s=input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")