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
nemocptn3m0:
20180605 09:35:23
AC in one go...my 50th :) 

avy_15:
20180522 16:50:40
AC in one go xD 

eagleshadow:
20180519 15:41:14
first time AC in one go :P 

brain_sick:
20180517 12:32:30
ac in 1 go


byte_rider12:
20180429 06:51:37
My program is running for the given test case in ideone but its is showing WA . What could be the possible problem? 

sky_scraper:
20180330 16:44:56
using string stream class is the probably the best way to solve this problem check out the geeks for geeks articles related to string stream class .


rishabh6021:
20180206 13:13:17
@firoda the answer 43 is to be reversed again 

firoda:
20180130 19:36:50
if the input is 24 1 then reverse would be 42 and 1 which adds up to 43 so why sample output showing 34??


srihari_v:
20171230 22:22:12
no sieve is need and got ac 

kilojewels:
20171205 21:02:18
why the frick is it saying i am wrong when i am getting the right answer

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 