全排列 深搜dfs

#include<iostream>#include<cstdio>using namespace std;int a[100],vis[100],n;void dfs(int t){if(n<t){    for(int i=1;i<=n;i++)        printf("%d ",a[i]);    puts("");    return;}for(int i=1;i<=n;i++)if(vis[i]==0){    vis[i]=1;    a[t]=i;    dfs(t+1);    vis[i]=0;}}int main(){cin>>n;dfs(1);}