알고리즘 문제/알고리즘 문제풀이
1920 수찾기(이분탐색)
태윤2
2020. 10. 25. 22:31
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
import sys
input = sys.stdin.readline
n = int(input())
s = list(map(int, input().split()))
m = int(input())
s_ = list(map(int, input().split()))
def bi_search(arr,target,start,end):
if start > end :
return 0
mid = (start+end) // 2
if target == arr[mid]:
return 1
elif target < arr[mid]:
return bi_search(arr,target,start,mid-1)
elif target > arr[mid]:
return bi_search(arr,target,mid+1,end)
s.sort()
for i in s_:
print(bi_search(s,i,0,n-1))
|
cs |