백준10815)숫자카드-pyhton

https://www.acmicpc.net/problem/10815

10815번: 숫자 카드

a = int(input())

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

b = int(input())

arr2 = list(map(int,input().split()))
arr.sort()

def b(start,end,target):
  mid = (start + end) // 2

  if end < start:
    return 0

  if arr[mid] == target:
    return 1

  if arr[mid] > target:
    end = mid - 1
    return b(start,end,target)
  else:
    start = mid + 1
    return b(start,end,target)
  


for i in arr2:
  start = 0
  end = len(arr) - 1
  q = b(start,end,i)
  print(q,end = ' ')

이분탐색의 전형적인 문제다.