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
imshubhamk:
20160204 18:00:43
got ac :) in first attempt 0.02 s 2.8m giving some confidence


war1ock:
20160125 15:21:15
may be your ans has 0 at the last of output for some of the case so wrong ans is your o/p 

sai_manoj:
20160119 14:18:43
me too


rtcoder:
20160118 19:11:17
AC first go, time 0.07 yeahhh 

Thomas Dybdahl Ahle:
20160103 22:21:04
Mine got AC, when I stopped relying on there not being leading zeros in the input.


lalit_nit:
20160103 17:22:37
0.01 :) 

guruvamsi2015:
20151230 14:57:47
A/C 0.02 just had to put an endl


sanchiagarwal:
20151225 07:08:48
i dont know why my code is showing wrong answer? although its running perfectly fine on other compilers! 

guneet_1995:
20151222 17:37:30
AC :) thanks 

algo_aris:
20151209 15:58:24
Java  0,28 
Added by:  adrian 
Date:  20040606 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  ACM Central European Programming Contest, Prague 1998 