POJ-1504 Adding Reversed Numbers-逆序数相加

最新推荐文章于 2015-10-07 23:03:13 发布

kewlgrl

最新推荐文章于 2015-10-07 23:03:13 发布

阅读量801

点赞数 1

分类专栏： POJ 初级计划文章标签： C++ POJ

本文链接：https://blog.csdn.net/MIKASA3/article/details/47699623

版权

POJ 初级计划专栏收录该内容

179 篇文章 0 订阅

订阅专栏

Adding Reversed Numbers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 16286		Accepted: 8915

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

Sample Output

34
1998
1

Source

Central Europe 1998

/*    
*Copyright (c)2015,烟台大学计算机与控制工程学院    
*All rights reserved.      
*作    者：单昕昕    
*完成日期：2015年8月16日    
*版 本 号：v1.0        
*/
#include <iostream>
using namespace std;
long long reverse(long long num)
{
    long long ans = 0;
    while(num>0)
    {
        ans = ans*10 + num%10;
        num = num/10;
    }
    return ans;
}
int main()
{
    int t,ans,m,n;
    long long a,b;
    cin>>t;
    while(t--)
    {
        cin>>a>>b;
        m=reverse(a);
        n=reverse(b);
        ans=reverse(m+n);
        cout<<ans<<endl;
    }
    return 0;
}

这个书上是要求用高精度运算，但是long long碰巧也能测试过了~