题解 | #Tk的排列间异或#

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int a[n], ed = n, st = n + 1, num[n + 1], x;
    for(int i = 0; i < n; i++) cin >> a[i];
    while(ed != 0)
    {
        for(int i = ed; i >= st; i--) num[i] = st + ed - i;
        ed = st - 1;
        x = 32 - __builtin_clz(ed);
        st = (1 << x) - 1 - ed;
    }
    for(int i = 1; i <= n; i++) cout << num[a[i - 1]] << " ";
    return 0;
}