A + B Problem II HDU - 1002（大数A+B）

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

题意：

两数相加求和，但这里的数很大，long long 会爆，所以我们要用字符串来处理求和

思路：

从个位开始从后往前相加，逢十进一

AC代码：

法一：

 #include<stdio.h>
#include<string.h>
char a[1010],b[1010];
int a1[1010],b1[1010],c[10010];
int main()
{
    int n,p=0;
    scanf("%d",&n);
    while(n--)
    {
        p++;
        memset(a1,0,sizeof(a1));
        memset(b1,0,sizeof(b1));
        memset(c,0,sizeof(c));
        scanf("%s %s",a,b);
        int l1=strlen(a);
        int l2=strlen(b);
        int i,i1,j=0,k=0;
        for(i=l1-1; i>=0; i--)
            a1[j++]=a[i]-'0';//把a数组倒过来，也就是个位数字在第一位
        for(i=l2-1; i>=0; i--)
            b1[k++]=b[i]-'0';//同理，倒置b数组
    
        int l=l1>l2?l1:l2;
        int s=0;
        for(i1=0; i1<l; i1++)
        {
            c[i1]=a1[i1]+b1[i1]+s/10;//每一位相加所求的和+前一位求和所进的1
            s=c[i1];
        }
        while(s>=10)//s是每一位上所求得的和
        {
            c[l]=s/10%10;
            l++;
            s=s/10;
        }
        printf("Case %d:\n",p);
        printf("%s + %s = ",a,b);
        for(i=l-1; i>=0; i--)
            printf("%d",c[i]%10);
        printf("\n");
        if(n>0)
            printf("\n");//控制两组数据之间有一个空行
    }
    return 0;
}

法二：

#include<stdio.h>
#include<string.h>
char a[1010],b[1010];
int c[1010],d[1010],e[1010];
int main()
{
    int t,k=0;
   scanf("%d",&t);
   while(t--)
   {
       k++;
       memset(c,0,sizeof(c));
       memset(d,0,sizeof(d));
       memset(e,0,sizeof(e));
       memset(a,'\0',sizeof(a));
       memset(b,'\0',sizeof(b));
       scanf("%s %s",a,b);
       int i,j,l,l1;
       l=strlen(a);
       l1=strlen(b);
       for(i=l-1,j=0;i>=0;j++,i--)
        c[j]=a[i]-48;
       for(i=l1-1,j=0;i>=0;j++,i--)
        d[j]=b[i]-48;
       int maxx=l;
       if(l<l1)
        maxx=l1;
       for(i=0;i<=maxx;i++)
       {
           e[i]=c[i]+d[i];
           if(e[i]>9)
           {
               e[i]=e[i]-10;
               c[i+1]=c[i+1]+1;
           }
       }
       printf("Case %d:\n",k);
       printf("%s + %s = ",a,b);
       if(e[maxx]!=0)
        printf("%d",e[maxx]);
       for(i=maxx-1;i>=0;i--)
        printf("%d",e[i]);
        printf("\n");
       if(t!=0)
        printf("\n");
   }
     return 0;
}

法三：

#include<stdio.h>
#include<string.h>
char a[10000],b[10000];
char c[10000],d[10000];
long long f[10000];
int main()
{
    int n;
    scanf("%d",&n);
    int p=0;
    while(n--)
    {
        p++;
        memset(c,0,sizeof(c));
        memset(d,0,sizeof(d));
        memset(f,0,sizeof(f));
        scanf("%s %s",a,b);
        int la=strlen(a);
        int lb=strlen(b);
        int u=0,v=0;
        for(int i=la-1; i>=0; i--)
        {
            c[u++]=a[i];  //倒置字符串a
        }
        for(int i=lb-1; i>=0; i--)
        {
            d[v++]=b[i];//倒置字符串b
        }
        int l=la>lb?la:lb;
        //长度不一样的情况下，将最初的短的字符串前面补0至两字符串长度相同（即转置过的字符串后面补0）
        if(la>lb)
        {
            for(int i=lb; i<la; i++)
                d[i]='0';
        }
        else
        {
            for(int i=la; i<lb; i++)
                c[i]='0';
        }
        int k=0;
        for(int i=0,j=0; i<l,j<l; i++,j++)
        {
            f[k]+=(c[i]-'0')+(d[j]-'0');
            if(f[k]>=10)
            {
                f[k]=f[k]-10;
                f[k+1]++;
            }
            k++;
        }
        printf("Case %d:\n",p);
        printf("%s + %s = ",a,b);
        if(n>0)
        {
           if(f[k])//可能有进位情况，即9+9=18 控制输出1
                printf("%lld",f[k]);
            for(int i=k-1; i>=0; i--)
                printf("%lld",f[i]);
            printf("\n");
            printf("\n");
        }
        else
        {
            if(f[k])
                printf("%lld",f[k]);
            for(int i=k-1; i>=0; i--)
                printf("%lld",f[i]);
            printf("\n");
        }
    }
    return 0;
}