Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
p = list(map(int,input().split()))

ans = [0] * n

for i in range(n-k+1):
  for j in range(k):
    ans[i] += (1 + p[i+j]) / 2

print(max(ans))

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

ans = [0] * n

for j in range(k):
  ans[0] += (1 + p[j]) / 2
for i in range(1,n-k+1):
  ans[i] = ans[i-1] - (1 + p[i-1]) / 2 + (1 + p[i+k-1]) / 2

print(max(ans))
Buggy python submission (verdict: Runtime Error):
    s = input()
     
    w1 = [ "R", "U", "D"]
    w2 = [ "L", "U", "D"]
     
    for i in range(len(s)):
      if i % 2 == 0:
        if not s[i] in w1 :
          print("No")
          exit()
      else :
        if not s[i] in w2 :
          print("No")
          exit()
    print("Yes")

Fixed submission:
s = input()

w1 = [ "R", "U", "D"]
w2 = [ "L", "U", "D"]

for i in range(len(s)):
  if i % 2 == 0:
    if not s[i] in w1 :
      print("No")
      exit()
  else :
    if not s[i] in w2 :
      print("No")
      exit()
print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

ans = [k] * n

for i in range(q):
  for j in range(n):
    if a[i]-1 != j :
      ans[j] -= 1
  
for anss in ans:
  print("Yes" if anss > 0 else "No")

Fixed submission:
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

ans = [0] * n

for i in range(q):
  ans[a[i]-1] += 1
for anss in ans:
  print("Yes" if k - q + anss > 0 else "No")
Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
a = list(map(int,input().split()))

a.sort(reverse=True)

while m > 0 :
  m -= 1
  a[0] = a[0]//2
  a.sort(reverse=True)

print(sum(a))



Fixed submission:
import heapq

n,m = map(int,input().split())
a = list(map(lambda x : int(x) * (-1),input().split()))

heapq.heapify(a)

