[BOJ] 10974 : 모든 순열

#include <cstdio>
#include <algorithm>
int main() {
    int n, a[9];
    scanf("%d", &n);
    for (int i = 0; i < n; i++) a[i] = i+1;
    do {
        for (int i = 0; i < n; i++) printf("%d ", a[i]);
        puts("");
    } while (std::next_permutation(a, a+n));
    return 0;
}