Submission #41996953

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

#define mp make_pair
#define pb push_back
#define ll long long

int t;
ll n;

ll bump(ll x, ll n, ll pos) 
{
  while (true) 
  {
    if (x & (1LL << (pos + 1)))
      return x;

    ll next = x - (1LL << pos) + (1LL << pos) * 2;

    if (next > n)
      return x;
    
    pos++;
    x = next;
  }
}

ll solve(ll n)
{
  if (n < 7)
    return -1;

  ll x = 7;
  x = bump(x, n, 2);
  x = bump(x, n, 1);
  x = bump(x, n, 0);
  return x; 
}

int main()
{
  cin >> t;
  for (int ti = 0; ti < t; ti++)
  {
    cin >> n;
    cout << solve(n) << '\n';
  }
  


  return 0;
}

Submission Info

Judge Result