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
kira28:
20170111 11:46:17
Very weak testcases :/


psiphon_exe:
20170106 10:53:13
Stacks stl


scorpion_ajay:
20161223 08:09:33
@sheeteyash AC means answer corrected, i.e., your solution is accepted :P


sheteyash:
20161219 10:38:51
ye AC kya hota hain???


soodan:
20161217 11:54:56
use stacks period. 

kira28:
20161215 21:07:41
AC!!! in c++>0.0sec


manee1211:
20161215 18:44:39
yo AC in one GO


mhto:
20161121 18:32:28
woohoo... AC in one go :D 

aronzx:
20161030 07:54:50
Good Problem ! AC in 1 go . #ff0000. However there is no use of priority given over here. Last edit: 20161030 07:55:17 

asgupta_spoj:
20161026 21:40:24
the expression is surely a full bracket expression.. 
Added by:  mima 
Date:  20040501 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL 6 VB.net 
Resource:   