while m > 0 :
  m -= 1
  heapq.heappush(a, -(-heapq.heappop(a) // 2))

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

dp = [0] * n

for i in range(len(h)-1):
  cnt = 0
  for j in range(i,len(h)-1):
    if h[j] < h[j+1]:
      dp[i] = cnt
      break
    cnt += 1
    dp[i] = cnt

print(max(dp))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
cnt = 0
ans = 0
for i in reversed(range(1,len(h))):
  if h[i-1] >= h[i] :
    cnt +=1
  else:
    ans = max(ans,cnt)
    cnt = 0
  if i == 1 :
    ans = max(ans,cnt)
  
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())

ans = list(range(1,n))

print(sum(ans))

Fixed submission:
n = int(input())
print((n * (n-1)) // 2)

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

ans = 0

result = 0;
for i in range(1, n):
  result += i
print(result)



Fixed submission:
n = int(input())
print((n * (n-1)) // 2)

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

ans = 0

for i in range(1,n):
  ans += i % (i+1)
print(ans)

Fixed submission:
n = int(input())
print((n * (n-1)) // 2)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
k,s = map(int,input().split())

cnt = 0

l = itertools.product(range(0,k+1),repeat=3)

for i in l:
  if sum(i) == s:
    cnt += 1

print(cnt)

Fixed submission:
import itertools
k,s = map(int,input().split())

cnt = 0

for i in range(0,k+1):
  for j in range(0,k+1):
    z = s - i -j
    if z >= 0 and z <= k:
      cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
n,s = [input() for i in range(n)]

if n%2 == 0 and s[::(n//2-1)] == s[(n//2-1)::]:
  print('Yes')
else:
  print('No')

Fixed submission:
n = int(input())
s = input()

center=int(n/2)

if n%2==0 and s[:center] == s[center:]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = int(input()).split() #s_1 s_2を分割して取得し、sに値を入れる
 #出力：['s_1', 's_2']
A=s[0] #出力：s_1
B=s[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Fixed submission:
i = list(map(int, input().split()))
 #出力：['s_1', 's_2']
A=i[0] #出力：s_1
B=i[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
s = input().split()
A = s[0]
B = s[1]

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Fixed submission:
i = list(map(int, input().split()))
 #出力：['s_1', 's_2']
A=i[0] #出力：s_1
B=i[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
s = input().split() #s_1 s_2を分割して取得し、sに値を入れる
 #出力：['s_1', 's_2']
A=s[0] #出力：s_1
B=s[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Fixed submission:
i = list(map(int, input().split()))
 #出力：['s_1', 's_2']
A=i[0] #出力：s_1
B=i[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
 
if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Fixed submission:
i = list(map(int, input().split()))
 #出力：['s_1', 's_2']
A=i[0] #出力：s_1
B=i[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
 
if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print('-1')

Fixed submission:
i = list(map(int, input().split()))
 #出力：['s_1', 's_2']
A=i[0] #出力：s_1
B=i[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)

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

if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print(-1)

Fixed submission:
i = list(map(int, input().split()))
 #出力：['s_1', 's_2']
A=i[0] #出力：s_1
B=i[1] #出力：s_2

if A<=9 and B<=9:
  print(A*B)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

0<=A<=100
0<=B<=100
 
if A>B*2:
  print(A-B*2)
 
else:
  print(0)

Fixed submission:
A, B = [int(i) for i in input().split()]
0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)

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

0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)


Fixed submission:
A, B = [int(i) for i in input().split()]
0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()

0<=int(A)<=100
0<=int(B)<=100

if int(A)>int(B)*2:
  print(int(A)-int(B)*2)

else:
  print(0)


Fixed submission:
A, B = [int(i) for i in input().split()]
0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)

Buggy python submission (verdict: Runtime Error):
0<=int(A)<=100
0<=int(B)<=100

if int(A)>int(B)*2:
  print(int(A)-int(B)*2)

else:
  print(0)
  

Fixed submission:
A, B = [int(i) for i in input().split()]
0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)

Buggy python submission (verdict: Runtime Error):
if int(A)-int(B)*2 <=0:
  print('0')

else:
  print(str(int(A)-int(B)*2))
  


Fixed submission:
A, B = [int(i) for i in input().split()]
0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)

Buggy python submission (verdict: Runtime Error):
if A-2*B <= 0:
  print(0)

else:
  print(A-2*B)
  

Fixed submission:
A, B = [int(i) for i in input().split()]
0<=A<=100
0<=B<=100

if A>B*2:
  print(A-B*2)

else:
  print(0)
Buggy python submission (verdict: Runtime Error):
N = input()
1<= N(int) <=100

if N(int) % 2 ==0:
  print(float(1/2))

else:
  N(int) % 2 !=0:
  x = (N(int)+1)/2
  print(float(x/N(int)))

Fixed submission:
N = input()
1 <= int(N) <= 100

if int(N) % 2 == 0:
  print(float(1/2))

else:
  x = (int(N)+1)/2
  print(float(x/int(N)))

Buggy python submission (verdict: Runtime Error):
N = input()
1<= N(int) <=100

if N(int) % 2 ==0:
  print(float(1/2))

else:
  N(int) % 2 !=0:
  x = N(int) - (N(int)+1)/2
  print(float(x/N(int)))

Fixed submission:
N = input()
1 <= int(N) <= 100

if int(N) % 2 == 0:
  print(float(1/2))

else:
  x = (int(N)+1)/2
  print(float(x/int(N)))

Buggy python submission (verdict: Runtime Error):
1<= N(int) <=100

if N(int) % 2 ==0:
  print(1/2)

else:
  N(int) % 2 !=0:
  x = N(int)- (N(int)+1)/2
  print(x/N(int))

Fixed submission:
N = input()
1 <= int(N) <= 100

if int(N) % 2 == 0:
  print(float(1/2))

else:
  x = (int(N)+1)/2
  print(float(x/int(N)))

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

N = input()
1<= N(int) <=100

if N(int) % 2 ==0:
  print(1/2)

else:
  N(int) % 2 !=0:
  x = N(int)- (N(int)+1)/2
  print(x/N(int))


Fixed submission:
N = input()
1 <= int(N) <= 100

if int(N) % 2 == 0:
  print(float(1/2))

else:
  x = (int(N)+1)/2
  print(float(x/int(N)))

Buggy python submission (verdict: Runtime Error):
N = input()
1<=N(int)<=100

if N(int)%2 != 0:
  print(N(int))

Fixed submission:
N = input()
1 <= int(N) <= 100

if int(N) % 2 == 0:
  print(float(1/2))

else:
  x = (int(N)+1)/2
  print(float(x/int(N)))
Buggy python submission (verdict: Runtime Error):
S = input()

if S ='Sunny':
  print('Cloudy')

if S = ('Cloudy'):
  print('Rainy')

if S = ('Rainy'):
  print('Sunny')

Fixed submission:
S=input()

if S == 'Sunny':
  print('Cloudy')
if S == 'Cloudy':
  print('Rainy')
if S == 'Rainy':
  print('Sunny')

Buggy python submission (verdict: Runtime Error):
S =['Sunny', 'Cloudy', 'Rainy']

if S == Sunny:
  print(Cloudy)

if S == Cloudy:
  print(Rainy)

if S == Rainy:
  print(Sunny)


Fixed submission:
S=input()

if S == 'Sunny':
  print('Cloudy')
if S == 'Cloudy':
  print('Rainy')
if S == 'Rainy':
  print('Sunny')
Buggy python submission (verdict: Runtime Error):
N = input()
print(pow(N,3))

Fixed submission:
N =input()
print(int(N)**3)

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

Fixed submission:
N =input()
print(int(N)**3)

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

Fixed submission:
N =input()
print(int(N)**3)

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

Fixed submission:
N =input()
print(int(N)**3)

Buggy python submission (verdict: Runtime Error):
N = input()
print(str(N**3))

Fixed submission:
N =input()
print(int(N)**3)
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))

bonus=0
for x in range(0,n):
  if A[x] == A[x+1] +1:
    bonus += C[x]

ans = sum(B) + bonus
print(ans)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
 
bonus=0
for x in range(1,n):
  if A[x-1]+1 == A[x]:
    bonus += C[A[x]-2]
 
ans = sum(B) + bonus
print(ans)
Buggy python submission (verdict: Runtime Error):
s = [input() for i in range(2)]
#出力['s_1', 's_2']

x=s[0].split(',')
y=s[1].split(',')

ans = 0
if x[0]==y[0]:
  ans += 1
  if x[1]==y[1]:
    ans += 1
    if x[2]==y[2]:
      ans += 1
print(ans)

Fixed submission:
S=input()
T=input()

ans=0
for s,t in zip(S,T):
  if s==t:
    ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
s = [input() for i in range(2)]
#出力['s_1', 's_2']

x=s[0].split(',')
y=s[1].split(',')

if x[0]==y[0]:
  ans += 1
  if x[1]==y[1]:
    ans += 1
    if x[2]==y[2]:
      ans += 1
print(ans)

Fixed submission:
S=input()
T=input()

ans=0
for s,t in zip(S,T):
  if s==t:
    ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
S =[]
T =[]
i = random.choice(S,C,R)
S[0] ='i'
q = random.choice(S,C,R)
S[1] ='q'
g = random.choice(S,C,R)
S[2] ='g'
 
h = random.choice(S,C,R) 
T[0] ='h'
k = random.choice(S,C,R)
T[1] ='k'
m = random.choice(S,C,R)
T[2] ='m'
 
if S[0]=T[0]:
  correct += 1
  if S[1]=T[1]:
    correct += 1
    if S[2]=S[2]:
      correct += 1
 
print(correct)

Fixed submission:
S=input()
T=input()

ans=0
for s,t in zip(S,T):
  if s==t:
    ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
S =[]
T =[]
i = random.choice(S,C,R)
 S[0] ='i'
i = random.choice(S,C,R)
S[1] ='i'
i = random.choice(S,C,R)
S[2] ='i'

i = random.choice(S,C,R) 
T[0] ='i'
i = random.choice(S,C,R)
T[1] ='i'
i = random.choice(S,C,R)
T[2] ='i'
 
if S[0]=T[0]:
  correct += 1
  if S[1]=T[1]:
    correct += 1
    if S[2]=S[2]:
      correct += 1
 
print(correct)

Fixed submission:
S=input()
T=input()

ans=0
for s,t in zip(S,T):
  if s==t:
    ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
問題文
ある3日間の天気予報が、長さ 3の文字列Sとして与えられます。
Sのi(1≤i≤3)文字目が S のとき、i日目の天気予報が晴れだったことを、
C のときは曇りだったことを、
R のときは雨だったことを意味します。

また3日間の実際の天気が、長さ 3の文字列Tとして与えられます。
Tの i (1≤i≤3)文字目が S のとき、i日目の実際の天気が晴れだったことを、
C のときは曇りだったことを、
R のときは雨だったことを意味します。
3日間で天気予報が的中した日が何日あるかを出力してください。

制約
SおよびTは長さ 3の文字列である。
SおよびTは S, C, R のみからなる。

S =[]
T =[]
i = random.choice(S,C,R)

S[0] ='i'
S[1] ='i'
S[2] ='i'

T[0] ='i'
T[1] ='i'
T[2] ='i'

if S[0]=T[0]:
  correct += 1
  if S[1]=T[1]:
    correct += 1
    if S[2]=S[2]:
      correct += 1

print(correct)


Fixed submission:
S=input()
T=input()

ans=0
for s,t in zip(S,T):
  if s==t:
    ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())

outlet = A

if A == B:
    print(1)
    
else:
    count = 1
    while outlet <= B:
        count += 1
        outlet += A-1
        ans = count
        break
    print(ans)

Fixed submission:
A,B = map(int, input().split())

if A == B:
    anss=1
    print(anss)
    
else:
    count = 0
    outlet = A
    while outlet < B + A -1 :
        count += 1
        outlet += A-1
    print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())

ans = 0
for i range(1, n+1):
  if len(str(i))%2 == 1:
    ans += 1
print(ans)
    


Fixed submission:
n = int(input())

if 1<= n < 10:
    print(n)
elif 10<= n < 100:
    print(9)
elif 100<= n <1000:
    print(9+n-99)
elif 1000<= n < 10000:
    print(909)
elif 10000<= n <100000:
    print(909+n-9999)
else:
    print(90909)
Buggy python submission (verdict: Runtime Error):
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A%2==0) AND (B%2==0):
  print((A+B)/2)
elif (A%2 !=0) AND (B%2 !=0):
  print((A+B)/2)
else:
  print('IMPOSSIBLE')

Fixed submission:
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A+B)%2 == 0:
  print((A+B)//2)
else:
  print('IMPOSSIBLE')

Buggy python submission (verdict: Runtime Error):
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if A%2==0 AND B%2==0:
  print((A+B)/2)
elif A%2 !=0 AND B%2 !=0:
  print((A+B)/2)
else:
  print('IMPOSSIBLE')

Fixed submission:
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A+B)%2 == 0:
  print((A+B)//2)
else:
  print('IMPOSSIBLE')

Buggy python submission (verdict: Runtime Error):
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A%2==0 AND B%2==0) OR (A%2 !=0 AND A%2 !=0):
  print((A+B)/2)
else:
  print('IMPOSSIBLE')

Fixed submission:
A,B = [int(i) for i in input().split(' ')]

0<=A
B<=10**9

if (A+B)%2 == 0:
  print((A+B)//2)
else:
  print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
n = input()
p = list(map(int, input().split()))

dif = []
for i in range(1,n+1):
  if p[i-1] != i:
    dif.append(i)

if len(dif) == 0 or len(dif) == 2:
  print('YES')
else:
  print('NO')
    

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

dif = []
for i in range(1,n+1):
  if p[i-1] != i:
    dif.append(i)

if len(dif) == 0 or len(dif) == 2:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
n = input()
p = [int(input()) for i in range(3)]

dif = []
for i in range(1,n+1):
  if p[i-1] != i:
    dif.append(1)

if len(dif) == 0 or len(dif) == 2:
  print('YES')
else:
  print('NO')
    

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

dif = []
for i in range(1,n+1):
  if p[i-1] != i:
    dif.append(i)

if len(dif) == 0 or len(dif) == 2:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
n = input()
p = [int(input()) for i in range(3)]

dif = []
for i in range(n):
  if p[i]!= i:
    dif.append(1)

if len(dif) == 0 or len(dif) == 2:
  print('YES')
else:
  print('NO')
    

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

dif = []
for i in range(1,n+1):
  if p[i-1] != i:
    dif.append(i)

if len(dif) == 0 or len(dif) == 2:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
N,D = map(int, input().split())

num = 0
for i in range(1,N):
    if (D*2+1)<=N:
        i += 1
        break
num=i
print(num)

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

if n%(2*d+1)!=0:
  print(n//(2*d+1)+1)
else:
  print(n//(2*d+1))
Buggy python submission (verdict: Runtime Error):
S = str(input())

if S[0] == S[1] or S[1]==S[2] or S[2]==S[3] or S[3]==S[4]:
  print('Bad')
else:
  print('Good')

Fixed submission:
S = str(input())

if S[0] == S[1] or S[1]==S[2] or S[2]==S[3]:
  print('Bad')
else:
  print('Good')
Buggy python submission (verdict: Runtime Error):
x, a = [int(i) for i in input().split(' ')]

if X<A:
  print(0)
else:
  print(10)

Fixed submission:
x,a = [int(i) for i in input().split(' ')]

if x<a:
  print(0)
else:
  print(10)
Buggy python submission (verdict: Runtime Error):
p,q,r = [int(x) for x in input().split()]
p,q,r.sort()
answer = p,q,r[0] + p,q,r[1]
print(answer)

Fixed submission:
p,q,r = [int(i) for i in input().split(' ')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))

Buggy python submission (verdict: Runtime Error):
p,q,r = [int(i) for i in input().split(' ')]

l = list(p,q,r)
l.sort()

ans=l[0]+l[1]

print(ans)

Fixed submission:
p,q,r = [int(i) for i in input().split(' ')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))

Buggy python submission (verdict: Runtime Error):
p,q,r = [int(i) for i in input().split(' ')]

l = list(p,q,r)
l.sort()

ans=l[0]+l[1]

print(ans)

Fixed submission:
p,q,r = [int(i) for i in input().split(' ')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))

Buggy python submission (verdict: Runtime Error):
pqr = [int(i) for i in input().split('')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))

