ARITH - Simple Arithmetics

no tags 

One part of the new WAP portal is also a calculator computing expressions with very long numbers. To make the output look better, the result is formated the same way as is it usually used with manual calculations.

Your task is to write the core part of this calculator. Given two numbers and the requested operation, you are to compute the result and print it in the form specified below. With addition and subtraction, the numbers are written below each other. Multiplication is a little bit more complex: first of all, we make a partial result for every digit of one of the numbers, and then sum the results together.

Input

There is a single positive integer T on the first line of input (equal to about 1000). It stands for the number of expressions to follow. Each expression consists of a single line containing a positive integer number, an operator (one of +, - and *) and the second positive integer number. Every number has at most 500 digits. There are no spaces on the line. If the operation is subtraction, the second number is always lower than the first one. No number will begin with zero.

Output

For each expression, print two lines with two given numbers, the second number below the first one, last digits (representing unities) must be aligned in the same column. Put the operator right in front of the first digit of the second number. After the second number, there must be a horizontal line made of dashes (-).

For each addition or subtraction, put the result right below the horizontal line, with last digit aligned to the last digit of both operands.

For each multiplication, multiply the first number by each digit of the second number. Put the partial results one below the other, starting with the product of the last digit of the second number. Each partial result should be aligned with the corresponding digit. That means the last digit of the partial product must be in the same column as the digit of the second number. No product may begin with any additional zeros. If a particular digit is zero, the product has exactly one digit -- zero. If the second number has more than one digit, print another horizontal line under the partial results, and then print the sum of them.

There must be minimal number of spaces on the beginning of lines, with respect to other constraints. The horizontal line is always as long as necessary to reach the left and right end of both numbers (and operators) directly below and above it. That means it begins in the same column where the leftmost digit or operator of that two lines (one below and one above) is. It ends in the column where is the rightmost digit of that two numbers. The line can be neither longer nor shorter than specified.

Print one blank line after each test case, including the last one.

Example

Sample Input:

4
12345+67890
324-111
325*4405
1234*4

Sample Output:

 12345
+67890
------
 80235

 324
-111
----
 213

    325
  *4405
  -----
   1625
     0
 1300
1300
-------
1431625

1234
  *4
----
4936
Warning: large Input/Output data, be careful with certain languages.

hide comments
masoud: 2020-05-27 02:41:28

This should be pinned:

badasshackme: 2018-04-05 02:16:22

Dude, who originally posted critical input

http://contest.felk.cvut.cz/00cerc/solved/arith.in
http://contest.felk.cvut.cz/00cerc/solved/arith.out

Bless you God! I have no clue how this problem authors expected us to catch case

123451234567890
*99
----------------
1111061111111010
1111061111111010
-----------------
12221672222221110

(amount of first dashes must be same as length of first intermediate value)

cooldude69: 2020-04-13 22:34:28

how to store 500 digit number??

presnelberg: 2020-03-20 16:19:08

Don't waste your time on this problem. Idea is absolutely trivial but implementation would be a little bit harder. Alas, it's very hard and timewasting, because given description of the problem is unclear. It says too few information about an amount of dashes and to everyone's horror - given sample input and output is misleading in this matter. Finally did this but I must have guessed how dashes should work and it cost me a lot of time - wasted time.

mktr: 2020-01-08 08:18:09

in case 9000*99 is this correct?
9000
__*99
----- <- number of dashes equals number of digits in 81000 (not 9000)
81000
...

petr_ivashkov: 2019-12-30 20:03:27

Does anyone have a good big crush test with specific inputs?
Getting "wrong answer" all the time and cant figure out, where the problem is :(

king_rohan12: 2019-10-30 08:38:17

i have tried for all test cases and it showing appropriate result (including above testcases given in comment) but still its giving WA(wrong answer)is there necessary to leave one horizontal space from left side before printing the number?

Bo MA: 2019-10-24 14:41:53

I also missed this one:
100000000000000000
-1
-----------------
99999999999999999

Last edit: 2019-10-24 14:59:56
princebilly: 2019-10-03 21:48:16

took me 2 days and 3 WA to solve it. 210 line of c++ code.
the number of dashes will be = max(above_number_len_including_sign, below_line_len)
used string for input and int array for calculation output and loops loops loops -_-

chazshiz: 2019-10-02 12:34:23

try this case:
6
1*12345
99999*90
12345*1
90*999909
100000000000000000-1
1000*65

eg: a*b=r
the first horizontal line should compare the length of one below and one above, the second horizontal line just compare [b] and [r]. the first one may not exist.

Last edit: 2019-10-02 12:39:39
neerajamoniya: 2019-08-22 08:57:49

please post some tricky test cases


Added by:adrian
Date:2004-05-08
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:ACM Central European Programming Contest, Prague 2000