[BOJ] #1920. 수 찾기 / 실버4 / 30분 / 성공

Author: Mingguriguri

minjeong/BinarySearch/2024-09-19-[백준]-#1920-수찾기.py

@@ -0,0 +1,25 @@
+n = int(input())
+origin = [int(n) for n in input().split()]  # 4,1,5,2,3
+m = int(input())
+compare = [int(m) for m in input().split()]  # 1,3,7,9,5
+
+origin.sort()  # 1,2,3,4,5
+
+for i in range(m):  #
+    tag = False
+    low = 0
+    high = len(origin) - 1
+    target = compare[i]  # 5
+    while low <= high:
+        mid = (low + high) // 2
+        if origin[mid] == target:
+            tag = True
+            print(1)
+            break
+        elif origin[mid] > target:
+            high = mid - 1
+        else:
+            low = mid + 1
+
+    if tag is False:
+        print(0)