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
ace_cocytus:
20160926 10:40:14
The expression is always full brackets (If not, I wont get AC). 

hsuyaihtar:
20160903 11:01:03
The description given in problem is very less, read about RPN before attempting. 

mr_pudin:
20160827 05:33:20
Solvable with string although stack is easier.


manojd929:
20160825 12:43:44
getting wrong answer here . although i got correct answers for all test cases 

gutsav:
20160813 21:46:58
AC one go whooo hooo :D 

nikhil10sep:
20160813 18:15:49
test cases do not check for cases like a^b+c 

guneet_1995:
20160810 20:42:24
Please only solve using stack if coding in java c or c++ , DO NOT TRY STRING AND STRINGBUFFERS made it more complicated.


kmrrv:
20160808 15:04:09
AC on one go :) 

cnexans:
20160802 21:05:29
No need for a stack, although it's the best way. Take in count the operations listed, because the test cases don't include all of them. Cost me one WA. 

vikash1143:
20160726 20:15:56
phew:):)

Added by:  Michał Małafiejski 
Date:  20040501 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL 6 VB.net 
Resource:   