ch04.boj_1764,1920

yjm07 · yjm07 · commit e8f01660b7c8 · 2021-01-16T19:23:55.000+09:00
diff --git a/Concept/04_Binary_Search/Ch.04_이분탐색_Cpp.pdf b/Concept/04_Binary_Search/Ch.04_이분탐색_Cpp.pdf
diff --git a/Source/ch04/1764.cpp b/Source/ch04/1764.cpp
@@ -0,0 +1,50 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int N, M;
+
+vector<string> vec;
+
+bool binaraySearch(string target) {
+	int left = 0, right = vec.size() - 1;
+	while(left < right) {
+		int mid = (left + right) / 2;
+		if(vec[mid] < target) left = mid + 1;
+		else right = mid;
+	}
+	return (vec[(left + right) / 2] == target);
+}
+
+int main() {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	cin >> N >> M;
+
+	string tmp;
+	for(int i = 0; i < N; i++) {
+		cin >> tmp;
+		vec.push_back(tmp);
+	}
+
+	sort(vec.begin(), vec.end());
+
+	vector<string> vec1;
+	for(int i = 0; i < M; i++) {
+		cin >> tmp;
+		if(binaraySearch(tmp)) {
+			vec1.push_back(tmp);
+		}
+	}
+
+	sort(vec1.begin(), vec1.end());
+	cout << vec1.size() << "\n";
+	for(string i : vec1) {
+		cout << i << "\n";
+	}
+
+	return 0;
+}
diff --git a/Source/ch04/1920.cpp b/Source/ch04/1920.cpp
@@ -0,0 +1,43 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int N, M;
+
+vector<int> vec;
+
+bool binaraySearch(int num) {
+	int left = 0, right = vec.size() - 1;
+	while(left < right) {
+		int mid = (left + right) / 2;
+		if(vec[mid] < num) left = mid + 1;
+		else right = mid;
+	}
+	return (vec[(left + right) / 2] == num);
+}
+
+int main() {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	cin >> N;
+
+	int tmp;
+	for(int i = 0; i < N; i++) {
+		cin >> tmp;
+		vec.push_back(tmp);
+	}
+
+	sort(vec.begin(), vec.end());
+
+	cin >> M;
+
+	for(int i = 0; i < M; i++) {
+		cin >> tmp;
+		cout << binaraySearch(tmp) << "\n";
+	}
+
+	return 0;
+}
