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

Fixed submission:
a = int(input())
a = a*a
print(a)
Buggy python submission (verdict: Runtime Error):
if (500 * K) > X:
  print("Yes")]
else:
  print("No")

Fixed submission:
K,X=map(int,input().split())
if 500*K >= X:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
import os
N= int(input())
S=input().strip()
T=input().strip()
ans=[]
for i in range(N):
    ans.append(S[i])
    ans.append(T[i])

print(''.join(ans))

Fixed submission:
import os
N= int(input())
nyu = input().split()
S=nyu[0].strip()
T=nyu[1].strip()
ans=[]

for i in range(N):
    ans.append(S[i])
    ans.append(T[i])
print(''.join(ans))
Buggy python submission (verdict: Runtime Error):
def B():
    n = int(raw_input())
    s = list(raw_input())
    c = 0
    for i in range(0,len(s)-2):
        if str(s[i]) == "A":
            if str(s[i+1]) == "B":
                if str(s[i+2]) == "C":
                    c = c + 1
    print c


if __name__ == '__main__':
    B()

Fixed submission:
#coding: utf-8

def A():
    k, x = map(int, raw_input().split())
    a = 500 * k
    if a >= x:
        print "Yes"
    else:
        print "No"

if __name__ == '__main__':
    A()

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
print(s.count("ABC"))

Fixed submission:
a, b = input().split()
a = int(a)
b = int(b)
if a*500 >= b:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = input().split()
a = [int(i) for i in a]
b = input().split()
b = [int(i) for i in b]
result= 0
for i in range (n):
  result += b[i]
c = input().split()
c = [int(i) for i in c]
for i in range (n):
  if a[i] - a[i-1] == 1:
    result += c[i-2]
  else:
    break
print(result)

Fixed submission:
n = int(input())
print(n*n*n)
Buggy python submission (verdict: Runtime Error):
N = int(input())
List = input()
List = list(List)

a = 0

for n in range(N):
  if List[n] == 'A':
    if List[n + 1] == 'B':
      if List[n + 2] == 'C':
        a += 1
        
print(a)
        

Fixed submission:
N = int(input())
List = input()
List = list(List)

a = 0

for n in range(N - 2):
  if List[n] == 'A':
    if List[n + 1] == 'B':
      if List[n + 2] == 'C':
        a += 1
        
print(a)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

figure = [1, 2, 3]

print(if figure != A or B)

Fixed submission:
A = int(input())
B = int(input())

figure = [1, 2, 3]

if 1 != A and 1 != B:
  print(1)
elif 2 != A and 2 !=B:
  print(2)
else:
  print(3)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = map(str, input().split())
S = S.split('')
T = T.split('')

for i in range(N):
  ans = []
  ans.append(S[i])
  ans.append(T[i])
print(''.join(ans))

Fixed submission:
N = int(input())
S, T = map(str, input().split())
S = list(S)
T = list(T)

for i in range(N):
  ans = []
  for j in range(N):
    ans.append(S[j])
    ans.append(T[j])
print(''.join(ans))
Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split())

if (1<=a and a<=100) and (1<= b and b<=100000) :
	if a*500 >= b:
      print("Yes")
    else:
      print("No")
else:
	print("input value is too large")

Fixed submission:
a,b=map(int, input().split())
 
if (1<=a and a<=100) and (1<= b and b<=100000) :
    if a*500 >= b:
        print("Yes")
    else:
        print("No")
else:
	print("input value is too large")
Buggy python submission (verdict: Runtime Error):

n = raw_input()

n_dec = int(n) / 10
n_one = int(n) % 10

if(n_one ==9):
    print("Yes")
elif(n_dec == 9):
    print("Yes")
else:
    print("No")


Fixed submission:

n = raw_input()

n_dec = int(n) / 10
n_one = int(n) % 10

if(n_one == 9):
    print("Yes")
elif(n_dec == 9):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()

print("%s%s" % (T, S))

Fixed submission:
S, T = [i for i in input().split()]

