Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- vector<int> getVector(vector<int> &v, int level, int number){
- vector<int> newVector;
- //start from index 1 as level is to be ignored and it is present on index 0
- // for(int i = 1; i < v.size(); i++){
- // if(v[i] != number){
- // newVector.push_back(v[i]);
- // }
- // }
- //full array considered, ignore level to avoid self pairing
- for(int i : v){
- if(i != number && i != level){
- newVector.push_back(i);
- }
- }
- return newVector;
- }
- void getFriendPairs(vector<int> v, string ans, int &count){
- //base case
- if(v.size() == 0){
- count++;
- cout << count << '.' << ans << '\n';
- return;
- }
- //go single
- vector<int> single = getVector(v, v[0], v[0]);
- getFriendPairs(single, ans + '(' + to_string(v[0] + 1) + ')', count);
- //go in pair (every current individual will form pairs with all the people ahead of him only, to avoid duplicacy: (1, 2); (2, 1))
- for(int i = 1; i < v.size(); i++){
- vector<int> pairs = getVector(v, v[0], v[i]);
- getFriendPairs(pairs, ans + '(' + to_string(v[0] + 1) + ',' + to_string(v[i] + 1) + ')', count);
- }
- }
- int main() {
- // your code goes here
- int n;
- cin >> n;
- int count = 0;
- vector<int> v(n);
- for(int i = 0; i < n; i++){
- v[i] = i;
- }
- getFriendPairs(v, "", count);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
