Submission #74715464

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

//#define int long long
//#define float long double

using uint = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pff = pair<float,float>;
using pdd = pair<ld,ld>;

#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second

const ld PI = 3.14159265358979323846;
const ld E = 2.71828182845904523536;
const int MOD = 998244353;

int bin_pow(int a,int b)
{
    int ans = 1;
    while(b != 0)
    {
        if(b & 1)
            ans = ans * a;
        a = a * a;
        b >>= 1;
    }
    return ans;
}

void solve()
{
    int n;
    cin >> n;
    int cnt = 0;
    for(int i = 1;i <= bin_pow(2,log2(n+1))-1;i++)
    {
        cout << (i ^ (i >> 1)) << ' ',cnt++;
    }
    vector<int> rem;
    for(int i = bin_pow(2,log2(n+1));i <= 16*n;i++)
    {
        if(cnt >= n)
            break;
        if((i ^ (i >> 1)) <= n)
            rem.pb((i ^ (i >> 1))),cnt++;
    }
    if(!rem.empty() && rem[0] > rem.back())
        reverse(all(rem));
    for(auto i : rem)
        cout << i << ' ';
    cout << endl;
}

signed main()
{
    std::cin.tie(nullptr);std::ios::sync_with_stdio(false);
    
    int tt = 1;
    cin >> tt;
    while(tt--)
    {
        solve();
    }

    return 0;
}

Submission Info

Judge Result