print("%s%s" % (T, S))
Buggy python submission (verdict: Runtime Error):
s = [i for i in input().split()]
t = [i for i in input().split()]

counter = 0

for i in range(3):
  if s[i] == t[i]:
    counter += 1

print(counter)

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

counter = 0

for i in range(3):
    if s[i] == t[i]:
        counter += 1

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

a ,b= int(input().split())
if a-2*b=>0:
  print({}.format(a-2*b))
else:
  print("0")


Fixed submission:
while True:
    a,b = input().split()
    a = int(a)
    b = int(b)
    if 1<=a<=100 and 1<=b<=100:
        break
c = a-2*b
if c>0:
    print(c)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
from typing import Tuple
from itertools import permutations


class Solution:
    def CountOrder(self, sequence1: Tuple[int], sequence2: Tuple[int]):
        l = list(permutations(range(1, n + 1)))
        index1 = l.index(sequence1)
        index2 = l.index(sequence2)
        return abs(index1 - index2)


if __name__ == "__main__":
    n = int(input())
    sequence1 = tuple(map(int, input().split()))
    sequence2 = tuple(map(int, input().split()))
    solution = Solution()
    print(solution.CountOrder(sequence1, sequence2))



Fixed submission:
from itertools import permutations


class Solution:
    def CountOrder(self, sequence1, sequence2):
        l = list(permutations(range(1, n + 1)))
        index1 = l.index(sequence1)
        index2 = l.index(sequence2)
        return abs(index1 - index2)


if __name__ == "__main__":
    n = int(input())
    sequence1 = tuple(map(int, input().split()))
    sequence2 = tuple(map(int, input().split()))
    solution = Solution()
    print(solution.CountOrder(sequence1, sequence2))
Buggy python submission (verdict: Runtime Error):
from datetime import datetime

input_ = raw_input()
date = datetime.strptime(input_, '%Y/%m/%d')
if date > datetime.strptime("2019/04/30", '%Y/%m/%d'):
    print("TBD")
else:
    print("Heisei")




Fixed submission:
from datetime import datetime

input_ = raw_input()
date = datetime.strptime(input_, '%Y/%m/%d')
if date > datetime.strptime("2019/04/30", '%Y/%m/%d'):
    print("TBD")
else:
    print("Heisei")

Buggy python submission (verdict: Runtime Error):
from datetime import datetime

input_ = raw_input()
date = datetime.strptime(input_, '%Y/%m/%d')
if date > datetime.strptime("2019/04/30", '%Y/%m/%d'):
    print("TBD")
else:
    print("Heisei")




Fixed submission:
from datetime import datetime

input_ = raw_input()
date = datetime.strptime(input_, '%Y/%m/%d')
if date > datetime.strptime("2019/04/30", '%Y/%m/%d'):
    print("TBD")
else:
    print("Heisei")
Buggy python submission (verdict: Runtime Error):
class Solution:
    def isEven(self, a, b):
        if (a * b) % 2 == 0:
            print("Even")
        else:
            print("Odd")


if __name__ == "__main__":
    a, b = input(), input()
    solution = Solution()
    solution.isEven(a, b)


Fixed submission:
class Solution:
    def isEven(self, a: int, b: int):
        if (a * b) % 2 == 0:
            print("Even")
        else:
            print("Odd")


if __name__ == "__main__":
    a, b = map(int, input().split())
    solution = Solution()
    solution.isEven(a, b)
Buggy python submission (verdict: Runtime Error):
n = input()
S = input()
c = 0
for i in range(len(S)):
  if S[i] == 'A' and S[i + 1] == 'B' and S[i+2] == 'C':
    c += 1
print(c)

Fixed submission:
n = input()
S = input()
c = 0
for i in range(len(S)-2):
  if S[i] == 'A' and S[i + 1] == 'B' and S[i+2] == 'C':
    c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
