sample cpp

#include <bits/stdc++.h>
using namespace std;
bool Bsearch(int arr[], int n, int start, int end, int ele)
{
    while (start <= end)
    {
        int mid = (start + end) / 2;
        if (arr[mid] == ele)
        {
            return true;
        }

        if (ele > arr[mid])
        {
            start = mid + 1;
        }
        if (arr[mid] > ele)
        {
            end = mid - 1;
        }
    }
    return false;
}

int main()
{
    int n; cin>> n;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> arr[i];
    }
    int a,b; cin>>a>>b;
    int sum = a + b;
    int q = arr[n-1]/sum;
    if (Bsearch(arr,n,0,n-1,sum) || Bsearch(arr,n,0,n-1,q*sum))
    {
        cout << "Yes";
    }
    else
    {
        cout << "No";
    }

    return 0;
}