Roof Construction(异或/构造)

题目
题意：给定数n，要求构造$0,1,2...,n-1$的排列$a$，使得$max(a_{i-1}⨁a_i)$最小化。
官方题解
设不大于n-1的最小的2的幂次是k，则$max(a_{i-1}⨁a_i)$为$2^k$。构造方式$2^k-1,2^k-2,...,0,2^k,...,n-1$

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 200010;

int n;

void solve() {
	scanf("%d", &n);
	int k = 0;
	while ((1 << (k+1)) < n) {
		++k;
	} 
	for (int i = (1 << k) - 1; i >= 0; --i) {
		printf("%d ", i);
	}
	for (int i = (1 << k); i < n; ++i) {
		printf("%d ", i);
	}
	printf("\n");
}
int main() {
	int t;
	scanf("%d", &t);
	while(t--) {
		solve();
	} 
	return 0;
}