#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int book[10];//判断是否走过该步
int a[10];//存储走过的步
int n;
void dfs(int step){
if(step==n+1)
{
for(int i = 1;i<=n;i++)
printf("%d",a[i]);
printf("\n");
return;
}
for(int i = 1;i<=n;i++){
if(book[i]==0){
a[step] = i;
book[i] = 1;
dfs(step+1);
book[i]=0;
}
}
return;
}
int main(){
scanf("%d",&n);
dfs(1);
return 0;
}
n的阶乘(基于DFS)
猜你喜欢
转载自blog.csdn.net/m0_49019274/article/details/114857920
今日推荐
周排行