ONP  Transform the Expression
Transform the algebraic expression with brackets into RPN form (Reverse Polish Notation). Twoargument operators: +, , *, /, ^ (priority from the lowest to the highest), brackets ( ). Operands: only letters: a,b,...,z. Assume that there is only one RPN form (no expressions like a*b*c).
Input
t [the number of expressions <= 100] expression [length <= 400] [other expressions]
Text grouped in [ ] does not appear in the input file.
Output
The expressions in RPN form, one per line.
Example
Input: 3 (a+(b*c)) ((a+b)*(z+x)) ((a+t)*((b+(a+c))^(c+d))) Output: abc*+ ab+zx+* at+bac++cd+^*
hide comments
meet_1:
20170915 18:41:24
AC in one go !!!!! 

mahilewets:
20170912 21:27:55
Solved such problem even in my computer science class in university 

abhi_96:
20170722 13:22:56
a*(b+c) is a b c + *,but accepts abc+ also.weak test cases. 

nikkitricky:
20170720 11:27:54
AC in a go.. :D 

brodzik1337:
20170715 19:55:52
O(n) solution bois!!! 

Jacek Kupiec:
20170626 23:03:04
AC in One!!! 

azazello_:
20170619 10:15:30
http://www.dcode.fr/reversepolishnotation


abhishekrahul:
20170529 12:57:53
weak test cases


ak18shay:
20170528 18:06:50
i'am getting ac on codechef but wrong answer on spoj can any one help? 

horizon121:
20170524 17:12:33
Nice..Solved it using structures instead of stack<>..feels good. 
Added by:  mima 
Date:  20040501 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:   