深度优先搜索,简称深搜, D F S DFS DFS
基础模板:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <float.h>
#include <ctype.h>
#include <map>
#include <stdbool.h>
using namespace std;
int n;
int a[1005], b[1005];
void dfs(int t) {
if(t == n+1) {
for(int i = 1; i <= n; i++)
printf("%5d", a[i]);
printf("\n");
return ;
}
for(int i = 1; i <= n; i++) {
if(b[i]) continue;
a[t] = i, b[i] = 1;
dfs(t+1);
a[t] = 0,b[i] = 0;
}
}
int main() {
scanf("%d", &n);
dfs(1);
return 0;
}