-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1077.cpp
More file actions
57 lines (49 loc) · 1.54 KB
/
1077.cpp
File metadata and controls
57 lines (49 loc) · 1.54 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
#include <iostream>
#include <stack>
using namespace std;
int main() {
string linha;
char pri[128], elem;
pri['^']=6; pri['*']=5; pri['/']=5; pri['+']=4; pri['-']=4; pri['>']=3; pri['<']=3; pri['#']=3; pri['&']=2; pri['|']=1; pri['(']=0;
stack <int> pilha;
int n;
cin >> n;
while(n--){
cin >> linha;
for(int i=0; i<linha.size(); i++) {
elem = linha[i];
if( toupper(elem) >= 'A' && toupper(elem) <= 'Z' || elem >= '0' && elem <= '9') {
cout << elem;
} else { /// Operador ou Parênteses
if(pilha.size() == 0 || elem == '(') {
pilha.push(elem);
} else if(elem == ')'){
while( pilha.top() != '(' ) {
cout << (char)pilha.top();
pilha.pop();
}
pilha.pop();
} else {
if( pri[elem] > pri[pilha.top()] ) {
pilha.push(elem);
} else {
while( pilha.size() > 0 && pri[pilha.top()] >= pri[elem] ) {
cout << (char)pilha.top();
pilha.pop();
}
pilha.push(elem);
}
}
}
}
if(pilha.size() > 0) {
while( pilha.size() > 0 ) {
cout << (char)pilha.top() << endl;
pilha.pop();
}
} else {
cout << endl;
}
}
return 0;
}