HDU 1027 Ignatius and the Princess II

#include <iostream>
#include <algorithm>

using namespace std;

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

用了stl中产生下一个排列的函数next_permutation