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
sunny77:
20210821 11:04:16
Browse wikipedia for RPN. You'll get an idea! 

vikasss_7663:
20210729 16:06:40
using stack 

botter_code:
20210602 12:20:49
lessgoo 

kpjoshi:
20210523 21:47:19
The problem statement grossly overstates how complex the input can be. I did not have to account for operator precedence at all, and I could assume every 2 operand subexpression would have brackets around it! 

im_115:
20210201 14:04:03
Do we have to assume that the given algebraic expression will always be correct? 

sir_im_dead_0:
20210122 04:36:57
I just wanna leave this here for the next person who does this:


hrithox_2000:
20201227 05:26:31
it was a very good problem.i take 2 hours to think it but the solution was very easy. 

naens:
20201222 20:29:00
I used AST and recursive descent. It seems I'm the only one here... Made in python, used tuples for the AST nodes... 

arafat_123:
20201220 20:44:37
Very easy. Got AC in one go. Yeaaa 

poorva_s__7__:
20201127 02:55:22
Don't worry about loops, STL works, complexity can be handles with more indented loops

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:   