[백준] 1920번:수 찾기

1920번: 수 찾기

 

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

int solution(vector<int>&num, int target) {
	int start = 0;int end = num.size() - 1;
	while (start <= end) {
		int mid = (start + end) / 2;
		if (num[mid] == target) return 1;
		if (num[mid] < target) start = mid + 1;
		else end = mid - 1;
	}
	return 0;
}

int main() {
	cin.tie(NULL);
	ios_base::sync_with_stdio(false);

	int n, m, t;
	vector<int>num;

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

	sort(num.begin(), num.end());

	cin >> m;
	for (int i = 0;i < m;i++) {
		cin >> t;
		cout<<solution(num, t)<<'\n';
	}
}