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.


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.


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.


Sample Input:


Sample Output:




Warning: large Input/Output data, be careful with certain languages.

hide comments
newb: 2017-07-30 21:53:52

Thanks Vladmir, for the test cases. They helped me catch corner cases. Finally got accepted after 10+ hours of work.

newb: 2017-07-29 13:12:59

Last edit: 2017-07-29 13:28:57
amrit1101: 2017-07-20 16:21:23

Why is the alignment of dashes before the output different in the examples provided here and the one posted by anonymous (
For eg:

Which one should it be?

Last edit: 2017-07-20 16:30:33
kotal_kahn: 2017-07-19 20:23:10

how the dashes would be aligned if

newb: 2017-07-04 21:40:47

Can I read input and print output one by one or am I supposed to read everything at once and print the output ?

azazello_: 2017-06-23 12:34:16

So I finally got an AC after 20+ hours of work as a beginner.

First and foremost: use the links @vladimira provided below to check your output.

The bottleneck for me was somewhat idiotic.
Instead of using Space (ASCII 32) for the blanks I used NUL(ASCII 0).
The resulting output was identical. Even diffchecker said so!
It wasn't until I compared outputs in Notepad++ that I noticed the problem.

(I do remember having perfect output for all cases, but 99+2 still not being correct. So you might want to check that as well. )

Using only your own test cases on this one is risky since there are quite a few edge case scenarios (depending on your algorithm).

arvind_1995: 2017-05-26 13:45:30

I tried several test cases including links posted by anonymous. I used diffchecker and the results matches. But still spoj shows wrong answer and it stops at time 0.04. kindly help i have been trying for the past two days.

Last edit: 2017-05-26 13:46:01
labatphan: 2017-05-20 16:44:35

Giup minh bai nay voi ko biet lam ntn :)))

heptapod: 2017-04-20 15:05:54

Thank you so much for your testcases @anonymous. Helped a lot. finally accepted.

losers111isme: 2017-03-31 20:54:17

NOTE: The dashed line is as long as the longest of the line above it and the line below it.

Added by:adrian
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