题解

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll n,a[1000010],vis[1000010];
void find(ll k){
    if(k>=n+1){
        for(ll i=1;i<=n;i++){
            printf("%5d",a[i]);
        }
        cout<<"\n";
        return ;
    }
    for(ll i=1;i<=n;i++){
        if(vis[i]==0){//1真 0假
            a[k]=i;
            vis[i]=1;
            find(k+1);
            vis[i]=0;
        }
    }
}
int main(){
    cin>>n;
    find(1);
    return 0;
}

加团队