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

def radius(r):
  return r * r 

print s


Fixed submission:
s = input ()

def radius(r):
  to_number = int(r)
  return to_number ** 2

print (radius(s))

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

function radius (r) {
  return r ** 2
  
console.log(radius(s))

Fixed submission:
s = input ()

def radius(r):
  to_number = int(r)
  return to_number ** 2

print (radius(s))

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

def radius:
  return int(s) ** 2

print (s)

Fixed submission:
s = input ()

def radius(r):
  to_number = int(r)
  return to_number ** 2

print (radius(s))

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

def radius:
  return s ** 2

print (s)

Fixed submission:
s = input ()

def radius(r):
  to_number = int(r)
  return to_number ** 2

print (radius(s))
Buggy python submission (verdict: Runtime Error):
s = input()
l = s.split(' ')
m = list (map(int, l))
p, q, r = m

def shortest_round(p, q, r):
  list_of_times = [p + q, p + r, q + r]
  return min(list_of_times)

print(shortest_round(s))

Fixed submission:
s = input()
l = s.split(' ')
m = list(map(int, l))
p, q, r = m
list_of_times = [p + q, p + r, q + r]
f = min(list_of_times)
print(f)
Buggy python submission (verdict: Runtime Error):
from itertools import combinations
L, R = map(int, input().split())
ans = 2018
for i, j in combinations(range(L, R + 1), 2):
    a = i % 2019
    b = j % 2019
    mod = (a * b) % 2019
    if ans > mod:
        ans = mod
print(ans)


Fixed submission:
from itertools import combinations
L, R = map(int, input().split())
if (L % 2019 > R % 2019) or R - L >=2019:
    print(0)
else:
    ans = 2018
    for i, j in combinations(range(L, R + 1), 2):
        a = i % 2019
        b = j % 2019
        mod = (a * b) % 2019
        if ans > mod:
            ans = mod
    print(ans)
Buggy python submission (verdict: Runtime Error):
import math
A, B, C, D = map(int, input().split())
G = C * D // math.gcd(C, D)
ag = (A - 1) // G
ac = (A - 1) // C
ad = (A - 1) // D
bg = B // G
bc = B // C
bd = B // D
print((B - A + 1) - ((bc + bd - bg) - (ac + ad - ag)))


Fixed submission:
import fractions
A, B, C, D = map(int, input().split())
G = C * D // fractions.gcd(C, D)
ag = (A - 1) // G
ac = (A - 1) // C
ad = (A - 1) // D
bg = B // G
bc = B // C
bd = B // D
print((B - A + 1) - ((bc + bd - bg) - (ac + ad - ag)))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
v = list(map(int, input().split()))
odd = [0 for _ in range(n // 2)]
odd_num = [0 for _ in range(n // 2)]
even = [0 for _ in range(n // 2)]
even_num = [0 for _ in range(n // 2)]
for i in range(n):
    if i % 2 == 0:
        if v[i] in odd:
            odd_num[odd.index(v[i])] += 1
        else:
            odd_num[i // 2] = 1 
        odd[i // 2] = v[i]
    else:
        if v[i] in even:
            even_num[even.index(v[i])] += 1
        else:
            even_num[i // 2] = 1 
        even[i // 2] = v[i]

odd_sort = sorted(odd_num, reverse = True)
o = odd[odd_num.index(odd_sort[0])]
even_sort = sorted(even_num, reverse = True)
e = even[even_num.index(even_sort[0])]
if o != e:
    ans = n - odd_sort[0] - even_sort[0]
else:
    if odd_sort[1] < even_sort[1]:
        ans = n - odd_sort[0] - even_sort[1]
    else:
        ans = n - odd_sort[1] - even_sort[0]

print(ans)


Fixed submission:
import collections
n = int(input())
v = list(map(int, input().split()))
o = [v[i] for i in range(n) if i % 2 == 0]
e = [v[i] for i in range(n) if i % 2 == 1]
odd = collections.Counter(o)
even = collections.Counter(e)
odd_num = odd.most_common(2)
even_num = even.most_common(2)
odd_num.append(('', 0))
even_num.append(('', 0))
if odd_num[0][0] == even_num[0][0]:
    print(n - max(odd_num[0][1] + even_num[1][1], odd_num[1][1] + even_num[0][1]))
else:
    print(n - odd_num[0][1] - even_num[0][1])
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = str(input())
ans = N
for i in range(N):
    ans = min(S[:i].count('W') + S[i + 1:].count('E'), ans)
print(ans)


Fixed submission:
N = int(input())
S = str(input())
x = S[1:].count('E')
ans = x
for i in range(1, N):
    if S[i] == 'E':
        x -= 1
    if S[i - 1] == 'W':
        x += 1
    ans = min(ans, x)
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
for i in range(N):
    if i * i > N:
        ans = (i - 1) ** 2
        break
print(ans)


Fixed submission:
N = int(input())
ans = 1
for i in range(N):
    if i * i > N:
        ans = (i - 1) ** 2
        break
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = [0 for _ in range(N)]
for i in range(N):
    a[i] = int(input())
c = 0
x = 1
dic = [1]
while 1:
    x = a[x - 1]
    if x == 2:
        c += 1
        break
    elif x in dic:
        c = -1
        break
    else:
        dic.append(x)
        c += 1
print(c)


Fixed submission:
N = int(input())
a = [0 for _ in range(N)]
for i in range(N):
    a[i] = int(input())
c = 0
x = 1
while(x != 2):
    nex = a[x - 1]
    if not nex:
        c = -1
        break
    else:
        a[x - 1] = False
        c += 1
        x = nex
print(c)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 1
for i in range(N):
    ans *= (i + 1)
print(ans % (10 ** 9 + 7))


Fixed submission:
N = int(input())
ans = 1
for i in range(1, N + 1):
    ans = (i * ans) % (10 ** 9 + 7)
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()

if s = 'Sunny':
  print('Cloudy')
elif s = 'Cloudy':
  print('Rainy')
else:
  print('Sunny')

Fixed submission:
s = input()
 
if s == 'Sunny':
  print('Cloudy')
elif s == 'Cloudy':
  print('Rainy')
else:
  print('Sunny')
Buggy python submission (verdict: Runtime Error):
n = int(input())
print(n＊＊3)

Fixed submission:
n = int(input())
print(n**3)
Buggy python submission (verdict: Runtime Error):
fib=[0,0,1,2]
for i in range(4,100005):
  fib.append(fib[i-1]+fib[i-2])

n,m=map(int,input().split())
a=[input() for i in range(m)]

a.insert(0,0)
a.append(n)
ans=1
for i in range(m+1):
  ans*=fib[a[i+1]-a[i]]
print(ans)

Fixed submission:
fib=[0,0,1,2]
for i in range(4,100005):
  fib.append(fib[i-1]+fib[i-2])

n,m=map(int,input().split())
a=[int(input()) for i in range(m)]

a=set(a)

p,q=0,1

for i in range(1,n+1):
  p,q=q,(p+q)%(10**9+7)*(not i in a)

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

def dfs(s):
  if n<int(s) : return 0
  res = if all(s.count(c)>0 for c in "753") : 1 else 0
  for i in "753":
    res += dfs(s+i)
  return res

print(dfs("0"))


Fixed submission:
n=int(input())

def dfs(s):
  if n<int(s) : return 0
  res = 1 if all(s.count(c)>0 for c in "753") else 0
  for i in "753":
    res += dfs(s+i)
  return res

print(dfs("0"))

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

def dfs(s):
  if n<int(s) : return 0
  res = if all(s.count(c) for c in "753") : 1 else 0
  for i in "753":
    res += dfs(s+i)
  return res

print(dfs("0"))

Fixed submission:
n=int(input())

def dfs(s):
  if n<int(s) : return 0
  res = 1 if all(s.count(c)>0 for c in "753") else 0
  for i in "753":
    res += dfs(s+i)
  return res

print(dfs("0"))
Buggy python submission (verdict: Runtime Error):
n=int(input())
c=[0]*n;s=[0]*n;f=[0]*n
for i in range(n):
  c[i],s[i],f[i]=map(int,input().split())
  
for i in range(n):
  ans=0
  for j in range(i,n):
    ans+=c[i]+(s[i]+f[i]-ans)%f[i]
  print(ans)
    

Fixed submission:
n=int(input())
c=[0]*(n-1);s=[0]*(n-1);f=[0]*(n-1)
for i in range(n-1):
  c[i],s[i],f[i]=map(int,input().split())
  
for i in range(n):
  ans=0
  for j in range(i,n-1):
    if ans <= s[j] :
      ans = s[j] + c[j]
    elif ans%f[j] == 0:
      ans += c[j]
    else:
      ans += c[j] + (f[j]-ans)%f[j]
  print(ans)
Buggy python submission (verdict: Runtime Error):
num=input()
if num%100==num:
    print("YES")
else:
    print("NO")

Fixed submission:
num=input()

if num[0]==num[2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s=input()
num=len(s)-2
print(s[0]+num+s[num+1])

Fixed submission:
s=input()
num=len(s)-2
print(s[0], num, s[num+1], sep="")
Buggy python submission (verdict: Runtime Error):
import numpy as np
N = int(input())
pos = []
for i in range(N):
    pos.append(list(map(int, input().strip().split())))
pos = np.array(pos)
tmp_index = np.arange(N)
xx, yy = np.meshgrid(tmp_index, tmp_index)
distances = np.linalg.norm(pos[xx]-pos[yy], axis=2)

print(distances.mean()*N)

Fixed submission:
r = int(input().strip())
print(r**2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
str = input()
if n%2 == 1:
    print('No')
else:
    if str[:n//2] == str[n//2:]
	    print('Yes')
    else
	    print('No')

Fixed submission:
n = int(input())
str = input()
if n%2 == 1:
    print('No')
else:
    if str[:n//2] == str[n//2:]:
	    print('Yes')
    else:
	    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
str = input()
s = -(-n//2)
if str[:s] == str[s:]
    print('Yes')
else
    print('No')

Fixed submission:
n = int(input())
str = input()
if n%2 == 1:
    print('No')
else:
    if str[:n//2] == str[n//2:]:
	    print('Yes')
    else:
	    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
str = input()
int s = n/2
if str[:s] == str[s:]
	print('Yes')
else
	print('No')

Fixed submission:
n = int(input())
str = input()
if n%2 == 1:
    print('No')
else:
    if str[:n//2] == str[n//2:]:
	    print('Yes')
    else:
	    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = sorted(list(map(int, input().split())))

for i in range(N-1):
    A[i+1] = (A[i] + A[i+1])/2

 print(A[N-1])

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

for i in range(n - 1):
    v[i + 1] = (v[i] + v[i + 1]) / 2

print(v[n - 1])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = sorted(list(map(int, input().split())))

for i in range(N-1):
	A[i+1] = (A[i] + A[i+1])/2

 print(A[N-1])

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

for i in range(n - 1):
    v[i + 1] = (v[i] + v[i + 1]) / 2

print(v[n - 1])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = sorted(list(map(int, input().split())))

for i in range N-1:
	A[i+1] = (A[i] + A[i+1])/2

 print(A[N-1])

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

for i in range(n - 1):
    v[i + 1] = (v[i] + v[i + 1]) / 2

print(v[n - 1])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = sorted(list(map(int, input().split())))

for i in range N-1
	A[i+1] = A[i] + A[i+1]

 print(A[N-1])

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

for i in range(n - 1):
    v[i + 1] = (v[i] + v[i + 1]) / 2

print(v[n - 1])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = list(map(int,input().split()))
li = [ i-1 for i in li ]

for num in range(n):
  print(li.index(num)+1, end = ' ' )
    

Fixed submission:
n = int(input())
li = list(map(int,input().split()))
dct = { i:li[i] for i in range(n)}

for k, v in sorted(dct.items(), key=lambda x: x[1]):
    print(k+1, end = ' ' )
Buggy python submission (verdict: Runtime Error):
NL=input().split()
N=int(NL[0])
L=int(NL[1])

S=[]
rank=[]
for i in range(N):
    S.append(input())
    rank.append(0)
temp=[]
for i in range(N):
    for j in range(N):
        if(S[i]<S[j]):
           temp.append(int(1))
        else:
            temp.append(int(0))        

for i in range(N*N):
    a=i%N
    rank[a]+=temp[i]
j=0
moji=""
for i in range(N):
    for j in range(N):
        if(i==rank[j]):
            moji=moji+S[j]
print(moji)

Fixed submission:
N=input()
N=N.split()
sum=0
flag1=0
flag2=0
for i in N:
    if(i=="5"):
        flag1=1
    if(i=="7"):
        flag2=1
    sum=sum+int(i)
if(sum == 17 and flag1 == 1 and flag2 == 1):
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
NL=input().split()
N=int(NL[0])
L=int(NL[1])

S=[]
rank=[]
for i in range(N):
    S.append(input())
    rank.append(0)
temp=[]
for i in range(N):
    for j in range(N):
        if(S[i]<S[j]):
           temp.append(int(1))
        else:
            temp.append(int(0))        

for i in range(N*N):
    a=i%N
    rank[a]+=temp[i]
j=0
moji=""
for i in range(N):
    for j in range(N):
        if(i==rank[j]):
            moji=moji+S[j]
print(moji)
        


Fixed submission:
N=input()
N=N.split()
sum=0
flag1=0
flag2=0
for i in N:
    if(i=="5"):
        flag1=1
    if(i=="7"):
        flag2=1
    sum=sum+int(i)
if(sum == 17 and flag1 == 1 and flag2 == 1):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
import math
N= int(input())
x=[0]*N
y=[0]*N
for i in range(N):
  X[i]=int(input())
  y[i]=int(input())
S = 0
nb =0
for i in range(N) :
  for j in range(0, i) :
    S += math.sqrt( (x[i]-x[j])**2 + (y[i]-y[j])**2 )
    nb += 1
print(S/nb*(nb-1))

Fixed submission:
import math
N= int(input())
x=[0]*N
y=[0]*N
for i in range(N):
  x[i], y[i]=map(int, (input()).split() )
S = 0
nb =0
for i in range(N) :
  for j in range(0, i) :
    S += math.sqrt( (x[i]-x[j])**2 + (y[i]-y[j])**2 )
    nb += 1
print(S/nb*(N-1))

Buggy python submission (verdict: Runtime Error):
import math
N= int(input())
x=[0]*N
y=[0]*N
for i in range(N):
  X[i]=int(input())
  y[i]=int(input())
S = 0
nb =0
for i in range(N) :
  for j in range(0, i) :
    S += math.sqrt( (x[i]-x[j])**2 + (y[i]-y[j])**2 )
    nb += 1
print(S/nb)

Fixed submission:
import math
N= int(input())
x=[0]*N
y=[0]*N
for i in range(N):
  x[i], y[i]=map(int, (input()).split() )
S = 0
nb =0
for i in range(N) :
  for j in range(0, i) :
    S += math.sqrt( (x[i]-x[j])**2 + (y[i]-y[j])**2 )
    nb += 1
print(S/nb*(N-1))
Buggy python submission (verdict: Runtime Error):
from math import atan, pi
a,b,x = [int(i) for i in input().split()]




ocupado = x/(a*a)

if ocupado*2 >= b:
    sobra = b - ocupado

    #alfa = atan(sobra/ocupado)
    alfa = atan(a / (2*(b-ocupado)))
else:
    alfa = atan((2*a*ocupado) / (b*b))
print("%.10f" %(90 - alfa*180/pi))

Fixed submission:
from math import atan, pi
a,b,x = [int(i) for i in input().split()]




ocupado = x/(a*a)



if ocupado == b:
    alfa = pi/2

elif ocupado*2 >= b:
    sobra = b - ocupado

    #alfa = atan(sobra/ocupado)
    alfa = atan(a / (2*(b-ocupado)))
else:
    alfa = atan((2*a*ocupado) / (b*b))
print("%.10f" %(90 - alfa*180/pi))
Buggy python submission (verdict: Runtime Error):

A = int(input())
B = int(input())

x = ((B-1) // (A-1))+1
print(x)


Fixed submission:

s = input()
t = input()

list(s)
list(t)

if s[0] == t[0] and s[1] == t[1] and s[2] == t[2]:
    print(3)

elif s[0] == t[0] and s[1] == t[1] and s[2] != t[2]:
    print(2)

elif s[0] == t[0] and s[1] != t[1] and s[2] == t[2]:
    print(2)

elif s[0] != t[0] and s[1] == t[1] and s[2] == t[2]:
    print(2)

elif s[0] == t[0] and s[1] != t[1] and s[2] != t[2]:
    print(1)

elif s[0] != t[0] and s[1] != t[1] and s[2] == t[2]:
    print(1)

elif s[0] != t[0] and s[1] == t[1] and s[2] != t[2]:
    print(1)

else:
    print(0)

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

A = int(input())
B = int(input())

x = ((B-1) / (A-1))+1
print(math.ceil(x))


Fixed submission:

s = input()
t = input()

list(s)
list(t)

if s[0] == t[0] and s[1] == t[1] and s[2] == t[2]:
    print(3)

elif s[0] == t[0] and s[1] == t[1] and s[2] != t[2]:
    print(2)

elif s[0] == t[0] and s[1] != t[1] and s[2] == t[2]:
    print(2)

elif s[0] != t[0] and s[1] == t[1] and s[2] == t[2]:
    print(2)

elif s[0] == t[0] and s[1] != t[1] and s[2] != t[2]:
    print(1)

elif s[0] != t[0] and s[1] != t[1] and s[2] == t[2]:
    print(1)

elif s[0] != t[0] and s[1] == t[1] and s[2] != t[2]:
    print(1)

else:
    print(0)

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

a = int(input())
b = int(input())

x = (b-1) / (a-1)

print(math.ceil(x))



Fixed submission:

s = input()
t = input()

list(s)
list(t)

if s[0] == t[0] and s[1] == t[1] and s[2] == t[2]:
    print(3)

elif s[0] == t[0] and s[1] == t[1] and s[2] != t[2]:
    print(2)

elif s[0] == t[0] and s[1] != t[1] and s[2] == t[2]:
    print(2)

elif s[0] != t[0] and s[1] == t[1] and s[2] == t[2]:
    print(2)

elif s[0] == t[0] and s[1] != t[1] and s[2] != t[2]:
    print(1)

elif s[0] != t[0] and s[1] != t[1] and s[2] == t[2]:
    print(1)

elif s[0] != t[0] and s[1] == t[1] and s[2] != t[2]:
    print(1)

else:
    print(0)
Buggy python submission (verdict: Runtime Error):
import math
 
a = int(input())
b = int(input())
print(math.ceil((b-1) / (a-1)))
 

Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

A = int(input())
B = int(input())

x = ((B-1) // (A-1))+1
print(math.ceil(x))


Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

A = int(input())
B = int(input())

x = ((B-1) / (A-1))+0
print(math.ceil(x))


Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

A = int(input())
B = int(input())
if a >= 2 and B>= 1:
    x = (B-1) / (A-1)

    print(math.ceil(x))


Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

A = int(input())
B = int(input())
if a >= 2 and B>= 1
    x = (B-1) / (A-1)

    print(math.ceil(x))

Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

A = int(input())
B = int(input())

x = (B-1) / (A-1)

print(math.ceil(x))


Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

a = int(input())
b = int(input())

x = (b)/(a-1)

print(math.ceil(x))

Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

a = int(input())
b = int(input())

x = (b-1) / (a-1)

print(math.ceil(x))



Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

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

a = int(input())
b = int(input())

x = (b-1) / (a-1)

print(math.ceil(x))



Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

x = b//(a-1)

print(x)


Fixed submission:
import math
A, B = list(map(int, input().split()))
print(math.ceil((B-1)/(A-1)))
Buggy python submission (verdict: Runtime Error):
s = sorted(input())
    if s[0] == s[1] and s[2] == s[3] and s[0] != s[3]:
        print("yes")
    else:
        print("no")


Fixed submission:
s = sorted(input())

if len(s) == 4:
    if s[0] == s[1] and s[2] == s[3] and s[0] != s[3]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s = sorted(list(input()))
if len(s) == 4 
    if s[0] == s[1]:
        if s[2] == s[3] and s[1] != s[2]:
            print("yes")
        else:
            print("no")

    else:
        print("no")
else:
    print("no")

Fixed submission:
s = sorted(input())

if len(s) == 4:
    if s[0] == s[1] and s[2] == s[3] and s[0] != s[3]:
        print("Yes")
    else:
        print("No")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
print(int(input)**2)

Fixed submission:
print(int(input())**2)
Buggy python submission (verdict: Runtime Error):
ln=input()
s=input()
if len(s)%2:
	print("No")
elif s[:((len(s)/2)]==s[(len(s)/2):]:
    print("Yes")
else:
    print("No")

Fixed submission:
ln=input()
s=input()
if len(s)%2:
    print("No")
elif s[:(len(s)//2)]==s[(len(s)//2):]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s=input()
if len(s)%2:
	print("No")
elif s[:((len(s)/2)]==s[(len(s)/2):]:
    print("Yes")
else:
    print("No")

Fixed submission:
ln=input()
s=input()
if len(s)%2:
    print("No")
elif s[:(len(s)//2)]==s[(len(s)//2):]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s=input()
if len(s)%2:
  print("No")
elif s[:len(s)/2]==s[len(s)/2:]:
  print("Yes")
 else:
  print("No")

Fixed submission:
ln=input()
s=input()
if len(s)%2:
    print("No")
elif s[:(len(s)//2)]==s[(len(s)//2):]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
def f(a):
  if a%2 == 0:
    return a//2
  else:
    return 3*a+1

s = int(input())
a = [s]
i=2
 
while(True):
  a.append(f(a[i-2]))
  if a[i-1] in a[:i-1]:
    print(i)
    break
  i=i+1


Fixed submission:
a, b, _ = input().split()

print(int(a) * int(b) // 2)
Buggy python submission (verdict: Runtime Error):
def a():
 n, m = [int(i) for i in input().split()]
 for x in range(1,n+):
  for y in range(1, n-x+1):
    z = n-x-y
    
    if 1000*x + 5000*y + 10000*z == m:
      print('%d %d %d'%(x,y,z))
      return
 print('-1 -1 -1')
    

a()
#  1000x + 5000y + 10000z = m
#  x + y + z = n

Fixed submission:
def a():
 n, m = [int(i) for i in input().split()]
 for x in range(n+1):
  for y in range(n-x+1):
    z = n-x-y
    
    if 1000*x + 5000*y + 10000*z == m:
      print('%d %d %d'%(z,y,x))
      return
 print('-1 -1 -1')
    
a()
Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()

if a[0]==b[-1] anb b[0] == c[-1]:
  print('YES')
else:
  print('NO')


Fixed submission:
a,b,c=input().split()
 
if a[-1]==b[0] and b[-1] == c[0]:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()

if a[0]==b[-1] anb [0] == c[-1]:
  print('YES')
else:
  print('NO')


Fixed submission:
a,b,c=input().split()
 
if a[-1]==b[0] and b[-1] == c[0]:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# スペース区切りの整数の入力
b = a*2
# 文字列の入力
s = input()
# 出力
print("{}".format(a/b, s))

Fixed submission:
print(int(input())**2)