-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbalance.cpp
More file actions
75 lines (64 loc) · 1.33 KB
/
Copy pathbalance.cpp
File metadata and controls
75 lines (64 loc) · 1.33 KB
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
#include <iostream>
typedef long long int ll;
#define mod 1000000007;
#define loop(x,a,n) for(ll x = a; x < n; ++x)
using namespace std;
// SAMARTH SINGHAL 2K19/CO/335
#define MAX 100007
#define MIN -1000000007
int invert(int a) {if (a == 0) {return 1;}else if(a==1){return 0;} else{return -1;}}
//////////////////////////////////////////////////////////////////////////////
/////////////////////////// S T A C K ////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
class Stack {
int top;
public:
int a[MAX];
Stack() { top = -1; }
bool push(int x);
int pop();
};
bool Stack::push(int x)
{
if (top >= (MAX - 1)) {
cout << "ERROR";
return false;
}
else {
a[++top] = x;
//cout << x;
return true;
}
}
int Stack::pop()
{
if (top < 0) {
cout << "ERROR";
return 0;
}
else {
int x = a[top--];
return x;
}
}
void display(Stack s,int n) {
while (n--) {
cout << s.pop() << ' ';
}
}
int main(){
char c[MAX];
int n;
cin >> n;
loop(i,0,n){
cin >> c[i];
}
int ans=0;
loop(i,0,n){
if(c[i] == '('){ans++;}
if(c[i] == ')'){ans--;}
if(ans < 0){cout << "UNBALANCED" << endl;break;}
}
if(ans > 0){cout << "UNBALANCED" << endl;}
else if(ans ==0 ){cout << "BALANCED" << endl;}
}