forked from b-chae/AlgorithmStudy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1920.cpp
More file actions
47 lines (37 loc) · 773 Bytes
/
Copy path1920.cpp
File metadata and controls
47 lines (37 loc) · 773 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <iostream>
#include <algorithm>
using namespace std;
int N, M;
int* A;
int* B;
bool binary_search(int key, int left, int right) {
int middle = (left + right) / 2;
if (A[middle] == key) return true;
if (A[middle] > key&& middle - 1 >= left) {
return binary_search(key, left, middle - 1);
}
if (A[middle] < key && middle + 1 <= right) {
return binary_search(key, middle + 1, right);
}
return false;
}
int main()
{
int i, j;
cin >> N;
A = (int*)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
cin >> A[i];
}
cin >> M;
B = (int*)malloc(sizeof(int) * M);
for (i = 0; i < M; i++) {
cin >> B[i];
}
sort(A, A + N);
for (i = 0; i < M; i++) {
if (binary_search(B[i], 0, N - 1)) cout << "1\n";
else cout << "0\n";
}
return 0;
}