Postfix Notation

View as PDF
Submit solution
Points: 7
Time limit: 1.4s
Memory limit: 64M
Author:
Xyene
Problem types

We are familiar with infix notation for representing expressions, where the operator is placed infix between the operands, as in 5 * 5. Given an expression in postfix notation, such as 5 5 *, evaluate the expression and print it to standard output, rounded to one decimal place.

Valid operands are * (multiplication), / (division), + (addition), - (subtraction), % (mod), and ^ (exponentiation).

Input Specification

A valid postfix expression. The input will have no more than 50 characters, and the value of each number in the input and each intermediate result will be less than or equal to 1000.

Output Specification

The result of the evaluation. The answer will be considered correct if its absolute or relative error does not exceed 10^{-1}.

Sample Input 1

5 5 +

Sample Output 1

10.0

Sample Input 2

5 5 + 6 * 8 -

Sample Output 2

52.0

Comments


  • 7
    rnpmat08  commented on July 29, 2022, 12:38 p.m.

    DMOJ should really show us the input they used so that way it's must faster and time-saving to change the code


  • 2
    rnpmat08  commented on July 29, 2022, 2:46 a.m.

    Anyone know the input for Test Case #3? I'm failing that test case.


  • 1
    anasschoukri2  commented on Aug. 25, 2017, 3:23 p.m.

    input

    what is the type of numbers in input ??


    • 1
      Pleedoh  commented on Aug. 25, 2017, 4:41 p.m.

      Just use floating point


  • 108
    quantum  commented on Sept. 14, 2014, 12:59 a.m. ← edit 2

    Reverse Polish Sausage.