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
mhto:
2016-11-21 18:32:28
woohoo... AC in one go :D |
|
aronzx:
2016-10-30 07:54:50
Good Problem ! AC in 1 go . #ff0000. However there is no use of priority given over here. Last edit: 2016-10-30 07:55:17 |
|
asgupta_spoj:
2016-10-26 21:40:24
the expression is surely a full bracket expression.. |
|
vedantlodha:
2016-10-13 16:14:57
my code is compiling and running fine on codeblocks but showing a compilation error.Whats the problem?Im new to spoj |
|
adi_pra:
2016-10-10 11:33:29
go for shunting yard algorithm , but watch some vedio on it also . Try to implement your own code , dont
|
|
ace_cocytus:
2016-09-26 10:40:14
The expression is always full brackets (If not, I wont get AC). |
|
hsuyaihtar:
2016-09-03 11:01:03
The description given in problem is very less, read about RPN before attempting. |
|
mr_pudin:
2016-08-27 05:33:20
Solvable with string although stack is easier.
|
|
manojd929:
2016-08-25 12:43:44
getting wrong answer here . although i got correct answers for all test cases |
|
gutsav:
2016-08-13 21:46:58
AC one go whooo hooo :D |
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: | - |