HDU 1002 A + B Problem II（大数加法）

A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 426436 Accepted Submission(s): 82818

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

Author
Ignatius.L

Recommend
We have carefully selected several similar problems for you: 1004 1003 1008 1005 1093

#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    char num[2][1001];
    int a[2][1001];
    int cnt[2];
    int sum[1005];
    int t;
    int k=0;
    scanf("%d",&t);
    while(t--)
    {
        k++;
        memset(num,0,sizeof(num));
        memset(a,0,sizeof(a));
        for(int i=0;i<2;i++)//将字符转换为数字并倒叙放入数组
        {
            scanf("%s",num[i]);
            int len=strlen(num[i]);
            cnt[i]=0;
            for(int j=len-1;j>=0;j--)
                a[i][cnt[i]++]=num[i][j]-'0';
        }
        memset(sum,0,sizeof(sum));
        for(int i=0;i<2;i++)//计算
        {
            for(int j=0;j<cnt[i];j++)
            {
                sum[j]+=a[i][j];
                if(sum[j]>=10)//两个小于10的数相加不大于20
                {
                    sum[j]=sum[j]-10;
                    sum[j+1]++;
                }
            }
        }
        int i;
        for( i=1000;i>0;i--)//结果输出
            if(sum[i])
            break;
        if(k!=1) ///注意格式输出
            printf("\n");
        printf("Case %d:\n",k);
        printf("%s + %s = ",num[0],num[1]);///空格
        for(int j=i;j>=0;j--)
            printf("%d",sum[j]);
        printf("\n");
    }
}