NYOJ 880 A+B Problem II（大数加法）

A+B Problem II

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 3

描述

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

A,B must be positive.

输入

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.

输出

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation.

样例输入

2
1 2
112233445566778899 998877665544332211

样例输出

Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110

 
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
char a[1001],b[1001];
int s[2001],aa[1001],bb[1001];
#define max(a,b) a>b?a:b
int main()
{
    int t;
    scanf("%d",&t);
    for(int p=1; p<=t; p++)
    {
        scanf("%s%s",a,b);
        int la=strlen(a);
        int lb=strlen(b);
        memset(aa,0,sizeof(aa));
        memset(bb,0,sizeof(bb));
        memset(s,0,sizeof(s));
        for(int i=0; i<la; i++)
        {
            aa[la-1-i]=a[i]-'0';
        }
        for(int i=0; i<lb; i++)
        {
            bb[lb-1-i]=b[i]-'0';
        }
        int lmax=max(la,lb);
        int ans=0;
        for(int i=0; i<=lmax-1; i++)
        {
            s[i]=(aa[i]+bb[i]+ans)%10;
            ans=(aa[i]+bb[i]+ans)/10;
            //s[i]=s[i]%10;
        }
        printf("Case %d:\n%s + %s = ",p,a,b);
        if(ans>0)
        {
            printf("1");
        }
        for(int i=lmax-1; i>=0; i--)
        {
            printf("%d",s[i]);
        }
        printf("\n");
    }
}