Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
S = input().lower
T = input().lower

for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S = input().lower
T = input().lower
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
from sys import stdin
S, T = stdin.readline().rstrip().split()
S = S[::-1]
if S == T:
  print("Yes")
else:
  print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S, T = stdin.readline().rstrip().split()
S = S[::-1]
if S == T:
  print("Yes")
else:
  print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S,T = str(stdin.readline().rstrip()).lower()
S = S[::-1]
if S == T:
  print("Yes")
else:
  print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S,T = str(stdin.readline().rstrip()).lower()
S = S[::-1]
if S == T:
  print("Yes")
else:
    print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S,T = str(stdin.readline().rstrip()).lower()
S = S[::-1]
if S = T:
  print("Yes")
else:
    print("No")

Fixed submission:
S = input().lower()
T = input().lower()
for i in range(len(S)):
  S = S[len(S)-1:len(S)] + S[0:len(S)-1]
  if S == T:
    break
if S == T:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
from sys import stdin
N = str(stdin.readline().rstrip())
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)

Fixed submission:
from sys import stdin
S = str(stdin.readline().rstrip())
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)

Buggy python submission (verdict: Runtime Error):
from sys import stdin
N = stdin.readline().rstrip()
i = 0
wa = 0
while i < len(str(N)):
    wa = wa + int(str(N)[i:i+1])
    i += 1
if N % wa == 0:
    print("Yes")
elif N % wa != 0:
    print("No")

Fixed submission:
from sys import stdin
S = str(stdin.readline().rstrip())
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)

Buggy python submission (verdict: Runtime Error):
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)

Fixed submission:
from sys import stdin
S = str(stdin.readline().rstrip())
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)

Buggy python submission (verdict: Runtime Error):
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  else:
    takahasi -= 1
  i += 1
print(takahasi)

Fixed submission:
from sys import stdin
S = str(stdin.readline().rstrip())
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)

Buggy python submission (verdict: Runtime Error):
i = 0
takahasi = 0
while i < 4:
    if S[i:i+1] == "+":
        takahasi += 1
    else:
        takahasi -= 1
    i += 1
print(takahasi)

Fixed submission:
from sys import stdin
S = str(stdin.readline().rstrip())
i = 0
takahasi = 0
while i < 4:
  if S[i:i+1] == "+":
    takahasi += 1
  elif S[i:i+1] == "-":
    takahasi -= 1
  i += 1
print(takahasi)
Buggy python submission (verdict: Runtime Error):
i = 0
wa = 0
while i < len(str(N)):
    wa = wa + int(str(N)[i:i+1])
    i += 1
if N % wa == 0:
    print("Yes")
elif N % wa != 0:
    print("No")

Fixed submission:
from sys import stdin
N = int(stdin.readline().rstrip())
i = 0
wa = 0
while i < len(str(N)):
    wa = wa + int(str(N)[i:i+1])
    i += 1
if N % wa == 0:
    print("Yes")
elif N % wa != 0:
    print("No")

Buggy python submission (verdict: Runtime Error):
i = 0
wa = 0
while i len(str(N)):
  wa = wa + int(str(N)[i:i+1])
  i += 1
if N % wa == 0:
  print("Yes")
elif N % wa != 0:
  print("No")

Fixed submission:
from sys import stdin
N = int(stdin.readline().rstrip())
i = 0
wa = 0
while i < len(str(N)):
    wa = wa + int(str(N)[i:i+1])
    i += 1
if N % wa == 0:
    print("Yes")
elif N % wa != 0:
    print("No")
Buggy python submission (verdict: Runtime Error):
import string
alphabet = [chr(i) for i in range(97, 97+26)]
s = set(input())
result = set(alphabet) - s
result = sorted(list(result))
print(result[0])

Fixed submission:
import string
alphabet = [chr(i) for i in range(97, 97+26)]
s = set(input())
result = set(alphabet) - s
result = sorted(list(result))
if len(result) == 0:
  print("None")
else:
  print(result[0])
Buggy python submission (verdict: Runtime Error):
N = int(input())

def wa(x):
    s = 0
    while x > 0:
        s += x % 10
        x = int(x / 10)
    return s
L = []
for i in range(2,N):
    A = i
    B = N - i
    x = wa(A) + wa(B)
    L.append(x)
    
