The program reads from standard input an expression written in postfix notation (also known as Reverse Polish Notation or RPN). In this notation, the operator is written after its two operands, and tokens are separated by single spaces.
For example, the infix expression (10 - 2) 3 is written in postfix as 10 2 - 3 .
The program evaluates the expression and prints its value. Supported operators are +, -, *, and / (integer division, as in C++).
The program reads from standard input a single line containing the postfix expression. Numbers are non-negative integers (at most 9 digits) and are separated from operators by spaces. - The expression is well-formed; no division by zero occurs. - The number of tokens is at most 200. - All intermediate values and the result fit in `long long`. - For a binary operator `op`, the two tokens at the top of the stack are its operands: the first popped is the right operand.
The program prints to standard output a single integer: the value of the expression.
2 3 4 * +
14
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
2 3 4 * +
14
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
