牛客——老子的全排列呢（STL）

思路：STL

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define space putchar(' ')
#define enter putchar('\n')
#define ZY set<node>::iterator
#define lson root<<1
#define rson root<<1|1
typedef unsigned long long ull;
const int MOD7 = 1e9 + 7;
const int MOD9 = 1e9 + 9;
const int imax_n = 1e5 + 7;
typedef pair<int,int> PII;
const int inf=0x3f3f3f3f;
//const int mod=1e9+7;
const int N=5e6+10;
const double esp=1e-10;


ll gcd(ll a,ll b)
{
    return b==0?a:gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
    return a*(b/gcd(a,b));
}

template <class T>
void read(T &x)
{
    char c;
    bool op = 0;
    while(c = getchar(), c < '0' || c > '9')
        if(c == '-')
            op = 1;
    x = c - '0';
    while(c = getchar(), c >= '0' && c <= '9')
        x = x * 10 + c - '0';
    if(op)
        x = -x;
}
template <class T>
void write(T x)
{
    if(x < 0)
        x = -x, putchar('-');
    if(x >= 10)
        write(x / 10);
    putchar('0' + x % 10);
}


int main()
{
   int a[10];
   for(int i=1;i<=8;i++)
    a[i]=i;
   do
   {
       for(int i=1;i<=8;i++)
        printf("%d ",a[i]);
       enter;
   }while(next_permutation(a+1,a+9));





    return 0;
}