生成1~n的排列

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const LL INF=1e18;
const int MAXN=60;
const double eps=1e-10;
int a[MAXN],n;

void print_permutation(int cur)
{
    if(cur==n+1)
    {
        for(int i=1;i<=n;i++) printf("%d ",a[i]);
        printf("\n");
    }else
    {
        for(int i=1;i<=n;i++)
        {
            bool ok=true;
            for(int j=1;j<cur;j++)
            if(a[j]==i) {ok=false;break;}
            if(ok)
            {
                a[cur]=i;
                print_permutation(cur+1);
            }
        }
    }
}

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        print_permutation(1);
    }
    return 0;
}