백준 [ALGORITHM] - 수 찾기 (1920)

def bin_search(array, target, start, end):
    while start <= end:
        mid = (start + end) // 2
        if array[mid] == target:
            return True
        elif array[mid] > target:
            end = mid - 1
        else:
            start = mid + 1
    return False

n = int(input())
arr = list(map(int, input().split()))

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

sorted_arr = sorted(arr)
for target in targets:
    if bin_search(sorted_arr, target, 0, len(sorted_arr) - 1):
        print(1)
    else:
        print(0)