View difference between Paste ID: tNDfZyEd and MBTJ8kQz

-100 100
+#include <iostream>
-2
+#include <algorithm>
-2
+#include <vector>
-1
+#include <map>
-1
+
-2
+using namespace std;
-1
+
-1
+int binary_search(vector<int> marble, int size, int key)
-1
+{
-1
+	int begin = 0;
-1
+	int end = size;
-2
+	int middle;
-2
+	while (begin <= end) {
-2
+		middle = (begin + end) / 2;
-2
+		if (marble[middle] < key) {
-2
+			begin = middle + 1;
-2
+		} else if (marble[middle] > key) {
-2
+			end = middle - 1;
-1
+		} else {
-2
+			return middle;
-1
+		}
-2
+	}
-1
+	return -1;
-1
+}
-2
+
-1
+void testing(vector<int> marble, vector<int> tests, int n_of_tests, int n, int loop){
-1
+	cout << "CASE# " << loop << ":" << endl;
-2
+	for(int i = 0; i < n_of_tests; i++){
-1
+		int aux = tests[i];
-1
+		int flag = binary_search(marble,n,aux);
-2
+		if(flag == -1){
-2
+			cout << tests[i] << " not found" << endl;
-1
+		} else {
-2
+			cout << tests[i] << " found at " << flag << endl;
-1
+		}
-2
+	}
-1
+}
-2
+void reading(int loop){
-2
+	vector<int> marble;
-2
+	int n, n_of_tests, aux;
-1
+	cin >> n >> n_of_tests;
-2
+	if((n == 0) && (n_of_tests == 0)){
-2
+		return;
-1
+	}
-2
+	for(int i = 0;i < n; i++){
-2
+		cin >> aux;
-1
+		marble.push_back(aux);
-2
+	}
-2
+	vector<int> tests;
-2
+	for(int i = 0; i < n_of_tests; i++){
-1
+		cin >> aux;
-2
+		tests.push_back(aux);
-1
+	}
-1
+	std::sort(marble.begin(),marble.end());
-2
+	// for(int i = 0; i < marble.size(); i++){
-2
+	// 	cout << marble[i] << endl;
-2
+	// }
-2
+	testing(marble,tests,n_of_tests,n,loop);
-2
+	reading(loop+1);
-2
+}
-1
+
-1
+int main(){
-2
+	reading(1);
-1
+	return 0;
-1
+}