Fixed submission:
p,q,r = [int(i) for i in input().split(' ')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))

Buggy python submission (verdict: Runtime Error):
p,q,r = [int(i) for i in input().split(' ')]

x= p+q
y= q+r
z= r+z

print(min([x,y,z]))

Fixed submission:
p,q,r = [int(i) for i in input().split(' ')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))

Buggy python submission (verdict: Runtime Error):
p,q,r = [int(i) for i in input().split(' ')]

x= p+q
y= q+r
z= r+z

print(min([x,x,z]))

Fixed submission:
p,q,r = [int(i) for i in input().split(' ')]

x = p+q
y = q+r
z = r+p

print(min([x,y,z]))
Buggy python submission (verdict: Runtime Error):
a,b = [int(x) for x in input().split()]

answer = B
if 6 <= A <= 12:
  answer = B//2
elif A <= 5:
  answer = 0
  
print(answer)

Fixed submission:
A,B = map(int,input().split())
 
answer = B
if 6 <= A <= 12:
  answer = B//2
elif A <= 5:
  answer = 0
  
print(answer)
Buggy python submission (verdict: Runtime Error):
n,k = [int(x) for x in input().split()]
s = input()

print(s[:k-1] + s[k-1].lower + s[K:])

Fixed submission:
n,k = [int(x) for x in input().split()]
s = input()

