nyoj-103 A+B Problem II

描述

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 <iostream>
#include <cstdio>
#include <string.h>
using namespace std;

int main()
{
    int n;
    cin>>n;
    int k=1;
    while (n--)
    {
        char a[1000],b[1000];
        int c[1001]={0},d[1001]={0};
        int e[1001]={0};
        int n1,n2;
        int i,j,z=0;
        memset(c,0,sizeof(c));
        memset(d,0,sizeof(d));
        cin>>a>>b;
        n1 = strlen(a);
        n2 = strlen(b);
        int q = n1>n2?n1:n2;
        for (i=0,j=n1-1;i<n1;++i,j--)
        {
            c[i] = a[j]-'0';
        }
        for (i=0,j=n2-1;i<n2;++i,j--)
        {
            d[i] = b[j]-'0';
             //printf ("%d",d[i]);
        }
        for (i=0;i<q;i++)
        {
            e[i]=c[i]+d[i];
        }
        for (i=0;i<q;i++)
        {
            if (e[i]>=10)
            {
                e[i]-=10;
                e[i+1]++;
            }
        }
        printf ("Case %d:\n",k);
        printf ("%s + %s = ",a,b);
        for (i=1000;i>=0;i--)
        {
            if (e[i]==0&&z==0)
                continue;
            else
            {
                cout<<e[i];
                z=1;
            }

        }
        cout<<endl;
        k++;
    }
    return 0;
}