## 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

All Submissions

Best Solutions

**Point Value:** 5

**Time Limit:** 2.00s

**Memory Limit:** 16M

**Added:** Apr 08, 2011

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

Danon Jul 25, 2012 - 2:29:44 am UTC Test Casebbi5291on Jul 25, 2012 - 7:07:33 am UTC Re: Test Casehelios26cppon Oct 05, 2013 - 4:53:21 am UTC Re: Test CaseAnd nobody else is ever on. Where should we ask questions?

bbi5291on Oct 18, 2013 - 9:39:25 pm UTC Re: Test CaseDanielMcIntoshon Nov 03, 2012 - 4:26:36 pm UTC Problem Codejargonon Nov 03, 2012 - 4:36:21 pm UTC Re: Problem CodeDmen555on Jul 07, 2012 - 3:25:44 am UTC no error when i manually try them..can u please send me the rest of the error msg :O

bbi5291on Jul 07, 2012 - 6:24:52 am UTC Re: no error when i manually try them..john_gobinon Apr 09, 2011 - 6:22:36 pm UTC Maximum #ilovepion Apr 09, 2011 - 7:17:19 pm UTC Re: Maximum #john_gobinon Apr 09, 2011 - 7:19:43 pm UTC Re: Re: Maximum #helios26on Apr 12, 2011 - 2:51:20 am UTC Re: Re: Maximum #Niemaon Apr 08, 2011 - 10:28:25 pm UTC can sm1 pls tell me y my solution doesnt work?bbi5291on Apr 09, 2011 - 2:27:06 am UTC Re: can sm1 pls tell me y my solution doesnt work?helios26on Apr 09, 2011 - 3:44:36 pm UTC Re: Re: can sm1 pls tell me y my solution doesnt work?ilovepion Apr 09, 2011 - 6:01:42 pm UTC Re: Re: can sm1 pls tell me y my solution doesnt work?