构造队列：
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

int main(void)
{
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        queue<int> q;
        for (int i = n; i > 0; --i) {
            q.push(i);
            if (i != n) {
                int x = q.front();
                q.pop();
                q.push(x);
            }
        }
        vector<int> nums;
        nums.reserve(n);
        while (!q.empty()) {
            nums.push_back(q.front());
            q.pop();
        }
        cout << nums[n-1];
        for (int i = n-1; i > 0; --i)
            cout << ' ' << nums[i-1];
        cout << endl;
    }
    return 0;
}
创作者周榜
