HDU 1002 大数相加

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 432792    Accepted Submission(s): 84254

 

Problem Description

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

 

 

Input

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.

 

 

Output

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. Output a blank line between two test cases.

 

 

Sample Input

2

1 2

112233445566778899 998877665544332211

 

 

Sample Output

Case 1: 1 + 2 = 3

Case 2: 112233445566778899 + 998877665544332211 = 1111111111111111110

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    int T,flag=0;
    cin>>T;
    while(T--)
    {
        int a[1006],b[1006],c[1006],k;
        int q,h1=0,h2=0;
        string s1,s2;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        memset(c,0,sizeof(c));
        cin>>s1;
        cin>>s2;
        for(int i=s1.length()-1; i>=0; i--)
            a[h1++]=s1[i]-'0';
        for(int j=s2.length()-1; j>=0; j--)
            b[h2++]=s2[j]-'0';
        for(int i=0; i<=max(s1.length(),s2.length())-1; i++)
        {
            c[i]=a[i]+b[i];
        }
        for(int i=0; i<=max(s1.length(),s2.length())-1; i++)
        {
            if(c[i]>=10)
            {
                c[i+1]++;
                c[i]-=10;
            }
        }
        printf("Case %d:\n",++flag);
        cout<<s1<<" "<<"+"<<" "<<s2<<" = ";
        for(k=1005; k>0; k--)
        {
            if(c[k]==0)
            {
                continue;
            }
            else break;
        }
        for(; k>=0; k--)
            cout<<c[k];
        cout<<endl;
        if(T)
            cout<<endl;
    }
    return 0;
}