๐งฎ PS
๋ฐฑ์ค (boj) ํ์ด์ฌ - 1920๋ฒ : ์ ์ฐพ๊ธฐ
Newmon
2020. 8. 9. 16:29
๋ฌธ์ ๋งํฌ : https://www.acmicpc.net/problem/1920
๋๊ฐ์ ๋ฆฌ์คํธ๊ฐ ์ฃผ์ด์ง๋ค. ์ฒซ๋ฒ์งธ ๋ฆฌ์คํธ๊ฐ ํ์ํ ๋์์ด๊ณ , ๋๋ฒ์งธ ๋ฆฌ์คํธ์ ๊ฐ ์์๊ฐ target ์ด๋ค.
์ด๋ฅผ for๋ฌธ์ ํตํด ๊ฐ๊ฐ ์ด๋ถํ์์ผ๋ก ๋ฌธ์ ๋ฅผ ํด๊ฒฐํ๋ค.
์ด์งํ์ , ์ด๋ถํ์
https://infinitt.tistory.com/286
*ํ์ด์ฌ ์ฝ๋
N = int(input())
arr_n = list(map(int,input().split()))
arr_n.sort()
M = int(input())
arr_m = list(map(int,input().split()))
for i in arr_m:
start = 0
end = N-1
target = i
answer = 0
while (start <= end):
mid = (start+end) //2
if arr_n[mid] == target:
answer = 1
break
elif target < arr_n[mid]:
end = mid-1
else:
start = mid+1
print(answer)