《ACM 书中题目》 N

• 题目

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

• 理解思路
  输入一对数据，分别把两数到过来再相加，最后再把结果倒过来。

  把一个数倒过来由调用函数实现，减少代码量，要注意倒序过程中首位为零的情况。

• AC代码

#include<bits/stdc++.h>
using namespace std;
int rev(int x)
{
    int result = 0;
    int reminder;
    int negative = 1;
    if(x<0)
    {
        x=-x;
        negative=-1;
    }
    while(x%10>=0&&x>0)
    {
        reminder=x%10;
        result=result*10+reminder;
        x=(int)x/10;
    }
    result*=negative;
    return result;
}
int main()
{
    int i,j,k,n,m;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>j;
        cin>>k;
        m=rev(rev(j)+rev(k));
        cout<<m<<endl;
    }
}

• 总结
  刚开始在被调函数内使用pow()函数

for(i=0;i<s.size();i++)
    {
        sum+=s[i]*pow(10,j-1);
        j--;
    }

发现因为对pow()函数的参数把握不准出现奇数位数字倒序后总是比实际结果少1的情况，于是改用AC代码中的方法。