二分查找

def solve():
    def binary_search(____):
        left, right = ____, len(____) - ____
        while left <= right:
            mid = (____) // ____
            if arr[mid] == target:
                return mid
            elif arr[mid] < target:
                left = mid + ____
            else:
                right = mid - ____
        return -____
    arr = [____, ____, ____, ____, ____, ____, ____, ____]
    target = ____
    result = binary_search(____)
    print(____)
    print(____)
    print(____)