Aizu - ALDS1_3_A:Stack

Aizu - ALDS1_3_A:Stack

Description

Reverse Polish notation is a notation where every operator follows all of its operands. For example, an expression (1+2)*(5+4) in the conventional Polish notation can be represented as 1 2 + 5 4 + * in the Reverse Polish notation. One of advantages of the Reverse Polish notation is that it is parenthesis-free.

Write a program which reads an expression in the Reverse Polish notation and prints the computational result.

An expression in the Reverse Polish notation is calculated using a stack. To evaluate the expression, the program should read symbols in order. If the symbol is an operand, the corresponding value should be pushed into the stack. On the other hand, if the symbols is an operator, the program should pop two elements from the stack, perform the corresponding operations, then push the result in to the stack. The program should repeat this operations.

Input

An expression is given in a line. Two consequtive symbols (operand or operator) are separated by a space character.

You can assume that +, - and * are given as the operator and an operand is a positive integer less than 106

Output

Print the computational result in a line.

Sample Input

1 2 + 3 4 - *

Sample Output

-3

Hint

---

逆波兰表达式，即后缀表达式求值，思路简单，用栈即可，但是在输入输出上遇到障碍，一开始不明白如何同时处理数字和运算符，后来看书上用字符数组读入，atoi()函数可将字符串形式的数字转化为整型数值。

#include<stdio.h>
#include<stdlib.h>
int a[200];
int top = 0;
int push(int p)
{
	return a[top++] = p;
}
int pop()
{
	return a[--top];
}
int main()
{
	char s[10];
	int p1, p2;
	while (scanf("%s", s) != EOF)
	{
		if (s[0] == '+')
		{
			p1 = pop();
			p2 = pop();
			push(p1 + p2);
		}
		else if (s[0] == '-')
		{
			p1 = pop();
			p2 = pop();
			push(p2 - p1);
		}
		else if (s[0] == '*')
		{
			p1 = pop();
			p2 = pop();
			push(p1 * p2);
		}
		else
			push(atoi(s));
	}
	printf("%d\n", a[0]);
	return 0;
}