ADDREV - Adding Reversed Numbers

The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure some tragedies into comedies. Obviously, this work is very hard because the basic sense of the play must be kept intact, although all the things change to their opposites. For example the numbers: if any number appears in the tragedy, it must be converted to its reversed form before being accepted into the comedy play.

Reversed number is a number written in Arabic numerals but the order of digits is reversed. The first digit becomes last and vice versa. For example, if the main hero had 1245 strawberries in the tragedy, he has 5421 of them now. Note that all the leading zeros are omitted. That means if the number ends with a zero, the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has any trailing zeros.

ACM needs to calculate with reversed numbers. Your task is to add two reversed numbers and output their reversed sum. Of course, the result is not unique because any particular number is a reversed form of several numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros were lost by reversing (e.g. assume that the original number was 12).

Input

The input consists of N cases (equal to about 10000). The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line with two positive integers separated by space. These are the reversed numbers you are to add.

Output

For each case, print exactly one line containing only one integer - the reversed sum of two reversed numbers. Omit any leading zeros in the output.

Example

Sample input: 
3
24 1
4358 754
305 794

Sample output:
34
1998
1

Added by:adrian
Date:2004-06-06
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:ACM Central European Programming Contest, Prague 1998

hide comments
2013-04-15 15:54:33 vickki
hi what is the output for input like
1000 001 ? help me !!

Last edit: 2010-11-26 07:35:05
2013-04-15 15:54:33 Mario Ray Mahardhika
OK, this leading-trailing zeros really makes the problem difficult to solve (for those problem description skimmers like me)
2013-04-15 15:54:33 Aditya Arora
Hey guys, help me on this.... if input is 001 or 01 or 1, then reversed num has to be 1 fr the three cases, ryt ???
2013-04-15 15:54:33 Phạm Ðình Ðức
mine is wrong. I can't understand why. I used C++. How to submit?
2013-04-15 15:54:33 sujila nair
hi..need help..is thr any limit on the size of input?

its throwing runtime error : SIGSEGV. the program was running correctly while i was trying in local unix

Last edit: 2010-10-04 17:44:22
2013-04-15 15:54:33 vishrut patel
does it matter if my input isnt in one line?
2013-04-15 15:54:33 skard


Last edit: 2010-10-02 18:19:21
2013-04-15 15:54:33 rajasekar
hi what is SIGSEGV error
i got all the things correct except this error could any one help me

RE: SIGSEGV means your program is accessing array index out of bound. Say, you have a[100], your program is trying to access a[105] or a[-105] - that's SIGSEGV.

Last edit: 2010-09-04 22:53:55
2013-04-15 15:54:33 Jessica Thomas
@pranav you are not suppose to leave any space (before or after input)
2013-04-15 15:54:33 Krzysztof Kosiñski
This is best done by using BCD arithmetic on strings. Conversion to binary integers and then addition is too slow. With BCD you can go down to 0.01s.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.