import math
a, b, x = map(int, input().split())
if a * b <= x / a:
  print(math.degrees(math.atan((2 * x / a / a/ a)))
else:
  print(90 - math.degrees(math.atan(x / (0.5 *(b*b)*a))))
  

Fixed submission:
import math
a, b, x = map(int, input().split())
A = math.degrees(math.atan((2*(a*a*b - x) / a/a/a)))
B = 90 - math.degrees(math.atan(x / (0.5 *(b*b)*a)))
if a * math.tan(math.radians(A)) < b:
  print(math.degrees(math.atan((2*(a*a*b - x) / a/a/a))))
else:
  print(90 - math.degrees(math.atan(x / (0.5 *(b*b)*a))))
Buggy python submission (verdict: Runtime Error):
import bisect
n = int(input())
l = list(map(int, input().split()))
count = 0
l.sort()
for i in range(len(l)-1, 1, -1):
  for j in range(i-1, 0, -1):
    count += max(j - (bisect.bisect_right(l, l[i] - l[j])), 0)
print(count)



Fixed submission:
a, b = map(int, input().split())
print(max(a-2*b, 0))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int, input().split()))
count = 0
for i in range(len(l)-2):
  for j in range(i+1, len(l)-1):
    for k in range(j+1, len(l)):
      if l[i]+l[j]>l[k] and l[j]+l[k] > l[i] and l[k] + l[i] > l[j]:
        count += 1
print(count)



Fixed submission:
import bisect
n = int(input())
l = list(map(int, input().split()))
count = 0
l.sort(reverse = False)
for i in range(len(l)-1, 1, -1):
  for j in range(i-1, 0, -1):
    pt = bisect.bisect_right(l, l[i] - l[j])
    count += max(j - pt, 0)
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n = int(input())
a = list(map(int, input().split()))
A = np.empty((0, 2), int)
for i in range(n):
  A = np.append(A, np.array([[i+1, a[i]]]), axis = 0)

ans = str(A[A[:, 1].argsort(), :][:, 0]).replace('[', '').replace(']', '')
print(ans)

      



Fixed submission:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
A = np.zeros(n)
for i in range(n):
  A[a[i] - 1] = i

print(str([int(A[i]) + 1 for i in range(n)]).replace('[', '').replace(']', '').replace(',', ''))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
p = 2 ** n
inf = 10 ** 9
dp = [inf] * p
dp[0] = 0
for i in range(m):
  a, b = map(int, input().split())
  c = sum([2 ** (j - 1) for j in list(input().split())])
  for k in range(p):
    if dp[k|c] > dp[k] + a:
      dp[k|c] = dp[k] + a
      
if dp[-1] == inf:
  print(-1)
else:
  print(dp[-1])

Fixed submission:
n, m = map(int, input().split())
p = 1 << n
dp = [float('inf')] * p
dp[0] = 0
for i in range(m):
  a, b = map(int, input().split())
  c = sum([1 << j - 1 for j in list(map(int, input().split()))])
  for k in range(p):
    if dp[k|c] > dp[k] + a:
      dp[k|c] = dp[k] + a
      
if dp[-1] == float('inf'):
  print(-1)
else:
  print(dp[-1])
Buggy python submission (verdict: Runtime Error):
n, k, q = map(int, input().split())
a = []
for i in range(q):
  a.append(int(input()))
  
m = [0]*n
for i in a:
  m[i] += 1
for i in range(n):
  if m[i] - q + k > 0:
    print('Yes')
  else:
    print('No')

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

