include [HTML_REMOVED]

using namespace std;
const int N = 10;
int path[N];//路径
int state[N];//状态数组
int n;
void dfs(int u){//u代表走到哪个位置了
if(u > n ){
for(int i = 1;i<=n;i){
cout << path[i] << ” “;
}
cout << endl;
}
for(int i = 1;i<=n;i){ //在第u个位置从1~n挑一个state为0的放进去
if(!state[i]){
path[u] = i;
state[i] = 1;
dfs(u+1);
state[i] = 0;//回溯
}
}
}
int main(){
cin >> n;
dfs(1);

}