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).
t [the number of expressions <= 100] expression [length <= 400] [other expressions]
Text grouped in [ ] does not appear in the input file.
The expressions in RPN form, one per line.
Input: 3 (a+(b*c)) ((a+b)*(z+x)) ((a+t)*((b+(a+c))^(c+d))) Output: abc*+ ab+zx+* at+bac++cd+^*
Stack 101 AC in one go!!
as easy as stack can be :-P ....basic prob no issues !! already had the code :-) AC :-)
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.
but in my compiler its execution is normal
Last edit: 2016-05-31 10:52:21
Infix to Postfix
Priority rule implementation isn't necessary.
All operators have the same priority. Parentheses are always used, just like in the examples. Explanation should be clearer, because without parentheses and with different operator priority it is quite difficult.
ac in a go :P :P using string,string buffers are much better than creating a stack :D :D ...Java everywhere :P :P
its sayn size exceeded. what shud i do please suggest
|Added by:||Michał Małafiejski|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: NODEJS PERL 6 VB.net|