N-14

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


Sample Input




3
24 1
4358 754
305 794


Sample Output




34
1998

1

题意描述：

将两个数字反序之后相加，然后再将得到的和反序输出。

解题思路：

思路较为清晰，将两个数反序相加再将和反序输出即可。

解题细节：

注意时间限制，一开始将两个数字分别进行取反，再将结果取反，此时会出现时间超时。我们可以创建一个reverse函数，每个数调用完之后便成为反序，节省了运行时间。

代码：

#include<bits/stdc++.h>
using namespace std;
int reverse(int &c)
{
	int s=0;
	while(c!=0)
	{
		s=s*10+c%10;
		c/=10;
	}
	return s;
}
int main()
{
	int i,j,n,k;
	int a,b ,c;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a>>b;
		c=reverse (a)+reverse(b);
		cout<<reverse(c)<<endl;
	}
	return 0;
}
		
		

心得：

寻找简单方法解决问题。运用函数的调用，节省时间，提高程序的效率！