Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    


main()




Fixed submission:
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    x,n = mi()
    p = li()
    for i in range(100):
        if not x-i in p:
            print(x-i)
            exit()
        elif not x+i in p:
            print(x+i)
            exit()



main()
Buggy python submission (verdict: Runtime Error):
#gcdは3.4.3だとfractionsにある
#from fractions import gcd

from math import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    a,b,c = mi()
    a,b = b,a
    a,c = c,a
    print(a,b,c)



main()





Fixed submission:
#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    x,y,z = mi()
    y,x = x,y
    z,x = x,z
    print(x,y,z)


main()
Buggy python submission (verdict: Runtime Error):
hogehoge

Fixed submission:
#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "YES"
no = "NO"




def main():
    k = ii()
    a = [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(a[k-1])



        
    


main()
Buggy python submission (verdict: Runtime Error):

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

def main():
    h = ii()
    w = ii()
    n = ii()
    print(ceil(n/max(h,w)))




main()


Fixed submission:

#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

def main():
    h = ii()
    w = ii()
    n = ii()
    print(ceil(n/max(h,w)))




main()
Buggy python submission (verdict: Runtime Error):
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    a,b,k = mi()

    if a-k>0:
        print(a-k,b)
    else:
        k-=a
        print(0,max(b-k,0))


main()




Fixed submission:
#from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    a,b,k = mi()

    if a-k>0:
        print(a-k,b)
    else:
        k-=a
        print(0,max(b-k,0))


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

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

def lcm(x, y):
    return (x * y) // math.gcd(x, y)


def main():
    a,b = mi()

    print(lcm(a, b))

    
main()


Fixed submission:
#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    a,b = mi()

    print(lcm(a, b))

    
main()
Buggy python submission (verdict: Runtime Error):
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n,k,q = mi()
    alist = [0 for i in range(100005)]
    for i in range(q):
        a = ii()
        alist[a]+=1
	for i in range(1,n+1):
        if alist[i] > q-k:
            print('Yes')
        else:
            print('No')
    


main()


Fixed submission:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n,k,q = mi()
    alist = [0 for i in range(100005)]
    for i in range(q):
        a = ii()
        alist[a]+=1
    
    for i in range(1,n+1):
        if alist[i] > q-k:
            print('Yes')
        else:
            print('No')
    


main()

Buggy python submission (verdict: Runtime Error):
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n,k,q = mi()
    alist = [0 for i in range(100005)]
    for i in range(q):
        a = ii()
        alist[a]+=1
   
  	for i in range(1,n+1):
        if alist[i] > q-k:
            print('Yes')
        else:
            print('No')
    


main()


Fixed submission:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n,k,q = mi()
    alist = [0 for i in range(100005)]
    for i in range(q):
        a = ii()
        alist[a]+=1
    
    for i in range(1,n+1):
        if alist[i] > q-k:
            print('Yes')
        else:
            print('No')
    


main()
Buggy python submission (verdict: Runtime Error):
from math import factorial
from sys import exit

bign = 10**9 + 7


n,k = map(int,input().split())
nk = n-k+1

if n == k:
    print(1)
    for i in range(k-1):
        print(0)
    exit()

ans = nk
print(ans)
if k-1<=nk:
    for i in range(1,k):
        i1 = i+1
        ans = (ans * (nk-i) / i1)
        ans = (ans * (k-i) / i)
        print(int(ans)%bign)
else:
    for i in range(1,nk+1):
        i1 = i+1
        ans = (ans * (nk-i) / i1)
        ans = (ans * (k-i) / i)
        print(int(ans)%bign)
    for i in range(k-1-nk):
        print(0)


Fixed submission:
from math import factorial
from sys import exit

bign = 10**9 + 7


n,k = map(int,input().split())
nk = n-k+1

if n == k:
    print(1)
    for i in range(k-1):
        print(0)
    exit()

ans = nk
print(ans)
if k-1<=nk:
    for i in range(1,k):
        i1 = i+1
        ans = (ans * (nk-i) // i1)
        ans = (ans * (k-i) // i)
        print(ans%bign)
else:
    for i in range(1,nk+1):
        i1 = i+1
        ans = (ans * (nk-i) // i1)
        ans = (ans * (k-i) // i)
        print(ans%bign)
    for i in range(k-1-nk):
        print(0)
Buggy python submission (verdict: Runtime Error):
import math

a, b, c, d = map(int, input().split())
cd = (c * d) // math.gcd(c, d)
a = a - 1
ac = a // c
ad = a // d
acd = a // cd
bc = b // c
bd = b // d
bcd = b // cd

ans = (b - a) - (bc + bd - bcd - (ac + ad - acd))
print(ans)

Fixed submission:
import fractions

a, b, c, d = map(int, input().split())
cd = (c * d) // fractions.gcd(c, d)
a = a - 1
ac = a // c
ad = a // d
acd = a // cd
bc = b // c
bd = b // d
bcd = b // cd

ans = (b - a) - (bc + bd - bcd - (ac + ad - acd))
print(ans)
Buggy python submission (verdict: Runtime Error):
import numpy as np

n = int(input())


splist1 = []
splist2 = []
for i in range(n):
    tmp,tmp2 = input().split()
    tmp2 = int(tmp2)
    splist1.append([tmp,i+1])
    splist2.append([tmp2,i+1])

splist1 = np.array(splist1)
splist2 = np.array(splist2)
splist1 = splist1[np.argsort(splist2[:, 0])[::-1]]

ans = splist1[np.argsort(splist1[:, 0],kind="stable")]

for i in ans:
    print(i[1])

Fixed submission:
n = int(input())
town = []
for i in range(n):
    s, p = input().split()
    p = int(p)
    town.append([s, p, i + 1])

town.sort(key=lambda x: x[1], reverse=True)
town.sort(key=lambda x: x[0])

for i in town:
    print(i[2])
Buggy python submission (verdict: Runtime Error):
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    n = ii()
    cnt = 0
    for i in range(1,n+1):
        if not i%2:
            continue
        tmp = 0
        for j in range(1,i+1):
            if not i%j:
                tmp+=1
        if tmp == 8:
            cnt+=1
    print(cnt)


main()




Fixed submission:
#from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    n = ii()
    cnt = 0
    for i in range(1,n+1):
        if not i%2:
            continue
        tmp = 0
        for j in range(1,i+1):
            if not i%j:
                tmp+=1
        if tmp == 8:
            cnt+=1
    print(cnt)


main()
Buggy python submission (verdict: Runtime Error):
from numpy import median
from copy import deepcopy

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

sx = x.sorted()
newl = deepcopy(sx)
del newl[0]
bigm = median(newl)
newl = deepcopy(sx)
del newl[-1]
minm = median(newl)

med = median(x)

for i in x:
    if i > med:
        print(minm)
    else:
        print(maxm)


Fixed submission:
from numpy import median
from copy import deepcopy

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

sx = sorted(x)
newl = deepcopy(sx)
del newl[0]
maxm = median(newl)
newl = deepcopy(sx)
del newl[-1]
minm = median(newl)

med = median(x)

for i in x:
    if i > med:
        print(int(minm))
    else:
        print(int(maxm))

Buggy python submission (verdict: Time Limit Exceeded):
from numpy import median
from copy import deepcopy

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

for i in range(n):
    newl = deepcopy(x)
    del newl[i]
    print(int(median(newl)))


Fixed submission:
from numpy import median
from copy import deepcopy

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

sx = sorted(x)
newl = deepcopy(sx)
del newl[0]
maxm = median(newl)
newl = deepcopy(sx)
del newl[-1]
minm = median(newl)

med = median(x)

for i in x:
    if i > med:
        print(int(minm))
    else:
        print(int(maxm))

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

for i in range(n/2):
    print(x[n/2])

for i in range(n/2):
    print(x[(n-1)//2])


Fixed submission:
from numpy import median
from copy import deepcopy

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

sx = sorted(x)
newl = deepcopy(sx)
del newl[0]
maxm = median(newl)
newl = deepcopy(sx)
del newl[-1]
minm = median(newl)

med = median(x)

for i in x:
    if i > med:
        print(int(minm))
    else:
        print(int(maxm))
Buggy python submission (verdict: Runtime Error):
jfrom math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


def main():
    n = ii()
    d, x = mi()
    a = []
    for i in range(n):
        tmp = ii()
        a.append(tmp)
    ans = 0
    for i in a:
        tmp = 1
        while tmp <= d:
            ans += 1
            tmp += i
    ans += x
    print(ans)


main()


Fixed submission:
from math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


def main():
    n = ii()
    d, x = mi()
    a = []
    for i in range(n):
        tmp = ii()
        a.append(tmp)
    ans = 0
    for i in a:
        tmp = 1
        while tmp <= d:
            ans += 1
            tmp += i
    ans += x
    print(ans)


main()
Buggy python submission (verdict: Runtime Error):
N,K = map(int, raw_input().split(" "))

points = []
pointsx = []
pointsy = []

smin = 0

for i in range(N):
    x,y = map(int, raw_input().split(" "))
    pointsx.append(x)
    pointsy.append(y)

spx = sorted(pointsx)

for i in range(N-K+1):
    for h in range(N-K-i+1):
        yneed = []
        for k in range(N):
            if pointsx[k]>=spx[i] and pointsx[k]<=spx[i+K+h-1]:
                yneed.append(pointsy[k])
        spy = sorted(yneed)
        ylength = 0
        xlength = spx[i+K+h-1]-spx[i]
        for k in range(len(spy) - K + 1):
            if ylength < spy[k+K-1]-spy[k]: ylength = spy[k+K-1]-spy[k]
        if smin == 0: smin = ylength * xlength
        elif smin > ylength * xlength:
            smin = ylength * xlength


print smin


Fixed submission:
a,b,c = map(int, raw_input().split(" "))
if a == b:
    print c
elif b == c:
    print a
else: print b
Buggy python submission (verdict: Time Limit Exceeded):
N,K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
def cal(a):
    res = 1
    for i in a:
        res*=i
    return res
score = [cal([j for j in A[i-K:i] ]) for i in range(K,N+1)]
for i in range(len(score)):
    if i==0: continue
    if score[i] > score[i-1]:
        print("Yes")
    else:
        print("No") 

Fixed submission:
N,K = list(map(int, input().split()))
A = [int(i) for i in input().split()]

for i in range(K,N):
    if A[i] > A[i-K]:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
ans=0
for i in range(1,1+N):
  if (i % 2 != 0) and (a[i-1] % 2 != 0):
    ans += 1
print(ans)


Fixed submission:
L,R,D = list(map(int,input().split()))
ans=0
for i in range(L,R+1):
  if i % D ==0:
    ans+=1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = map(int,input().split())
def kake(a):
  res=1
  for i in a:
    res*=i
  if res > 10**18:
    return -1
  else:
    return res
print(kake(A))

Fixed submission:
N = int(input())
A = map(int,input().split())
def kake(a):
  res=1
  for i in sorted(a):
    res*=i
    if res > 10**18:
      return -1
  else:
    return res
print(kake(A))
Buggy python submission (verdict: Runtime Error):
import math
A,B,H,M = map(int,input().split())
# long 0.25rad/m short 6rad/m
deg = abs(6*M-0.5*(60*H+M))
ans = (A**2 + B**2 - 2*A*B*math.cos(math.radians(deg))) ** (1/2)
print(ans)

Fixed submission:
N = str(input())
hon = [2,4,5,7,9]
 
for i in hon:
    if N[-1] == str(i):
        print("hon")
        exit()

if N[-1] == "3":
    print("bon")
else:
    print("pon")
Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
b = list(map(int, input().split(" ")))
flag = True
for i in b:
  if (b.count(i) >= 2):
    flag = False

if (flag == True):
  print("YES")
else:
  print("NO")

Fixed submission:
a = int(input())
b = list(map(int, input().split(" ")))
t = set(b)
bb = list(t)

if (len(b) == len(bb)):
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
N, M = list(map(int, input("").split(" ")))
permit = [list(map(int, input("").split(" "))) for i in range(M)]
able = [0 for i in range(N)]
for i,j in permit:
  for k in range(i,j+1):
    able[k-1] += 1
print(able.count(M))


Fixed submission:
N, M = list(map(int, input("").split(" ")))
permit = [list(map(int, input("").split(" "))) for i in range(M)]
l,r = 1, N
for i,j in permit:
  l = max(l, i)
  r = min(r, j)
print(max(r-l+1,0))
Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int,input().split())
res = 0
for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if S == x+y+z: res+=1
print(res)

Fixed submission:
K,S = map(int,input().split())
res = 0
for x in range(K+1):
    for y in range(K+1):
        if K >= S-x-y >= 0:
            res+=1
print(res)
Buggy python submission (verdict: Runtime Error):
n = int(input())

for d in range(1, n):
    if n <= 26 ** d:
        break
    n -= 26 ** d

n -= 1
out = ""
for i in range(d - 1, -1, -1):
    out += chr(ord('a') + n // (26 ** i))
    n %= 26 ** i
print(out)

Fixed submission:
n = int(input())

out = ""
while n > 0:
    n -= 1
    out += chr(ord('a') + n % 26)
    n //= 26

print(out[::-1])

Buggy python submission (verdict: Runtime Error):
n = int(input())
m = n

for d in range(1, n):
    if m <= 26 ** d:
        break
    m -= 26 ** d

out = ""
for i in range(d - 1, -1, -1):
    out += chr(ord('a') + n // (26 ** i) - 1)
    n %= 26 ** i
print(out)

Fixed submission:
n = int(input())

out = ""
while n > 0:
    n -= 1
    out += chr(ord('a') + n % 26)
    n //= 26

print(out[::-1])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
q = int(input())
d = dict()

for i in range(n):
    if a[i] not in d.keys():
        d[a[i]] = 1
    else:
        d[a[i]] += 1

for i in range(q):
    b, c = list(map(int, input().split()))
    if b in d.keys():
        if c in d.keys():
            d[c] += d[b]
            del d[b]
        else:
            d[c] = d[b]
            del d[b]
    print(sum([k * v for k, v in d.items()]))

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

for i in range(n):
    if a[i] not in d.keys():
        d[a[i]] = 1
    else:
        d[a[i]] += 1

s = sum([k * v for k, v in d.items()])

for i in range(q):
    b, c = list(map(int, input().split()))
    if b in d.keys():
        s += (c - b) * d[b]
        if c in d.keys():
            d[c] += d[b]
            d[b] = 0
        else:
            d[c] = d[b]
            d[b] = 0
    print(s)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

acc = 1
for i in range(n):
    acc *= a[i]

if acc > 10 ** 18:
    print(-1)
else:
    print(acc)

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

if 0 in a:
    print(0)
    exit(0)

acc = 1
for i in range(n):
    acc *= a[i]
    if acc > 10 ** 18:
        print(-1)
        exit(0)

print(acc)
Buggy python submission (verdict: Time Limit Exceeded):
from scipy.special import comb

n=int(input())
A=list(map(int,input().split()))
ans=0
for i in range(0,n-1):
    s=0
    for j in range(i+1,n):
        s+=A[j]
    s%=10**9+7
    ans+=(A[i]*s)
    
print(ans%(10**9+7))

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
s=0
ans=0
mod=10**9+7

for i in range(n):
    s+=A[i]

for i in range(0,n-1):
    s-=A[i]
    s%=mod
    ans+=(A[i]*s)
    ans%=mod
print(ans%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
from scipy.special import comb

n=int(input())
A=list(map(int,input().split()))
ans=0
for i in range(0,n-1):
    for j in range(i+1,n):
        ans+=(A[i]%(10**9+7))*(A[j]%(10**9+7))
        ans %= 10**9+7
print(ans)

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
s=0
ans=0
mod=10**9+7

for i in range(n):
    s+=A[i]

for i in range(0,n-1):
    s-=A[i]
    s%=mod
    ans+=(A[i]*s)
    ans%=mod
print(ans%(10**9+7))

Buggy python submission (verdict: Time Limit Exceeded):
from scipy.special import comb

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

ans=0
for i in range(0,n-1):
    for j in range(i+1,n):
        ans+=A[i]*A[j]
        ans %= 10**9+7
print(ans)

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
s=0
ans=0
mod=10**9+7

for i in range(n):
    s+=A[i]

for i in range(0,n-1):
    s-=A[i]
    s%=mod
    ans+=(A[i]*s)
    ans%=mod
print(ans%(10**9+7))
Buggy python submission (verdict: Runtime Error):
s=input()
if s=='RRR':
    print(3)
elif s=='RRS':
    print(2)
elif s=='RSR':
    print(1)
elif s=='SRR':
    pront(2)
elif s=='SSR':
    print(1)
elif s=='SRS':
    print(1)
elif s=='RSS':
    print(1)
elif s=='SSS':
    print(0)

Fixed submission:
s=input()

if 'RRR' in s:
    print(3)
elif 'RR' in s:
    print(2)
elif 'SSS' in s:
    print(0)
else :
    print(1)

Buggy python submission (verdict: Runtime Error):
s=input()
if s=='RRR':
    print(3)
elif s=='RRS':
    print(2)
elif s=='RSR':
    print(1)
elif s=='SRR':
    pront(2)
elif s=='SSR':
    print(1)
elif s=='SRS':
    print(1)
elif s=='RSS':
    print(1)
elif s=='SSS':
    print(0)
    


Fixed submission:
s=input()

if 'RRR' in s:
    print(3)
elif 'RR' in s:
    print(2)
elif 'SSS' in s:
    print(0)
else :
    print(1)

Buggy python submission (verdict: Runtime Error):
s=input()
if s=='RRR':
    print(3)
elif s=='RRS':
    print(2)
elif s=='RSR':
    print(1)
elif s=='SRR':
    pront(2)
elif s=='SSR':
    print(1)
elif s=='SRS':
    print(1)
elif s=='RSS':
    print(1)
else :print(0)
    


Fixed submission:
s=input()

if 'RRR' in s:
    print(3)
elif 'RR' in s:
    print(2)
elif 'SSS' in s:
    print(0)
else :
    print(1)