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

hide comments
GeminiWen: 2014-02-05 04:08:04

Thanks to Saurabh_P
T-T

Aakash Chandrasekaran: 2013-12-28 14:23:21

shouldn't they give the maximum length of the input numbers ??

Saurabh_P: 2013-12-28 12:36:50

finally got AC :)
Try sample inputs plus
1
1000 001

ANS: 2

Last edit: 2013-12-28 12:38:25
Vyanktesh Kanungo: 2013-12-11 11:34:54

my output on ideone is coming right but here its showing wrong ans..help me!

Harsh: 2013-10-18 21:32:46

i ran the program in my compiler and an online gcc compiler too. It run well. But why not here?

GP: 2013-09-25 05:49:58

Hi this is my first program in SPOJ.
Its working properly in my Devc++ Ide. I am not able to get it running in SPOJ.
Here is the link for my code
<snip>

I am getting run time error. I dont know whether this is because of size of the array. For this problem I have kept it as A[10000][10000].

Last edit: 2022-09-27 21:56:48
Vikas: 2013-09-17 18:22:11

MY code IS running and giving correct output on my PC as well as on IDEONE.but on spoj it gives SIGSEGV.plz help

Mohit Gupta: 2013-09-07 08:01:59

hey i am getting the right answer for above example if i run my code on my pc but here it says wrong answer... can anyone tell what could be the problem

Miguel Angel Diaz: 2013-06-30 04:29:24

Timed myself... 10 minutes from opening this web page until Accepted. Hoorah~!

vignesh: 2013-06-25 12:53:14

It showing segmentation fault when compiling my c code for this problem. But for me showing correct output. What sholud i do?


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