fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. const int MAXN = 1000001; // Define max array size
  5.  
  6. int n, a[MAXN], q;
  7.  
  8. // Binary search function to check if target exists in sorted array
  9. bool binary_search(int a[], int sz, int target) {
  10.     int low = 0, high = sz - 1;
  11.     while (low <= high) {
  12.         int tg = (low + high) / 2; // Compute middle index
  13.         if (a[tg] == target) return true; // Target found
  14.         if (target < a[tg]) high = tg - 1; // Search left half
  15.         else low = tg + 1; // Search right half
  16.     }
  17.     return false; // Target not found
  18. }
  19.  
  20. int main() {
  21.     // Read size of the array
  22.     cin >> n;
  23.     for (int i = 0; i < n; ++i) cin >> a[i];
  24.  
  25.     // Sorting the array to enable binary search
  26.     sort(a, a + n);
  27.  
  28.     // Read number of queries
  29.     cin >> q;
  30.     while (q--) {
  31.         int x;
  32.         cin >> x;
  33.  
  34.         // Check if x exists in the array using binary search
  35.         if (binary_search(a, n, x)) 
  36.             cout << "YES" << endl;
  37.         else 
  38.             cout << "NO" << endl;
  39.     }
  40.  
  41.     return 0;
  42. }
  43.  
Success #stdin #stdout 0.01s 5296KB
comments (?)
stdin
copy 
5
1 4 6 8 1
3
1 3 8
stdout
copy 
YES
NO
YES
https://ideone.com/j86ZuB
You are given an array of 𝑛 integers and 𝑞 queries. Each query consists of an integer 𝑥, and you need to determine whether 𝑥 exists in the array.
If 𝑥 exists, print "YES".
Otherwise, print "NO".
language:
C++ (gcc 8.3)
created:
23 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!