28 3 月, 2026
| No Comments »
#include<stdio.h>
int vis[20],a[20],n;
void dfs(int k){
if(k==n){
for(int i=0;i<=n;i++){
printf("%d",a[i]);
}
printf("\n");
return;
}for(int i=1;i<=n;i++){
if(!vis[i]){
vis[i]=1;
a[k]=i;
dfs(k+1);
vis[i]=0;
}
}
}
int main(){
n=3;
dfs(0);
return 0;
}
Posted in 未分类