[UVA] 713 - Adding Reversed Numbers＠Morris' Blog｜PChome Online 人新台

Morris' Blog 我在摸索我存在的意、生命的意、涵及值。有真正神手般的害，套用模式是大部分的情。那害的我存在的意何，托出神的存在？有候不能怪人不我，我已始省思，什我有人的原因，而是全要靠人。有候我我不同，那是因我做不到很多人能到的事情。我不到、玩不起、得不明、理解得不多，我缺少的文能力，就是一切一切能的判定。此，我不得能做些人有助的事情。我知道我自己是不服的性格，但在我不得不。我有能力，因此我必。我到底世界作什？充不定性，而我是法出拔萃，想一般人似乎也回不了了。越大的挑需要越力的支持，而我的支持是什？最近人，但都是失的局，人能接受，不需要言，不需要通，一切所想都表不出。
49的鼓 6站台

2012-06-22 12:59:44| 人878| 回0 | 上一篇 | 下一篇

[UVA] 713 - Adding Reversed Numbers

推 0 收藏 0 0 站台

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

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. Numbers will be at most 200 characters long.

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

#include <stdio.h>
#include <string.h>

int main() {
    int t, i, j;
    char a[300], b[300];
    scanf("%d", &t);
    while(t--) {
        scanf("%s %s", a, b);
        int lenA = strlen(a), lenB = strlen(b);
        int sum[300] = {};
        for(i = 0; i < lenA; i++)
            sum[i] += a[i]-'0';
        for(i = 0; i < lenB; i++)
            sum[i] += b[i]-'0';
        int lenC = lenA > lenB ? lenA : lenB;
        for(j = 0; j <= lenC+1; j++) {
            sum[j+1] += sum[j]/10;
            sum[j] %= 10;
        }
        for(j = lenC+1; j >= 0; j--) {
            if(sum[j])
                break;
        }
        if(j < 0)   j++;
        i = 0;
        while(sum[i] == 0) i++;
        while(i <= j)
            printf("%d", sum[i++]);
        puts("");
    }
    return 0;
}