백준 10974번 모든 순열 C++

https://www.acmicpc.net/problem/10974

10974번: 모든 순열

 

백트래킹

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int n;

vector<int> ans;
vector<bool> visited;

void BT(int size) {
    if (size >= n) {
        for (auto a : ans) cout << a << " ";
        cout << "\n";
        return;
    }
    for (int i = 1; i <= n; i++) {
        if (visited[i]) continue;
        visited[i] = true;
        ans.push_back(i);
        BT(size + 1);
        visited[i] = false;
        ans.pop_back();
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    visited = vector<bool>(n + 1, false);
    BT(0);
}