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.




hide comments
kira28: 2017-01-11 11:46:17

Very weak testcases :/
Even a wrong code of mine was accepted.... xD xD xD

psiphon_exe: 2017-01-06 10:53:13

Stacks stl

scorpion_ajay: 2016-12-23 08:09:33

@sheeteyash AC means answer corrected, i.e., your solution is accepted :P
after too many wrong answers, and wastage of 1 day, finally got AC. :)

sheteyash: 2016-12-19 10:38:51

ye AC kya hota hain???

soodan: 2016-12-17 11:54:56

use stacks period.

kira28: 2016-12-15 21:07:41

AC!!! in c++-->0.0sec
my first stack problem

manee1211: 2016-12-15 18:44:39

yo AC in one GO

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..

Added by:mima
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL 6 VB.net

Problem's scores 1 vote

Concept difficulty
Concept difficulty 21%
Implementation difficulty
Implementation difficulty 19%
74 3