while low + 1 < high:
  mid = (low + high) // 2
  
  if min(sum(a), mid  :
    high = mid
  else:
    low = mid
print(high)
"""
for i in range(m):
  a[a.index(max(a))] = int(a[a.index(max(a))] / 2)
print(sum(a))

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

import heapq
a = [-i for i in a]

heapq.heapify(a)
for i in range(m):
  b = heapq.heappop(a) * (-1)
  heapq.heappush(a, b // 2 * (-1))
print(-sum(a))
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
A,B,K = map(int, input().split())

while(K > 0):
  if A > 0:
    A -= 1
  else:
    if B > 0:
      B -= 1
    else:
      break
  K -= 1
print(' '.join(map(str, [A,B])))

Fixed submission:
import sys
input = sys.stdin.readline
A,B,K = map(int, input().split())
 
while(K > 0):
  if A >= K:
    A -= K
    K = 0
    break
  else:
    K -= A
    A = 0
    if B >= K:
      B -= K
      K = 0
      break
    else:
      K -= B
      B = 0
      break
print(' '.join(map(str, [A,B])))
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input().rstrip()
# if (i)th == (i-K)th: point=0
for i in range(K+K,N):
  if T[i] == T[i-K]:
    T[i] = 'o'

point = 0
for t in T:
  if t == 'r':
    point += P
  elif t == 's':
  	point += R
  elif p == 'p':
    point += S

print(point)

Fixed submission:
import sys
input = sys.stdin.readline
X = int(input())

max_n = 100003
primes = [True] * (max_n+1)

for i in range(2,max_n+1):
  if primes[i] == True:
    if i >= X:
      print(i)
      break
    for j in range(i+i, max_n+1, i):
      primes[j] = False
Buggy python submission (verdict: Runtime Error):
import sys
import math
s_ls = sys.stdin.read().split("\n")[:-1]
a = []
b = []
hp = int(s_ls[0].split()[1])
max_slash = 0
for element in s_ls[1:]:
    slash = int(element.split()[0])
    if slash > max_slash:
        max_slash = slash
    b.append(int(element.split()[1]))
bp = sorted([x for x in b if x > max_slash])[::-1]
count = 0
for e in bp:
    hp -= e
    count += 1
    if hp < 0:
        break
if hp > 0:
    count += math.ceil(hp / max_slash)

print(int(count))

Fixed submission:
print("2018" + input()[4:])

Buggy python submission (verdict: Runtime Error):
import sys
import math
s_ls = sys.stdin.read().split("\n")[:-1]
if "" in s_ls:
    s_ls.remove("")
# print(s_ls)
a = []
b = []
hp = int(s_ls[0].split()[1])
max_slash = 0
for element in s_ls[1:]:
    slash = int(element.split()[0])
    if slash > max_slash:
        max_slash = slash
    # a.append(int(element.split()[0]))
    b.append(int(element.split()[1]))
# print(hp)
# print(max(a))
bp = sorted([x for x in b if x > max_slash])[::-1]
# print(max_slash, bp)
count = 0
for e in bp:
    hp -= e
    count += 1
    if hp < 0:
        break
if hp > 0:
    count += math.ceil(hp / max_slash)

print(count)
# max_slash = max([x.split()[0] for x in s_ls])
# print(max_slash)

Fixed submission:
print("2018" + input()[4:])
Buggy python submission (verdict: Runtime Error):
N = int(input())

if N%2==0:
    print(1/2)
else:
    print((a+1)/(a*2))


Fixed submission:
N = int(input())

if N%2==0:
    print(1/2)
else:
    print((N+1)/(N*2))

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

if N%2==0:
    print(1/2)
else:
    print((a+1)/a*2)


Fixed submission:
N = int(input())

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

list = ["eraser","erase","dreamer","dream"]
for x in range(list):
    S = S.replace(x,"")

if len(S) == 0:
    print("YES")
else:
    print("NO")


Fixed submission:
S = input()
S = S.replace('eraser', '')
S = S.replace('erase', '')
S = S.replace('dreamer', '')
S = S.replace('dream', '')
if len(S) == 0:
    print('YES')
else:
    print('NO')

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

S = S.replace("eraser","")
S = S.replace("erase","")
S = S.replace("dreamer","")
S = S.replace("dream","")

if len(S) == 0:
    print("YES")
else:
    print("NO")

print(ans)


Fixed submission:
S = input()
S = S.replace('eraser', '')
S = S.replace('erase', '')
S = S.replace('dreamer', '')
S = S.replace('dream', '')
if len(S) == 0:
    print('YES')
else:
    print('NO')

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

S = S.replace("dream",'"")
S = S.replace("dreamer","")
S = S.replace("erase","")
S = S.replace("eraser","")

if len(S) == 0:
    ans = "YES"
else:
    ans = "NO"

print(ans)


Fixed submission:
S = input()
S = S.replace('eraser', '')
S = S.replace('erase', '')
S = S.replace('dreamer', '')
S = S.replace('dream', '')
if len(S) == 0:
    print('YES')
else:
    print('NO')

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

S.replace("dream",'"")
S.replace("dreamer","")
S.replace("erase","")
S.replace("eraser","")

if len(S) == 0:
    ans = "YES"
else:
    ans = "NO"

print(ans)


Fixed submission:
S = input()
S = S.replace('eraser', '')
S = S.replace('erase', '')
S = S.replace('dreamer', '')
S = S.replace('dream', '')
if len(S) == 0:
    print('YES')
else:
    print('NO')

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

S.replace("dream",'')
S.replace("dreamer",'')
S.replace("erase",'')
S.replace("eraser",'')

if len(S)==0:
    ans = YES
else:
    ans = NO

print(ans)


Fixed submission:
S = input()
S = S.replace('eraser', '')
S = S.replace('erase', '')
S = S.replace('dreamer', '')
S = S.replace('dream', '')
if len(S) == 0:
    print('YES')
else:
    print('NO')

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

S.replace("dream",'')
S.replace("dreamer",'')
S.replace("erase",'')
S.replace("eraser",'')

if len(S)==0:
    YES
else:
    NO


Fixed submission:
S = input()
S = S.replace('eraser', '')
S = S.replace('erase', '')
S = S.replace('dreamer', '')
S = S.replace('dream', '')
if len(S) == 0:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
K,X=map(int.input().split())
if 500*K>=X:
    print('Yes')
else:
    print('No')


Fixed submission:
K,X=map(int,input().split())
if 500*K>=X:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
K,X=map(int,input(),split())
if 500*K>X:
    print('Yes')
else:
    print('No')

Fixed submission:
K,X=map(int,input().split())
if 500*K>=X:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
def lcm(x, y):
 
   if x > y:
       greater = x
   else:
       greater = y
 
   while(True):
       if((greater % x == 0) and (greater % y == 0)):
           lcm = greater
           break
       greater += 1
 
   return lcm
 
print(lcm(a,b))

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

def NonRecursiveGcd(x,y):
 
    while(y):
        x , y = y , x % y
    return x 
def computeLcmWithNonRecursiveGcd(x,y):
    
    lcm = (x*y)//NonRecursiveGcd(x,y)
    
    return lcm  
print(computeLcmWithNonRecursiveGcd(a,b))
Buggy python submission (verdict: Runtime Error):
X,Y=map(int,input().spilt())
mult1=1
mult2=1
if (2*Y-X)%3 ==0:
    x=(2*Y-X)//3
    y=(2*X-Y)//3
    for i in range(min(x,y)):
        mult1*=(x+y-i)
        mult2*=min(x,y)-i
    print((mult2//mult1)%(10**9+7))
else:
    print(0)

Fixed submission:
X,Y=map(int,input().split())
A,B=1,1
mod=10**9+7
if (X+Y)%3 ==0:
    x=(2*Y-X)//3
    y=(2*X-Y)//3
    if min(x,y) >= 0:
      for i in range(min(x,y)):
        A*=(x+y-i)
        A%=mod
        B*=(i+1)
        B%=mod
      print(A*pow(B,mod-2,mod)%mod)
    else:
      print(0)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
import math
a,b,x =map(int,input().split( ))
if x >= (a**2*b/2):
    k=2*x/(a**2)-b
    cos=math.sqrt((b-k)**2/((a**2)+(b-k)**2))
    print(math.degrees(math.acos(cos)))
else:
    k=2*x/(a*b)
    cos=math.sqrt(b**2/(b**2+k**2))
	print(90-math.degrees(math.acos(cos)))

Fixed submission:
import math
a,b,x =map(int,input().split( ))
if x >= (a**2*b/2):
    k=2*x/(a**2)-b
    cos=math.sqrt((b-k)**2/((a**2)+(b-k)**2))
else:
    k=2*x/(a*b)
    cos=math.sqrt(b**2/(b**2+k**2))
print(90-math.degrees(math.acos(cos)))
Buggy python submission (verdict: Runtime Error):
C=A-2*B
if C>0:
    uncovered = C
else:
    uncovered = 0
print('the lenth of unvocered =',uncovered)

Fixed submission:
A,B=map(int,input().split())
C=A-2*B
if C>0:
    uncovered = C
else:
    uncovered = 0
print(uncovered)
Buggy python submission (verdict: Runtime Error):
N=int(input())
if (N+1)/2 == N/2:
  p=float(0.5000000)
else:
  p=float((N-1)/2N)
print(p)
  


Fixed submission:
N=int(input())
if int((N+1)/2) == int(N/2):
  p=float(0.50000000)
else:
  p=float((N+1)/(2*N))
print(p)

Buggy python submission (verdict: Runtime Error):
N=int(input())
if N = N/2:
  p=float(0.5000000)
else:
  p=float((N-1)/2N)
print(p)
  

Fixed submission:
N=int(input())
if int((N+1)/2) == int(N/2):
  p=float(0.50000000)
else:
  p=float((N+1)/(2*N))
print(p)
Buggy python submission (verdict: Time Limit Exceeded):
N= int(input())
H = [int(i) for i in input().split( )]


for i in range(1,N+1):
    for j in range(N):
        if H[j] == i:
            print(j+1)


Fixed submission:
N= int(input())
H = [int(i) for i in input().split( )]
J = [0]*N
for i in range(N):
    J[H[i]-1] = i
for j in range(N):
    print(J[j]+1)

Buggy python submission (verdict: Time Limit Exceeded):
N= int(input())
H = [int(i) for i in input().split( )]

def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while True:
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid + 1
        elif x < arr[mid]:
            end = mid -1
        else:
            break
    return mid + 1
for i in range(N):
    print(binary_search(H,i+1))


Fixed submission:
N= int(input())
H = [int(i) for i in input().split( )]
J = [0]*N
for i in range(N):
    J[H[i]-1] = i
for j in range(N):
    print(J[j]+1)

Buggy python submission (verdict: Runtime Error):
N, K = map(int,input().split( ))
H = [int(i) for i in input().split( )]
J = [0*(N-1)]
def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while(end >= start):
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid+1
        elif x < arr[mid]:
            end = mid -1
        else:
            break
    return start
for i in range(N):
    print(binary_search(arr,i))


Fixed submission:
N= int(input())
H = [int(i) for i in input().split( )]
J = [0]*N
for i in range(N):
    J[H[i]-1] = i
for j in range(N):
    print(J[j]+1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A =map(int,input().split())
sum=0
for i in range(N):
  sum+=1/A[i]
print(1/sum)
  

Fixed submission:
N = int(input())
A = input().split()
sum=0
for i in range(N):
  sum+=1/int(A[i])
print(1/sum)
Buggy python submission (verdict: Runtime Error):
K,X=map(int,input().split(','))
for i in range(-K+1,K):
  kuro = X+i
  if kuro >= -1000000 and kuro <= 1000000:
     print(kuro) 
 

Fixed submission:
K,X=map(int,input().split())
for i in range(-K+1,K):
  kuro = X+i
  if kuro >= -1000000 and kuro <= 1000000:
     print(kuro)

Buggy python submission (verdict: Runtime Error):
K,X=map(int,input().split( ))
for i in range(-K+1,K):
  kuro = X+i
  print(kuro if (kuro >= -1000000 and kuro <= 1000000))

Fixed submission:
K,X=map(int,input().split())
for i in range(-K+1,K):
  kuro = X+i
  if kuro >= -1000000 and kuro <= 1000000:
     print(kuro)
Buggy python submission (verdict: Runtime Error):
A,P=map(int(input().split())
print((3*A+P)//2)


Fixed submission:
A,P=map(int,input().split())
print((3*A+P)//2)