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
nrl 7:
2014-10-02 10:10:47
It seems all the test cases have brackets. Hence you can keep priority of + and - same or different, it wont matter. |
|
Gaurav Ahirwar:
2014-08-22 08:53:47
Xtremely Simple logic! ..just give it a try! :) |
|
Emanuele Paolini:
2014-08-21 14:57:49
I think that for clarification the expression a-b+c-d should be added to the examples. Priority of operators is not shown in any example. |
|
Shatha Abu Hashem:
2014-01-28 10:02:35
Ugh .. I Just cannot find the algorithm .. it drives me crazy |
|
Bowen:
2013-12-25 17:54:00
"+, -, *, /, ^ (priority from the lowest to the highest)"
|
|
Duan Yichao:
2013-12-12 07:55:21
Write some more expressions yourself and try. |
|
Mayank Raj:
2013-08-28 19:54:59
Actually everything is bracketed...I coded to look only for the braces!! |
|
Franz Matejka:
2013-08-06 08:24:01
Suggestion: Add to problem statement that the algorithm just needs to work with fully bracketed expressions. |
|
(Tjandra Satria Gunawan)(曾毅昆):
2013-07-09 18:19:53
0.05s in Brainf**k ;-) |
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: | - |