(C++) 순열(Permutation)

#define _CRT_SECURE_NO_WARNINGS
#define INF 987654321

#include <iostream>
#include <vector>

using namespace std;

vector<int> v;
bool check[100];

vector<int> temp;
vector<vector<int>> result;

void permutation(int n, int r) {

    if (n == r) {
        result.push_back(temp);
        return;
    }

    for (int i = 0; i < v.size(); i++) {

        if (check[i]) continue;
        check[i] = true;

        temp.push_back(v[i]);
        permutation(n + 1, r);

        temp.pop_back();
        check[i] = false;
    }
}


int main() {
    
    v.push_back(1);
    v.push_back(2);
    v.push_back(3);
    v.push_back(4);
    v.push_back(5);
    
    permutation(0, 2);

    for (int i = 0; i < result.size(); i++) {
        for (int j = 0; j < result[i].size(); j++) {
            cout << result[i][j] << " ";
        }
        cout << endl;
    }

    return 0;
}