HDU 1002 - A + B Problem II (大数相加)

最新推荐文章于 2020-04-08 15:46:34 发布

Freenm

最新推荐文章于 2020-04-08 15:46:34 发布

阅读量341

点赞数

分类专栏： ACM - 其他

本文链接：https://blog.csdn.net/Freenm/article/details/56020130

版权

ACM - 其他专栏收录该内容

14 篇文章 0 订阅

订阅专栏

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<stdio.h>
#include<string.h>
#define max(a,b) ((a>b)?a:b) 
int main()
{
    char ta[5001],tb[5001];
    int a[5001],b[5001],sum[5002],n,t,i,lena,lenb,lenmax;
    scanf("%d",&n);
    for (t=1;t<=n;t++)
    {
		scanf("%s %s",ta,tb);
		lena=strlen(ta);
		lenb=strlen(tb);
		lenmax=max(lena,lenb);
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b)); 
		memset(sum,0,sizeof(sum));  //将a、b、sum三个数组初始化 
        for(i=0;i<=lena-1;i++) a[i]=ta[lena-1-i]-'0';
        for(i=0;i<=lenb-1;i++) b[i]=tb[lenb-1-i]-'0';  //用ta、tb给a、b赋值 
        for(i=0;i<=lenmax-1;i++)
        {
            sum[i]+=(a[i]+b[i]);
            if(sum[i]>=10)
            {
                if(i==lenmax-1) lenmax++;
                sum[i]-=10;
                sum[i+1]++;
            }
        } //用for语句将a、b数组逐个相加，即相当于将两个数字从个位起逐位相加 
        printf("Case %d:\n",t);
        printf("%s + %s = ",ta,tb);
        for(i=lenmax-1;i>=0;i--) printf("%d",sum[i]); //反向输出sum数组 
        printf("\n");if (t<n) printf("\n");
    }
}