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).


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.


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.


Sample input: 
24 1
4358 754
305 794

Sample output:

hide comments
d_y1997: 2017-06-12 22:04:30

question is badly described .. since acccording to question , 3000 + 3000 = 6000 , but on googling solution i found 6 .....and I was trying by vector , it shows me runtime error ...don't know why? please help me by commenting

akshit_312: 2017-06-12 13:53:56

Can we do it from array?

Last edit: 2017-06-12 13:55:10
akhil_777: 2017-06-01 13:53:22

Comments are pretty messed up. I was using two scanner objects to take test case and the inputs which was the real cause of not getting accepted.
Things which wasted my time (Coding in java)
1. 1000 001 ==> 2 (End of discussion)
2. int is enough (no need of long, string or whatever. End of discussion)
3. Answer will still get accepted even if you don't have a try catch!
4. SPOJ don't have any problem with you using Scanner.

kocharee: 2017-05-29 13:21:30

ac in one go! :)

Last edit: 2017-05-29 14:28:59
piyushbharti: 2017-05-28 11:25:04

long long is sufficient for the problem ...
many wrong / misleading test case answers in comments ... read the problem statement only!!

ahayas485: 2017-05-25 15:54:53

adding 3000 and 3000
results in
guys please help

Last edit: 2017-05-25 15:55:18
aijaz_siddique: 2017-05-17 22:08:35

TIME: 0.02
MEM: 15M

ankush: 2017-05-07 18:04:20

ac in second go

do_phung967: 2017-05-05 13:17:28

Although, my code was running in and Visual studio , I got SIGSEGV error at these times i submitted . :(

mib314: 2017-04-25 10:48:34

got it

Last edit: 2017-04-25 10:51:35

Added by:adrian
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:ACM Central European Programming Contest, Prague 1998