1920번

1920

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> A;

bool existNum(int num) {
	int start = 0;
	int end = A.size() - 1;
	int mid = (start + end) / 2;
	while (start <= end) {
		if (num == A[mid]) {
			return 1;
		}
		else if (num > A[mid]) {
			start = mid + 1;
			mid = (start + end) / 2;
		}
		else {
			end = mid - 1;
			mid = (start + end) / 2;
		}
	}
	return 0;
}

int main() {
	int a, b;
	vector<int> B;
	cin >> a;
	for (int i = 0; i < a; i++) {
		int num;
		cin >> num;
		A.push_back(num);
	}
	sort(A.begin(), A.end());

	cin >> b;
	for (int i = 0; i < b; i++) {
		int num;
		cin >> num;
		B.push_back(num);
	}

	for (int i = 0; i < b; i++) {
		cout << existNum(B[i]) << "\n";
	}
}