-
Notifications
You must be signed in to change notification settings - Fork 1
/
BRACKETS.cpp
43 lines (38 loc) · 1.01 KB
/
BRACKETS.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
#include <bits/stdc++.h>
#include <cstdio>
#define ll long
#define get(a) scanf("%ld", &a)
#define rep(n) for( ll i = 1; i <= n; i++ )
#define repVector(v) for(vector< pair<ll,ll> >::iterator it = v.begin(); it != v.end(); it++ )
#define repSet(s) for( set< pair< ll, pair<ll,ll> > >::iterator it = s.begin(); it != s.end(); it++ )
#define all(c) c.begin(), c.end()
#define repu(a,n) for( ll i = a; i <= n; i++ )
#define pb push_back
#define min(a,b) ( (a < b) ? a : b )
#define max(a,b) ( (a > b) ? a : b )
#define absol(a) ( ( a >= 0 ) ? a : -a )
#define FOR(i,a,b) for( ll i = a; i < b; i++ )
#define matrix vector< vector<double> >
#define F first
#define S second
#define L 2*r
#define R 2*r+1
#define mp make_pair
using namespace std;
int main() {
ll t; get(t);
while(t--) {
string a; cin >> a;
ll mm = 0, cc = 0;
FOR(i,0,a.size()) {
if( a[i] == '(' ) cc ++;
else if( a[i] == ')' ) cc--;
mm = max( mm , cc );
}
FOR(i,0,mm)
printf("(");
FOR(i,0,mm)
printf(")");
printf("\n");
}
}