题解 | 全排列

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	int a[10]={0}; 
	for(int i=1;i<=n;i++){
	    a[i]=i;
	} 
	do{
	    for(int i=1;i<=n;i++){
		    cout<<a[i]<<" ";
		}
		cout<<endl;
	}while(next_permutation(a+1,a+n+1));
	return 0;
}