Strange_addition.cpp

/*
HackerMan has a message that he has coded in form of digits, which means that the message contains only numbers and nothing else. He is fearful that the enemy may get their hands on the secret message and may decode it. HackerMan already knows the message by heart and he can simply destroy it.
But he wants to keep it incase its needed in a worse situation. He wants to further encode the message in such a format which is not completely reversible. This way if enemies gets hold of the message they will not be completely able to decode the message.
Since the message consists only of number he decides to flip the numbers. The first digit becomes last and vice versa. For example, if there is 3769 in the code, it becomes 9673 now. All the leading zeros are omitted e.g. 15900 gives 951. So this way the encoding can not completely be deciphered and has some loss of information.
HackerMan is further thinking of complicating the process and he needs your help. He decides to add the two flipped numbers and print the result in the encoded (flipped) form. There is one problem in this method though. For example, 134 could be 431, 4310 or 43100 before reversing. Hence the method ensures that no zeros were lost, that is it can be assumed that the original number was 431.
Input
The input consists of T test cases. The first line of the input contains only positive integer T. Then follow the cases. Each case consists of exactly one line with two positive integers separated by space. These are the flipped numbers you are to add.

Output

For each case, print exactly one line containing only one integer – the flipped sum of two flipped numbers.

Constraints

The value of T will be less than 1000
The value of digits will be less than 500000

Sample Input
3
353 575
238746 39857
890 231


Sample Output

829
527327
32

Explanation
There are 3 test cases in the sample input. Following it are three lines that contains two numbers each, so the output also contains three lines that contain the reverse of the sum of the two reversed numbers.
 Question Link: https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/the-reversed-numbers/
*/
#include <bits/stdc++.h>
using namespace std;
string find(long int n1, long int n2)
{
    //first lets convert n1 and n2 to string so its easier to reverse
    string num1 = to_string(n1);
    string num2 = to_string(n2);
    //here we reverse the srtring
    reverse(num1.begin(), num1.end());
    reverse(num2.begin(), num2.end());
    //now reversed num1 and num2 we are converting back to int so that we can sum the reversed number, sum and again convert back to string for easy reversing
    string num_sum  = to_string(int(stoi(num1) + stoi(num2)));
    //again reverse the result too
    reverse(num_sum.begin(), num_sum.end());
    //chances are there the final result may contain leading zeros like in test case 3 so remove the leading zeros
    num_sum.erase(0, num_sum.find_first_not_of('0'));
    return num_sum;
    
}
int main()
{
    int tc;
    cin>>tc;
    long int n1, n2;
    while(tc--)
    {
        cin>>n1>>n2;
        cout<<find(n1,n2)<<endl;
    }
    return 0;
}