ARITH2  Simple Arithmetics II
While browsing aimlessly, Peter stumbled upon an old riddle he used to solve on his calculator when he was still young. It was the kind of a riddle where you punch in a bunch of numbers and operators into a simple pocket calculator and then turn it upside down to get the answer:
These come in many different sizes but they are always exactly one foot long. Answer: 103 * 103 * 5.
What are made of ice to keep people warm? Answer: 50 * 40 * 250 + 791.
After a few minutes he found a large amount of such riddles and full of excitement he went to solve them. He turned his computer screen upside down...
... only to find out that he does not have a reasonable calculator program installed on his computer.
Problem specification
You are given multiple sequences of button presses of a simple pocket calculator that consist of digits and arithmetic operators. For each such sequence find the number it would produce on a pocket calculator's display.
Note that the pocket calculator evaluates the operators in the order in which they are given. (i.e., there is no operator precedence.) Assume that the display of the calculator is large enough to show the result, and that its memory is sufficient to store all intermediate results.
Input specification
The first line of the input file contains an integer T specifying the number of test cases. Each test case is preceded by a blank line.
Each test case represents one sequence of button presses for a pocket calculator. The sequence consists of nonnegative integers and arithmetic operators and ends with an equal sign. It may also contain spaces to improve readability.
The operator / represents integer division, rounded down. You may assume that no test case contains division by zero and that in all test cases all intermediate results are nonnegative.
Tip: long long int in C/C++, long in Java or int64 in Pascal is enough for this problem.
Output specification
For each sequence from the input file output the number that would be displayed on the calculator.
Example
Input: 4 1 + 1 * 2 = 29 / 5 = 103 * 103 * 5 = 50 * 40 * 250 + 791 = Output: 4 5 53045 500791
Hint
The first test case shows that there is no operator precedence.
The second one shows that integer division always rounds down.
The last two outputs are the answers to the two riddles in the problem statement: "shoes" (53045 upside down), and "igloos"(500791 upside down).
hide comments
Chirag Agrawal:
20140530 22:28:28
AC in first GO :) 

à¤®à¥‹à¤¹à¤¨:
20140516 12:22:55
AC in one go :D...my 22nd 

Mitch Schwartz:
20140503 04:54:56
@rishikeshwar: Ok, I also hid my previous comment then. Points calculation is explained at the bottom of user ranking pages: for classical problems, it is 80/(40+n) where n is the number of solvers of that problem; in this case, less than 0.03 points. 

rishikeshwar:
20140503 03:25:50
sorry for that ... :( i am deleting my comment ... once again sorry @mitch .. but i have a doubt.. i dint get any points for solving this question ... may i know why .. thanks in advance Last edit: 20140503 03:27:44 

who cares:
20140430 21:48:33
woow!!! 

fanatique:
20140416 20:17:50
used Conditional (or Ternary) Operator (?:) in c++...AC..25th classic.. Last edit: 20140416 20:20:38 

odysseus:
20140223 22:41:01
for all tle, don't use fflush(stdin) incase you are using. Also for wrong answers, try not to mix cin>> with geline(cin,string) 

Praneeth :
20140120 18:34:02
Ac :) 

Arjun Verma:
20140109 23:16:51
@Himanshu Kumar Sahu : thanks

Added by:  Fudan University Problem Setters 
Date:  20090531 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO NODEJS PERL6 
Resource:  IPSC 2009 