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+^*
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
any trick in redaing data from stdin i am looking for'\n' string to finish .Geting segmentation fault while reading dataLast edit: 2016-05-08 12:06:52
done (y)Last edit: 2016-04-18 16:55:21
Reverse Polish Notation is such:
at last....feeling relaxed
Didn't leave a line after printing output for different test cases... Got stuck for more than an hour... Tragedy of Coding xD
|Added by:||Michał Małafiejski|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: NODEJS PERL 6 VB.net|