• [1333] Expression

  • 时间限制: 500 ms 内存限制: 65535 K
  • 问题描述
  • This problem's meaning is easy. Give you a infix expression, and you should convert it into postfix expression.

  • 输入
  • Input one infix expression a line. Expression will include brackets( '(', ')' ), integers(0 ~ 10), alphabets('a' ~'z', 'A' ~ 'Z') and simple operators('+', '-', '*' and '/').
  • 输出
  • Output every line‘s postfix expression in a line. And separate integers, alphabets and operators by ’ ‘.
  • 样例输入
  • (2 + 1)  * 3
    a+b*c-(d+e)
  • 样例输出
  • 2 1 + 3 *
    a b c * + d e + -
  • 提示
  • 来源
  • Minary
  • 操作

显示春菜