L = sorted(L)
    
print(L[0])

Fixed submission:
N = int(input())

def wa(x):
    s = 0
    while x > 0:
        s += x % 10
        x = int(x / 10)
    return s
L = []
for i in range(1,N):
    A = i
    B = N - i
    x = wa(A) + wa(B)
    L.append(x)
    
L = sorted(L)
    
print(L[0])
Buggy python submission (verdict: Time Limit Exceeded):
N,M = input().split()
N = int(N)
M = int(M)

sum = 0

for i in range(N + 1):
    for j in range(N + 1):
        for k in range(N + 1):
            if i + j + k == M:
                sum += 1
            
print(sum)

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

sum = 0

for i in range(N + 1):
    for j in range(N + 1):
        if  0 <= M - i - j <= N:
            sum += 1
            
print(sum)
Buggy python submission (verdict: Runtime Error):
s = input()
print(A + "input[8]" + C)

Fixed submission:
print("A" + input()[8] + "C")
Buggy python submission (verdict: Runtime Error):
N,L = map(int,input().split())
M = []
for i in range(N):
    M.append(input())
    
M = sorted(input().split())

print(''.join(L))

Fixed submission:
N,L = map(int,input().split())
M = []
for i in range(N):
    M.append(input())

M = sorted(M)

print(''.join(M))
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
print(sum(i for in range(N + 1)
          if A <= sum(map(int, str(i))) <= B))

Fixed submission:
N, A, B = map(int, input().split())
print(sum(i for i in range(N + 1) 
         if A <= sum(map(int, str(i)))
         <= B))
Buggy python submission (verdict: Runtime Error):
n, l = map(int, input().split())
s = soated([input() for i in range(n)])
print(*s, sep = "")

Fixed submission:
n, l = map(int, input().split())
s = sorted([input() for i in range(n)])
print(*s, sep = "")
Buggy python submission (verdict: Runtime Error):
s = input()


if s='ABC'
  print('ARC')  
else if s='ARC' 
    print('ABC')  





Fixed submission:
s = input()


if s=='ABC':
  print('ARC')  
elif s=='ARC':
    print('ABC')
Buggy python submission (verdict: Runtime Error):
n,m = list(map(int,input().split() ))
h = list(map(int,input().split() ))

 # 要素n が全てTrueの配列
good = [True] * n
for im in range(m):
    a,b = list(map(int,input().split()))
    if h[a-1] > h[b-1]:
        good[b] = False
    elif h[b-1] > h[a-1]:
        good[a-1] = False
    else:
        good[a-1] = False
        good[b-1] = False

#count(x) リスト中のxの数を返す
print(good.count(True)) 


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

 # 要素n が全てTrueの配列
good = [True] * n
for im in range(m):
    a,b = list(map(int,input().split()))
    if h[a-1] > h[b-1]:
        good[b-1] = False
    elif h[b-1] > h[a-1]:
        good[a-1] = False
    else:
        good[a-1] = False
        good[b-1] = False

#count(x) リスト中のxの数を返す
print(good.count(True))

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

aPrev=0
a,b=0,0
count=0

good = [True] * n # 要素n が全てTrueの配列
for im in range(m):
    a,b = list(map(int,input().split()))
    if h[a-1] > h[b-1]:
        good[b] = False
    elif h[b-1] > h[a-1]:
        good[a-1] = False
    else:
        good[a-1] = False
        good[b-1] = False

print(good.count(True)) #count(x) リスト中のxの数を返す



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

 # 要素n が全てTrueの配列
good = [True] * n
for im in range(m):
    a,b = list(map(int,input().split()))
    if h[a-1] > h[b-1]:
        good[b-1] = False
    elif h[b-1] > h[a-1]:
        good[a-1] = False
    else:
        good[a-1] = False
        good[b-1] = False

#count(x) リスト中のxの数を返す
print(good.count(True))
Buggy python submission (verdict: Time Limit Exceeded):
import math
n = int(input() )
n+=1
sum = 0
for i in range (1,n):
    for j in range (1,n): 
        for k in range (1,n):
            sum += math.gcd(  math.gcd(i,j) ,k )
            #print(i,j,k)

print( sum )

