Acwing 94. 递归实现排列型枚举

#include <iostream>

using namespace std;

const int N = 10;

bool st[N];
int path[N];
int n;

void dfs(int u)
{
    if (u == n)
    {
        for (int i = 0; i < n; ++ i) printf("%d ", path[i]);
        printf("\n");
        return ;
    }
    
    for (int i = 1; i <= n; ++ i)
    {
        if (!st[i])
        {
            path[u] = i;
            st[i] = true;
            dfs(u + 1);
            st[i] = false;
        }
    }
}

int main()
{
    scanf("%d", &n);
    
    dfs(0);
    
    return 0;
}