【算法专题】【搜索】【DFS】枚举全排列

//【算法专题】【搜索】【DFS】枚举全排列#include <cstdio>using namespace std;const int MAXSIZE = 10005;int ans[MAXSIZE],n;bool used[MAXSIZE];void dfs(int dep){if (dep>n){for(int i=1; i<=n; i++)printf("%d ",ans[i]);printf("\n");return;}for(int i=1; i<=n; i++)if (!used[i]){ans[dep]=i;used[i]=true;dfs(dep+1);used[i]=false;}}int main(){scanf("%d",&n);dfs(1);return 0;}