[백준 BoJ] 1920 - 수 찾기

// https://www.acmicpc.net/problem/1920
// 수 찾기

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

int N, M, num;

bool search(int num) {
	int left = 0;
	int right = V.size() - 1;

	while (left <= right) {
		int mid = (left + right) / 2;

		if (num < V[mid]) right = mid - 1;
		else if (num > V[mid]) left = mid + 1;
		else return true;
	}
	return false;
}
int main() {
	ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	
	cin >> N;
	
	for (int i = 0; i < N; i++) {
		cin >> num;
		V.push_back(num);
	}
	cin >> M;
	sort(V.begin(), V.end());
	for (int i = 0; i < M; i++) {
		cin >> num;
		if (search(num)) cout << "1\n";
		else cout << "0\n";
	}
}