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+^*
Added by:  Michał Małafiejski 
Date:  20040501 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: NODEJS PERL 6 SCM chicken VB.net 
Resource:   
hide comments
artista_14:
20150628 15:09:30
STL made code shorter......Excellent problem for beginners....... 

Tanuj Kumar:
20150626 13:46:50
Can someone please tell whether it is possible for the SPOJ compiler to judge wrongly. Because my code worked fine on idone.com but it shows wrong answer here. P.S. My code is in C.


uptoyou:
20150624 11:03:43
hint : stack is used for the implementation 

uptoyou:
20150624 11:00:45
yeah AC in one go after thinking the algorithm about 1 hour haha, anyway, nice problem :) 

vasayashwanth:
20150618 03:43:07
i used cin.getline() to read the input and got WA too many times......and then used cin>> and got AC.....also check that array size is atleast 400


mohit:
20150617 18:47:18
#include<stdio.h>


aveshmeena:
20150612 06:56:34
anyone done this is #c 

candide:
20150606 12:33:41
RPN is a little cryptic, isn't it? IMO there are many spoj problems giving more fun and less popular so why this question is so popular (rank 6)?


theplaymaker:
20150520 09:12:13
You will step up from amateur level after solving this 

karthik1997:
20150517 18:04:07
my code went well in ideone.but its not working in this spoj compiler .and i did it in c
