codevs 1294 全排列 next_permuntation

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-14
const int N=2e5+10,M=4e6+10,inf=1e9+10,mod=1e9+7;
const ll INF=1e18+10;
int a[N];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    a[i]=i;
    do
    {
        for(int i=1;i<n;i++)
        printf("%d ",a[i]);
        printf("%d\n",a[n]);
    }while(next_permutation(a+1,a+n+1));
    return 0;
}