【CodeVS1294】全排列

#include<cstdio>
using namespace std;
int a[11];
bool vis[11];
int n;
void print()
{
    for (int i=1;i<=n;i++) printf("%d ",a[i]);
    printf("\n");
}
void dfs(int x,int cnt)
{
    vis[x] = true;
    a[cnt] = x;
    if (cnt == n) print();
    for (int i=1;i<=n;i++)
        if (!vis[i])
            dfs(i,cnt+1);
    vis[x] = false;
}
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++) dfs(i,1);
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n;
char str[20]={‘ ‘};
int main()
{
    scanf("%d",&n);
    for (int i=0;i<n;i++) str[i]=i+‘0‘+1;
    int len = strlen(str);
    for (int i=0;i<=len;i++) printf("%c ",str[i]);
    printf("\n");
    while (next_permutation(str,str+len))
    {
        for (int i=0;i<=len;i++) printf("%c ",str[i]);
        printf("\n");
    }
    return 0;
}