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
code_killerx:
20160618 19:17:41
Stack 101 AC in one go!! 

mkfeuhrer:
20160616 23:44:51
as easy as stack can be :P ....basic prob no issues !! already had the code :) AC :) 

candide:
20160611 09:14:55
Easy and classical question, no trap. After multiple tries, AC in Python in 0.00s (observe that left parenthesis are useless). Problem description is unclear. 

gurjits909:
20160531 10:25:22
but in my compiler its execution is normal


gurjits909:
20160531 10:22:20
Last edit: 20160531 10:52:21 

get_right_jr:
20160531 07:56:56
Infix to Postfix 

avisheksanvas:
20160517 16:30:29
Priority rule implementation isn't necessary.


mrhex:
20160513 21:04:39
All operators have the same priority. Parentheses are always used, just like in the examples. Explanation should be clearer, because without parentheses and with different operator priority it is quite difficult. 

mohitgupta07:
20160513 20:39:32
ac in a go :P :P using string,string buffers are much better than creating a stack :D :D ...Java everywhere :P :P


bhushangawde:
20160513 12:21:14
its sayn size exceeded. what shud i do please suggest 
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:   