Time Limit: Java: 2000 ms / Others: 2000 ms
Memory Limit: Java: 65536 KB / Others: 65536 KB
You have typed the report of your term project in your personal computer. There
are several one line arithmetic expressions in your report. There is no redundant
parentheses in the expressions (omitting a pair of redundant matching parentheses
does not change the value of the expression). In your absence, your little brother
inserts some redundant matching parentheses in the expressions of your report.
Assume that the expressions remain syntactically correct and evaluate to their
original value (the value before inserting redundant parentheses). To restore
your report to its original form, you are to write a program to omit all redundant
To make life easier, consider the following simplifying assumptions:
1. The input file contains a number of expressions, each in one separate line.
2. Variables in the expressions are only single uppercase letters.
3. Operators in the expressions are only binary '+' and binary '-'.
Note that the only transformation allowed is omission of redundant parentheses, and no algebraic simplification is allowed.