print(s[:k-1] + s[k-1].lower() + s[k:])

Buggy python submission (verdict: Runtime Error):
n,k = [int(x) for x in input().split()]
s = input()

s[k].lower()

print(s)

Fixed submission:
n,k = [int(x) for x in input().split()]
s = input()

print(s[:k-1] + s[k-1].lower() + s[k:])
Buggy python submission (verdict: Runtime Error):
N = int(input())
s = [int(input()) for i in range(2)]
  
if N==1:
  print('Hello World')

elif N==2:
  print(s[0]+s[1])

Fixed submission:
n = int(input())
 
if n == 1:
	print("Hello World")
else:
	a = int(input())
	b = int(input())
	print(a+b)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A,B = [int(input()) for i in range(2)]
  
if N==1:
  print('Hello World')

elif N==2:
  print(A+B)

Fixed submission:
n = int(input())
 
if n == 1:
	print("Hello World")
else:
	a = int(input())
	b = int(input())
	print(a+b)
Buggy python submission (verdict: Runtime Error):
i = [int(input()) for i in range(4)]

if i[0]<i[1]:
  train = i[0]
elif i[1]<i[0]:
  train = i[1]
  
if i[2]<i[3]:
  bus= i[2]
elif i[3]<i[2]:
  bus= i[3]

