Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- vector<int> arr;
- void recur(vector<vector<int>> &ans, vector<int> &arr, int n, int i){
- if(i == n){
- ans.push_back(arr);
- return;
- }
- for(int j = i; j < n; ++j){
- swap(arr[i], arr[j]);
- recur(ans, arr, n, i + 1);
- swap(arr[i], arr[j]);
- }
- }
- vector<vector<int>> permute(vector<int> &arr){
- vector<vector<int>> ans;
- recur(ans, arr, arr.size(), 0);
- return ans;
- }
- int main(){
- int n;
- scanf("%d", &n);
- for(int i = 0; i < n; ++i){
- int x;
- scanf("%d", &x);
- arr.push_back(x);
- }
- for(vector<int> &v : permute(arr)){
- cout << "[ ";
- for(int x : v){
- cout << x << ' ';
- }
- cout << "]\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement