# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976086 | rythm_of_knight | Permutation (APIO22_perm) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// #define int long long
using namespace std;
void fastio() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
}
void solve() {
int k, temp;
cin >> k; k--;
temp = k;
vector <int> v;
while (temp) {
v.push_back(temp & 1);
temp >>= 1;
}
int sz = v.size();
for (int i = 0; i < sz; i++) {
while (i > 0 && v[i - 1] == 0 && v[i] > 0) {
v[i - 1] += 2;
v[i]--;
i--;
}
}
int cnt = -1;
vector <int> ans;
for (int i = 0; i < sz; i++) {
vector <int> t;
while (v[i]--) {
t.push_back(++cnt);
}
reverse(t.begin(), t.end());
for (int &u : t) {
ans.push_back(u);
}
}
for (int &u : ans)
cout << u << ' ';
cout << '\n';
}
signed main() {
fastio();
int q;
cin >> q;
while (q--) {
solve();
}
}