diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:41:11 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:41:11 +0200 |
| commit | 7f856c7ff080b8d455b9ed16c2e57dd862c3879d (patch) | |
| tree | c2baf90f98c91567358003d6b97a4afed7fa9b42 /BinarySearch/main.cpp | |
| parent | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (diff) | |
| download | competitive-programming-7f856c7ff080b8d455b9ed16c2e57dd862c3879d.tar.xz competitive-programming-7f856c7ff080b8d455b9ed16c2e57dd862c3879d.zip | |
moved some file
Diffstat (limited to 'BinarySearch/main.cpp')
| -rw-r--r-- | BinarySearch/main.cpp | 38 |
1 files changed, 0 insertions, 38 deletions
diff --git a/BinarySearch/main.cpp b/BinarySearch/main.cpp deleted file mode 100644 index 2dbe7fe..0000000 --- a/BinarySearch/main.cpp +++ /dev/null @@ -1,38 +0,0 @@ -#include <bits/stdc++.h> - -using namespace std; - -bool bs(vector<int> &a, int toFind) { - int low = 0; - int high = a.size() - 1; - int mid = (high + low) / 2; - while (low <= high) { - if (a[mid] == toFind) { - return true; - } else if (a[mid] > toFind) { - high = mid - 1; - } else if(a[mid] < toFind){ - low = mid + 1; - } - mid = (high + low) / 2; - } - return false; -} - -int main() { - ios_base::sync_with_stdio(false); - cin.tie(NULL); - int n, k; - cin >> n >> k; - - vector<int> a(n); - vector<int> q(n); - - for (int &x : a) - cin >> x; - for (int i = 0; i < k; i++) { - int y; - cin >> y; - cout << (bs(a, y) ? "YES" : "NO") << endl; - } -} |
