백준 1920 - 수 찾기 (파이썬)

Answer

import sys

n1 = int(sys.stdin.readline())
a = list(map(int, sys.stdin.readline().split()))
n2 = int(sys.stdin.readline())
b = map(int, sys.stdin.readline().split())
a.sort()

def solution(x, s, e):
    if s > e:
        return 0

    m = (s + e) // 2

    if a[m] == x:
        return 1
    elif a[m] > x:
        return solution(x, s, m - 1)
    else:
        return solution(x, m + 1, e)

for i in b:
    print(solution(i, 0, n1 - 1))