print(train+bus)

Fixed submission:
i = [int(input()) for i in range(4)]

if i[0]<i[1]:
  train = i[0]
elif i[1]<=i[0]:
  train = i[1]
  
if i[2]<i[3]:
  bus= i[2]
elif i[3]<=i[2]:
  bus= i[3]

print(train+bus)
Buggy python submission (verdict: Runtime Error):
a,b,c = input().split()
d,e,f = input().split()
g,h,i = input().split()

print(a+e+i)

Fixed submission:
s = [input() for i in range(3)]

print(s[0][0]+s[1][1]+s[2][2])
Buggy python submission (verdict: Runtime Error):
n,a = [input() for i in range(2)]

x=n%500 

if x<=a:
  print('Yes')
else:
  print('No')

Fixed submission:
n,a = [int(input()) for i in range(2)]

x=n%500 

if x<=a:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
n,a = [input() for i in range(2)]

x=N%500 

if x<=a:
  print('Yes')
else:
  print('No')

Fixed submission:
n,a = [int(input()) for i in range(2)]

x=n%500 

if x<=a:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
x,y = input().split()
if x>y:
  print('>')
elif x=y:
  print('=')
else:
  print('<')

Fixed submission:
x,y = input().split()
if x>y:
  print('>')
elif x==y:
  print('=')
