Merge pull request VSFe#3 from yjm07/YJM

VSFe · web-flow · commit 9a6d166c6310 · 2021-01-16T19:31:50.000+09:00
YJM
diff --git a/Concept/04_Binary_Search/Ch.04_이분탐색_Cpp.pdf b/Concept/04_Binary_Search/Ch.04_이분탐색_Cpp.pdf
diff --git a/Source/ch01/15649.cpp b/Source/ch01/15649.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int N, M;
+vector<int> vec;
+
+void f() {
+	if(vec.size() == M) {
+		for(int i : vec) cout << i << " ";
+		cout << "\n";
+		return;
+	}
+	for(int i = 0; i < N; i++) {
+		bool isOK = true;
+		for(int j : vec) {
+			if(j == i) {
+				isOK = false;
+				break;
+			}
+		}
+		if(isOK) {
+			vec.push_back(i);
+			f();
+			vec.pop_back();
+		}
+	}
+}
+
+int main() {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	cin >> N >> M;
+	f();
+	return 0;
+}
diff --git a/Source/ch03/10814.cpp b/Source/ch03/10814.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int N;
+
+struct Person {
+	int age;
+	string name;
+};
+
+bool compare(const Person &x, const Person &y) {
+	return x.age < y.age;
+}
+
+int main() {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	cin >> N;
+	vector<Person> vec;
+	int age; string name;
+	for(int i = 0; i < N; i++) {
+		cin >> age >> name;
+		vec.push_back({age, name});
+	}
+
+	stable_sort(vec.begin(), vec.end(), compare);
+
+	for(auto i : vec) {
+		cout << i.age << " " << i.name << "\n";
+	}
+	return 0;
+}
diff --git a/Source/ch03/2751.cpp b/Source/ch03/2751.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int N;
+vector<int> vec;
+
+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());
+
+	for(int i : vec) {
+		cout << i << "\n";
+	}
+	return 0;
+}
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;
+}
