/
balanced parenthesis.cpp
122 lines (96 loc) Β· 2.4 KB
/
balanced parenthesis.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/*
///////////////////////////////////////////
//Question/Info
generate all balanced parenthesis
Write a function to generate all possible n pairs of balanced parentheses.
Examples:
Input: n=1
Output: {}
Explantaion: This the only sequence of balanced
parenthesis formed using 1 pair of balanced parenthesis.
Input : n=2
Output:
{}{}
{{}}
Explantaion: This the only two sequences of balanced
parenthesis formed using 2 pair of balanced parenthesis.
author: srj_v
///////////////////////////////////////////
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define setbits(x) __builtin_popcount(x)
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define eb(x) emplace_back(x)
#define ct(x) cout << x << endl;
#define ct2(x,y) cout << x << " " << y << endl;
#define forn(i,n) for(int i = 0; i < (int)(n); ++i)
#define forx(i,x,n) for(int i = x; i < (int)(n); ++i)
#define nfor(i,n) for(int i = n-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define fsp(x,y) fixed << setprecision(y) << x;
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007 // (1e9+7)
#define pii pair<int,int>
#define pis pair<int,string>
#define vi vector<int>
#define vii vector<pii>
#define mii map<int,int>
#define p_q priority_queue // priority_queue<int> (&) priority_queue< int,vi,greater<int> >
#define _IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long double ld;
#pragma GCC optimize("Ofast")
void c_p_c()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void bpa(int open, int close , string op, vector<string> &v)
{
if (open == 0 and close == 0)
{
// means we are in leaf node of recursive tree
v.pb(op);
return;
}
if (open != 0)
{
// check pattern in recursive tree
string op1 = op;
op1.pb('(');
bpa(open - 1, close, op1, v);
}
if (close > open) {
// we can use close bracket now
string op2 = op ;
op2.pb(')');
bpa(open, close - 1, op2, v);
}
return;
}
int32_t main() {
///////////
c_p_c();
///////////
_IOS
//////////
// code
/*
int t ; cin >> t; while(t--){}
*/
int n = 3;
vector<string> v ;
int close = n ;
int open = n ;
string op = "";
bpa(open, close, op, v);
for (auto i : v) {
ct(i);
}
// cerr << "time: " << clock() << " ms" << '\n';
return 0;
}