NC15128 老子的全排列呢

调库，跑路（逃

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int>arr(9);
int main()
{
    for (int i = 1; i <= 8; i++) {
        arr[i] = i;
    }
    do {
        for (int i = 1; i <= 8; i++) {
            if (i != 8)cout << arr[i] << " ";
            else cout << arr[i] << endl;
        }
    } while (next_permutation(arr.begin()+1, arr.end()));

}