参考:https://blog.csdn.net/ac_gibson/article/details/45308645
7-18 输出全排列 (10 分)
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;
const int N = 15;
int n, dat[N];
int main()
{
cin >> n;
for (int i=0; i<n; i++) dat[i] = i+1;
int cnt = 0;
do{
if (cnt++) cout << endl;
for (int i=0; i<n; i++)
cout << dat[i];
} while (next_permutation(dat, dat+n));
return 0;
}