Fixed submission:
import math
n = int(input() )
n+=1
sum = 0
for i in range (1,n):
    for j in range (1,n):
        gcdIJ = math.gcd(i,j)
        for k in range (1,n):
            sum += math.gcd( gcdIJ  ,k )
            #print(i,j,k)

print( sum )
Buggy python submission (verdict: Runtime Error):
def main():
    S =list(map(int,input().split()))
    if S[0] == S[1] and S[0] == S[2]:
        print("No")
    else :
        print("Yes")


main()
        

Fixed submission:
def main():
    S =input()

    if S[0] == S[1] and S[0] == S[2]:

        print("No")
    else :
        print("Yes")


main()

Buggy python submission (verdict: Runtime Error):
def main():
    S =list(map(int,input().split()))
    if S[0] == S[1] and S[0] == S[2]
        print("No")
    else 
        print("Yes")


main()
        

Fixed submission:
def main():
    S =input()

    if S[0] == S[1] and S[0] == S[2]:

        print("No")
    else :
        print("Yes")


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

#print(max(x),min(x))

min_hp = 1000000000000000
for p in range(min(x),max(x)+1):
    hp = 0
    for i in x:
        hp +=(i-p)**2
        # print(p,i,hp)
    if min_hp > hp:
        min_hp = hp

print(min_hp)

Fixed submission:
input= list( map(int,input().split()) )
n = input[0]
r=  input[1]

if n<10:
    print(r + (100 * (10-n)) )
else:
    print(r)

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

if n<10:
    print(r - 100 * (10-n) )
else:
    print(r)

Fixed submission:
input= list( map(int,input().split()) )
n = input[0]
r=  input[1]

if n<10:
    print(r + (100 * (10-n)) )
else:
    print(r)
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
if int(a)>int(b):
  print(b*str(a))
else:
  print(a*str(b))

Fixed submission:
a,b=input().split()
if int(a)>int(b):
  print(b*int(a))
else:
  print(a*int(b))
Buggy python submission (verdict: Runtime Error):
from math import sprt

n=int(input())
for i in range(int(sqrt(n)),2,-1):
  if n%i==0:
    print(i-1 + int(n/i)-1)
    break
else:
  print(n-1)


Fixed submission:
from math import sqrt

