考察全排列:next_permutation
用法:
#include <stdio.h> #include <algorithm> using namespace std; int main(){ int n; while(scanf("%d",&n)&&n){ int a[1000]; for(int i=0;i<n;i++){ scanf("%d",&a[i]); } sort(a,a+n); do{ for(int i=0;i<n;i++) printf("%d ",a[i]); printf("\n"); }while(next_permutation(a,a+n)); } return 0; }
这题的代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
while( scanf("%d%d",&n,&m)==2){
int a[1010];
for(int i=0;i<n;i++){
a[i]=i+1;
}
while(--m){
next_permutation(a,a+n);
}
for(int i=0;i<n;i++){
printf("%d",a[i]);
if(i!=n-1) printf(" ");
}
printf("\n");
}
return 0;
}