Sphere Online Judge

Computer geeks! Show off your skills and claim the job of your dreams! RecruitCoders.com

SPOJ Problem Set (classical)

42. Adding Reversed Numbers

Problem code: ADDREV

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 Kosowski
Date:2004-06-06
Time limit:5s
Source limit:50000B
Languages:All
Resource:ACM Central European Programming Contest, Prague 1998

hide comments
2012-05-13 11:29:26 Rohit
http://ideone.com/bURpM
Show wrong ans on submitting.
2012-04-12 13:27:14 Raghvendra Singh
@ TATHA PAVAN NAGARJU WHICH \n are you talking about
2012-04-05 12:19:56 Ishom Muhammad Drehem
wow
2012-03-22 17:31:17 abhishek yadav
watch this...
http://ideone.com/hF5dh
it's giving out right output yet showing
runtime error....???can some1 help it's working fine on DEV C++??


Last edit: 2012-03-22 17:38:56
2011-10-10 20:24:25 Nishant Dania
check out the code at http://ideone.com/Lrszu...its working fine on some other compiler but not here
2011-10-03 20:49:45 Jairo Varela
ashish

just change reverse for Main
spoj only recognize that primary class

care main different Main, and thats it
gl
2011-09-23 12:56:50 ashish
check out this code http://ideone.com/JoOTv
everythings fine on my system ..... when submitted gives compilation error .... do help
2011-09-22 05:33:22 Alex
NZEC error with integer and all ok with Int64
2011-09-11 11:05:44 THATHA PAVAN NAGARAJU
marvelous question.if \n was not given it was showing error
2011-07-25 11:05:47 stranger
you should give info. about range of integer
SPOJ System © 2012 Sphere Research Labs | Projekty informatyczne i aplikacje na zamówienie. All Rights Reserved.