n=int(input())
for i in range(int(sqrt(n)),1,-1):
  if n%i==0:
    print(i-1 + n//i-1)
    break
else:
  print(n-1)

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

n=int(input())
for i in range(int(sqrt(n)),2,-1):
  if n%i==0:
    print(i-1 + n//i-1)
    break
else:
  print(n-1)

Fixed submission:
from math import sqrt

n=int(input())
for i in range(int(sqrt(n)),1,-1):
  if n%i==0:
    print(i-1 + n//i-1)
    break
else:
  print(n-1)
Buggy python submission (verdict: Runtime Error):
n=input()
d=[int(i) for i in input().split()]
while True:
  a=d[0]
  del d[0]
  if d == []:
    break
  for i in d:
    sum += a*i
print(sum)

Fixed submission:
n=input()
d=[int(i) for i in input().split()]
sum=0
while True:
  a=d[0]
  del d[0]
  if d == []:
    break
  for i in d:
    sum += a*i
print(sum)

Buggy python submission (verdict: Runtime Error):
input()
d=[int(i) for i in input().split()]
i=0
while True:
  a=d[0]
  del d[0]
  if d == []:
    break
  for i in d:
    sum += a*i
print(sum)

Fixed submission:
n=input()
d=[int(i) for i in input().split()]
sum=0
while True:
  a=d[0]
  del d[0]
  if d == []:
    break
  for i in d:
    sum += a*i
print(sum)

Buggy python submission (verdict: Runtime Error):
input()
d=[int(i) for i in input().split()]
i=0
while True:
  a=d[0]
  del d[0]
  for i in d:
    sum += a*i
print(sum)

Fixed submission:
n=input()
d=[int(i) for i in input().split()]
sum=0
while True:
  a=d[0]
  del d[0]
  if d == []:
    break
  for i in d:
    sum += a*i
print(sum)
Buggy python submission (verdict: Runtime Error):
    n=int(input())
    print((n-n//2)/n)

Fixed submission:
n=int(input())
print((n-n//2)/n)
Buggy python submission (verdict: Runtime Error):
s=input()
w=['Sunny','Cloudy','Rainy']
print(w[w.index(s)+1])

Fixed submission:
s=input()
if s == 'Sunny':
 print('Cloudy')
elif s == 'Cloudy':
 print('Rainy')
else:
 print('Sunny')
Buggy python submission (verdict: Time Limit Exceeded):
n,k,q=[int(i) for i in input().split()]
dif=q-k+1
a=list()
for i in range(q):
  a.append(int(input()))
for i in range(1,n+1):
  if a.count(i)>=dif:
    print('Yes')
  else:
    print('No')

Fixed submission:
n,k,q=[int(i) for i in input().split()]
dif=q-k+1
ans=[0]*n
for i in range(q):
  ans[int(input())-1]+=1
for i in range(n):
  if ans[i]>=dif:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
ans
ans=a-(b+c)
if ans<0:
  ans=0
print(ans)

Fixed submission:
a,b,c=map(int,input().split())
ans=b+c-a
if ans<0:
  ans=0
print(ans)
Buggy python submission (verdict: Runtime Error):
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=0
while point<=x:
  point+=llist[cnt]
  cnt+=1
  if cnt>n:
    break
print(cnt)


Fixed submission:
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=1
for i in range(n):
  point+=llist[i]
  if(point<=x):
    cnt+=1
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=0
while point<=x:
  cnt+=1
  point+=llist[cnt]
  if cnt>n:
    break
print(cnt)


Fixed submission:
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=1
for i in range(n):
  point+=llist[i]
  if(point<=x):
    cnt+=1
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=0
while point<=x and cnt<=n:
  point+=llist[cnt]
  cnt+=1
print(cnt)


Fixed submission:
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=1
for i in range(n):
  point+=llist[i]
  if(point<=x):
    cnt+=1
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=0
while point+llist[cnt]<=x and cnt<n:
  point+=llist[cnt]
  cnt+=1
print(cnt+1)

Fixed submission:
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=1
for i in range(n):
  point+=llist[i]
  if(point<=x):
    cnt+=1
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,x=map(int, input().split())
llist=list(map(int, input().split()))
sum=0
cnt=0
while sum+llist[cnt]<x and cnt<n:
  sum+=llist[cnt]
  cnt+=1
print(cnt+1)

Fixed submission:
n,x=map(int, input().split())
llist=list(map(int, input().split()))
point=0
cnt=1
for i in range(n):
  point+=llist[i]
  if(point<=x):
    cnt+=1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
s_=s
while "01" in s or "10" in s:
	s=s.replace("01","")
	s=s.replace("10","")
print(len(s_)-len(s))

Fixed submission:
s=input()
sum1=len([i for i in s if i=="1"])
sum0=len([i for i in s if i=="0"])
if sum1>sum0:
	print(sum0*2)
else:
	print(sum1*2)

Buggy python submission (verdict: Time Limit Exceeded):
ans=0
flag=1
s=input()
while ans!=flag:
	flag=ans
	ans+=len(s)-len(s.replace("01",""))
	s=s.replace("01","")
	ans+=len(s)-len(s.replace("10",""))
	s=s.replace("10","")
print(ans)

Fixed submission:
s=input()
sum1=len([i for i in s if i=="1"])
sum0=len([i for i in s if i=="0"])
if sum1>sum0:
	print(sum0*2)
else:
	print(sum1*2)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=map(int, input().split())
ls=[i for i in range(0,b+1,x) if i>=a]
print(len(ls))

Fixed submission:
a,b,x=map(int, input().split())
print(b//x-(a-1)//x)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=map(int, input().split())
ls=[num for num in range(a,b+1) if num%x==0]
print(len(ls))

Fixed submission:
a,b,x=map(int, input().split())
print(b//x-(a-1)//x)
Buggy python submission (verdict: Runtime Error):
r = int(input("long?"))

return r * r

Fixed submission:
r = int(input())

print(r*r)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N/2] == A[N/2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N//2] == A[N//2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")

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

if (N % 2 == 0):
  if (A[0:N/2-1] == A[N/2:N-1]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N//2] == A[N//2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")

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

if (N % 2 == 0):
  if (A[:N/2-1] == A[N/2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")


Fixed submission:
N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N//2] == A[N//2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")

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

if (N % 2 == 0):
  if (A[:N/2-1] == A[N/2:N-1]):
    print("Yes")
  else:
    print("No")
else:
  print("No")

Fixed submission:
N = int(input())
A = str(input())

if (N % 2 == 0):
  if (A[:N//2] == A[N//2:]):
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
    s = input()
    t = 'ABC' if s == 'ARC' else 'ARC'
    print(t)

Fixed submission:
if __name__=='__main__':
    s = input()
    t = 'ABC' if s == 'ARC' else 'ARC'
    print(t)
Buggy python submission (verdict: Runtime Error):
if __name__=='__main__':
    N = int(input())
    S = input()
    ans = 'No'
    if N % 2 == 0:
        if S[0:N/2]==S[N/2:]: ans='Yes'
    print(ans)

Fixed submission:
if __name__=='__main__':
    N = int(input())
    S = input()
    ans = 'No'
    if N % 2 == 0:
        if S[0:int(N/2)]==S[int(N/2):]: ans='Yes'
    print(ans)

Buggy python submission (verdict: Runtime Error):
if __name__=='__main__':
    N = int(input())
    S = input()
    ans = 'No'
    if N % 2 == 0 and S[0:N/2]==S[N/2:]: ans='Yes'
    print(ans)

Fixed submission:
if __name__=='__main__':
    N = int(input())
    S = input()
    ans = 'No'
    if N % 2 == 0:
        if S[0:int(N/2)]==S[int(N/2):]: ans='Yes'
    print(ans)
Buggy python submission (verdict: Runtime Error):
# coding:utf-8
if __name__=='__main__':
  r,D,x = map(int, input().split())
  for i in range(10):
    x = r*x-D
    print(x)
    

Fixed submission:
# coding:utf-8

if __name__ == '__main__':
  A,B = map(int,input().split())
  if A >= 13:
    print(B)
  elif A>=6:
    print(int(B/2))
  else:
    print(0)
Buggy python submission (verdict: Runtime Error):
# coding:utf-8

if __name__=="__main__":
  N = int(input())
  s = []
  a,b,ba=0,0,0
  count = 0
  for i in range(N):
      s.append(input())
      count += s.count('AB')
      if s[i][0]!='B' and s[i][-1]=='A': a+=1
      if s[i][0]=='B' and s[i][-1]!='A': b+=1
      if s[i][0]=='B' and s[i][-1]=='A': ba+=1
  if ba == 0:
      print(count+min(a,b))
  elif min(a,b)==0:
      print(count+ba-1)
  else:
      print(count+ba+min(a,b))

Fixed submission:
# coding:utf-8

if __name__=="__main__":
  N, K = map(int, input().split())
  print(N-K+1)

Buggy python submission (verdict: Runtime Error):
# coding:utf-8

if __name__=="__main__":
  R,G,B,N = map(int, input().split())
  count = 0
  for r in range(int(N/R)+1):
    n1 = N - r*R
    for g in range(int(n1/G)+1):
      n2 = n1 - g*G
      if n2%B==0: count+= 1
  print(count)

Fixed submission:
# coding:utf-8

if __name__=="__main__":
  N, K = map(int, input().split())
  print(N-K+1)
Buggy python submission (verdict: Runtime Error):
comp = input()
if cpm[1] == 'R' :
  print("ABC")
else :
  print("ARC")

Fixed submission:
comp = input()
try :
  if comp[1] == 'R' :
    print("ABC")
  else : print("ARC")
except: 
  pass

Buggy python submission (verdict: Runtime Error):
if S == "ABC":
	print("ARC")
else:
	print("ABC")

Fixed submission:
S = input() 
if S == "ABC":
	print("ARC")
else:
	print("ABC")

Buggy python submission (verdict: Runtime Error):
If S = "ABC":
	return "ARC"
else:
	return "ABC"

Fixed submission:
S = input() 
if S == "ABC":
	print("ARC")
else:
	print("ABC")
Buggy python submission (verdict: Runtime Error):
import math
R = float(imput())

ans = 2 * R * PI

print(ans)

Fixed submission:
import math

r = float(input())

ans = 2*r*math.pi

print(ans)