Hackerrank Great XOR

/**
 *    author:  compounding
 *    created: 2024-11-12 21:54:31
 **/
#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define NeedForSpeed                  \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define int long long
#define all(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vpi;
#define f first
#define s second
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define endl "\n"
const int mod = 1000000007;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
void solve()
{
    int n;
    cin >> n;
    // TODO : since k ^ n >= n, then if we have a 0 bit in n at mth position, we think how many numbers can be formed, i.e 2^m
    int ans = 0;
    int m = 1;
    while (n)
    {
        // if its off then we think how many numbers have 1 at that position = 2^m
        if (!(n & 1))
        {
            ans |= m;
        }
        n >>= 1;
        m <<= 1;
    }
    cout << ans << endl;
    return;
}

signed main()
{
    NeedForSpeed;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}