hdu 1027 Ignatius and the Princess II

链接：点击打开链接

题意：给你n，k,表示有1~n个数，找出为k大的排列.

果断next_permutation

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    int i,n,m;
    int a[1100];
    while(~scanf("%d %d",&n,&m)){
        for(i=0;i<n;i++)
        a[i]=i+1;
        for(i=1;i<m;i++)
        next_permutation(a,a+n);
        printf("%d",a[0]);
        for(i=1;i<n;i++)
        printf(" %d",a[i]);
        printf("\n");
        }
        return 0;
    }