HDU-1027 Ignatius and the Princess II

HDU-1027 Ignatius and the Princess II

题目链接：HDU-1027

题目大意：输出第几次全排列

解题思路：使用C++ 全排列函数即可next_permutation()

代码块：

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>

using namespace std;

int m,n;
int arr[1005];
int main() {
    while(cin>>m>>n) {
        for(int i = 0; i < m; i++) {
            arr[i] = i+1;
        }
        for(int i = 1; i < n; i++) {
            next_permutation(arr,arr+m);
            if(i == n-1) {
                for(int j=0; j<m; j++) {
                    if(j == 0) cout<<arr[j];
                    else cout<<" "<<arr[j];
                }
            }
        }
        cout<<endl;
    }
    return 0;
}