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
pfiesteria: 2012-03-25 03:00:00

I want to ask:
1*1000
____1
*1000
-----
____0
___0
__0
_1
_----
_1000

or more dashes:

1*1000
____1
*1000
-----
____0
___0
__0
_1
-----
_1000

Last edit: 2012-03-25 03:00:00
Janani: 2012-03-18 03:23:10

Last edit: 2012-03-18 03:24:03
Janani: 2012-03-18 03:22:10

are we to assume that the operands have the same number of digits in both addition and subtraction cases?

Vishal Gautam: 2012-02-28 14:55:58

can any one give me any strong test cases.i have been trying to solve this problem but i couldn't get it accepted.
please help
gratitude for help

Alexander Pelekhan: 2012-02-19 18:43:37

To previous commentators: The problem clearly states that the input numbers are positive (i.e. greater than 0). So there are no any test cases like 999*0, 0*1293, etc.

arya eka: 2012-01-25 20:07:20

why did i still can't solve this? i tried my code at netbeans and ideone and it really worked but why not here?

iamrock: 2012-01-08 07:31:50

y do i get SIGSEGV error? wat does it mean.?
my code works well on my computer though

Klaus: 2012-01-02 19:24:24

The length of the line with '-' signs is not well described. Look for the comment of Cloud or :D

Last edit: 2012-01-02 19:24:34
B Rabatin: 2011-12-16 19:42:06

Could you please check ID 6194251, I can't figure out, what's wrong, still getting Compilation Error, it's ok on my compilator...

Now it's okay, but the problem is NZEC, could Pascal int64 handle larger inputs?

Last edit: 2011-12-16 21:20:12
Jitesh: 2011-11-08 08:15:49

for a case like:
0*1293

____0
*1293
-----
____0
___0
__0
_0
-----
____0
should this be the o/p or simply:
____0
*1293
-----
____0


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