组合数学 计算生成排列的邻位互换法

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
int main(void)
{
    int loop = 0;//用例组数
    int n, k;//输出：n排列第k个排列
    int move[10000];//move 数组用来记录移动个数
    int navigate[10000];//navigate数组记录插入方向
    memset(move, 0, 10000);
    memset(navigate, 0, 10000);
    cin >> loop;
    while (loop--) {
        vector<int> outcome;//输出数组
        outcome.clear();
        cin >> n >> k;
        int ncopy = n;
        k = k - 1;
        while (ncopy > 0) {//计算move数组&navigate数组
            move[ncopy] = k % ncopy;
            k = k / ncopy;
            if (k % 2 == 0)navigate[ncopy] = -1;
            else navigate[ncopy] = 1;
            ncopy--;
        }
        //将1放入vector
        outcome.insert(outcome.begin(),1);
        //根据move和navigate进行插入
        for (int i = 2; i <= n; i++) {
            int moveflag = navigate[i];
            if (moveflag == -1) {
                outcome.insert(outcome.end() - move[i], i);
            }
            else {
                outcome.insert(outcome.begin() + move[i], i);
            }
        for (int i = 0; i < outcome.size(); i++) {
            cout << outcome.at(i) ;
            if (i != outcome.size()-1)cout << " ";
        }
        cout << endl;
    }
    return 1;
}