[백준 알고리즘] 1920번 수 찾기 - Python

n = int(input())
n_list = list(map(int, input().split()))
n_list.sort()

m = int(input())
m_list = list(map(int, input().split()))


def binarySearch(target, n_list):

    start, end = 0, len(n_list)-1

    while(start <= end):
        mid = (start + end) // 2

        if target < n_list[mid]:
            end = mid - 1
        elif target > n_list[mid]:
            start = mid + 1
        else:
            return 1
    return 0


if __name__ == "__main__":
    for i in range(len(m_list)):
        print(binarySearch(m_list[i], n_list))