hdu Ignatius and the Princess II_STL next_permutation的用法

水题一道，练习STL

#include<iostream>#include<algorithm>using namespace std;int main(){ int a[10001];  int m,n;  int i,sum;  while(cin>>m>>n)  {sum=1;  for(i=1;i<=m;i++)  a[i]=i;  while(sum<n)  {next_permutation(a+1,a+1+m);  sum++;}  for(i=1;i<=m;i++)  {if(i==1) cout<<a[i];  else   cout<<" "<<a[i];  }  cout<<endl;    }return 0;}