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
ajay_raj_: 2017-11-20 15:32:17

Stack is required

baraajaw97: 2017-11-13 22:11:51

.

sero: 2017-10-28 17:52:25

What does AC mean ? :D

abdo_k009: 2017-10-14 09:13:53

wrong answer !?
guess what?

shikhars387: 2017-10-08 05:50:31

Test cases are very weak!!
first got AC with right logic then i made wrong changes and also got AC.

meet_1: 2017-09-15 18:41:24

AC in one go !!!!!

mahilewets: 2017-09-12 21:27:55

Solved such problem even in my computer science class in university

abhi_96: 2017-07-22 13:22:56

a*(b+c) is a b c + *,but accepts abc+ also.weak test cases.

nikkitricky: 2017-07-20 11:27:54

AC in a go.. :D

brodzik1337: 2017-07-15 19:55:52

O(n) solution bois!!!


Added by:mima
Date:2004-05-01
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:-

Problem's scores 1 vote

Concept difficulty
Concept difficulty 22%
Implementation difficulty
Implementation difficulty 22%
106 4