hdoj 1027 Ignatius and the Princess II

题目链接：Ignatius and the Princess II

题目大意：给你一个n和num，算n的第num个全排列

题目思路：水体，会用next_permutation()就好

#include <bits/stdc++.h>

using namespace std;

int main(){
    int n,num,s[100005];
    while(~scanf("%d%d",&n,&num)){
        for(int i = 0;i < n;i++)
            s[i] = i+1;
        int cot = 1;
        while(next_permutation(s,s+n)){
            cot++;
            if(cot == num) break;
        }
        printf("%d",s[0]);
        for(int i = 1;i < n;i++)
            printf(" %d",s[i]);
        puts("");
    }
    return 0;
}