Next_permutation
头文件:#include <algorithm>
#include <iostream>
#include <algorithm>
using namespace std;
void qpl(int a[],int n)
{
for(int i=1;i<=n;i++)
{
a[i]=i;
}
do{
for(int i=1;i<n;i++)cout<<a[i]<<' ';
cout<<a[n]<<endl;j++;
}while(next_permutation(a+1,a+n+1));
}
int main()
{
int a[1000],n;
cin>>n;
qpl(a,n);
return 0;
}