26 lines
388 B
C++
26 lines
388 B
C++
#include <iostream>
|
|
#include <vector>
|
|
using namespace std;
|
|
|
|
template <class T>
|
|
void dfs(vector<T>& _path, int n) {
|
|
if(_path.size() == n){
|
|
for(auto x : _path) cout << x << " ";
|
|
cout << endl;
|
|
return;
|
|
}
|
|
for(int i = 0; i < n; i++){
|
|
_path.push_back(i + 1);
|
|
dfs(_path, n);
|
|
_path.pop_back();
|
|
}
|
|
}
|
|
|
|
int main(){
|
|
int n;
|
|
cin >> n;
|
|
vector<int> path;
|
|
dfs(path, n);
|
|
return 0;
|
|
}
|