ONP - Transform the Expression


Transform the algebraic expression with brackets into RPN form (Reverse Polish Notation). Two-argument 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
Ashvjit Singh: 2016-07-13 09:48:07

if anyone is having any problem, I suggest you study about RPN.
Very simple question with poor description.

xinnix: 2016-07-11 07:09:33

Good for learning stack...

atingarg93: 2016-07-08 09:06:56

.

Last edit: 2016-07-08 09:07:19
code_killerx: 2016-06-18 19:17:41

Stack 101 AC in one go!!

mkfeuhrer: 2016-06-16 23:44:51

as easy as stack can be :-P ....basic prob no issues !! already had the code :-) AC :-)

candide: 2016-06-11 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: 2016-05-31 10:25:22

but in my compiler its execution is normal
and when i upload it ,it show segmentation fault

gurjits909: 2016-05-31 10:22:20

Last edit: 2016-05-31 10:52:21
get_right_jr: 2016-05-31 07:56:56

Infix to Postfix

avisheksanvas: 2016-05-17 16:30:29

Priority rule implementation isn't necessary.
And don't think of skipping a[0] and a[len-1]. They're not always brackets :p


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

Problem's scores 1 vote

Concept difficulty
Concept difficulty 21%
Implementation difficulty
Implementation difficulty 18%
55 2