else:
  print('<')
Buggy python submission (verdict: Runtime Error):
n,a = [input() for i in range(2)]
print(n**2-a)

Fixed submission:
n,a = [int(input()) for i in range(2)]
print(n**2-a)

Buggy python submission (verdict: Runtime Error):
n,a = [input() for i in range(3)]
print(n**2-a)

Fixed submission:
n,a = [int(input()) for i in range(2)]
print(n**2-a)
Buggy python submission (verdict: Runtime Error):
a,b,c = int(input()).split()

if a<= c <=b:
  print('Yes')
else:
  print('No')

Fixed submission:
a,b,c = map(int, input().split())

if a<= c <=b:
  print('Yes')
else:
  print('No')

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

if a<= b <=c:
  print('Yes')
else:
  print('No')

Fixed submission:
a,b,c = map(int, input().split())

if a<= c <=b:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

answer = [i for i in range(1, N+1) if N % i ==0]
answer_r = sorted(answer, reverse=True)

s = [[A,B] for A, B in zip(answer, answer_r)]

for i in range(len(s)):
    if i == len(s)//2:
        ans = s[i]
        break

if len(str(ans[0])) > len(str(ans[1])):
    a = ans[0]
else:
    a = ans[1]

print(len(str(a)))

Fixed submission:
import math
N = int(input())
q = int(math.sqrt(N))
a = 0
for i in range(1,q+1) :
    if N%i == 0 :
        a = i
        b = int(N/a)
print(len(str(b)))
Buggy python submission (verdict: Time Limit Exceeded):
import math
N = int(input())
A = 10
for n in range(1, N+1):
    num = 0
    for i in range(1, A):
        for j in range(1, A):
            for k in range(1, A):
                if math.pow(i + j + k, 2) == (i * j + j * k + k * i) + n:
                    num += 1
    print(num)


Fixed submission:
# coding:utf-8
n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 105):
    for j in range(1, 105):
        for k in range(1, 105):
            v = i*i+j*j+k*k+i*j+j*k+k*i
            if v < 10050:  #vはnを表していて、vのところで与式を満たす
                ans[v] += 1
for i in range(n):
    print(ans[i+1])