x-1 to 1??

if you know binary search, it was simple simulation, i dont know why so many people were worried to make bitwise operations on that!

Auto comment: topic has been updated by arifin_fuad_kashfy (previous revision, new revision, compare).

what is "__builtin_clz(x)": This counts the number of leading zeros in the binary representation of x.

eg:

If x = 5 (binary 101), the number of leading zeros is 29 (assuming a 32-bit integer, since 5 is 000xxx000101).

If x = 8 (binary 1000), the number of leading zeros is 28.

If x = 5 (binary 101), 32 — __builtin_clz(5) — 1 = 3 — 1 = 2.

If x = 8 (binary 1000), 32 — __builtin_clz(8) — 1 = 4 — 1 = 3.

TRY THIS CODE-->

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int binary_of_x(int x) {
    return (1 << (32 &mdash; __builtin_clz(x) &mdash; 1)) &mdash; 1;
}

void solve() 
{
    ll x;
    cin >> x;
    ll B = binary_of_x(x);
    ll xorB = x ^ B;
    ll a = B, b = xorB, c = x;
    if (a > c) {
    	swap(a, c);
    }
    if (b > c){ 
    	swap(b, c);
    	
    }
    if (a + b > c) {
        cout << B << "\n";
    } else {
        cout << "-1\n";
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}