A B Problem II

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    char a[1000],b[1000];
    int m[1000],n[1000],z[1000],k;
     int t;
    cin>>t;int pp=t;
    int si=0,cc=0;
    while(t--){
        scanf("%s%s",a,b);
        si++;
        cc++;
        int l1=strlen(a);
        int l2=strlen(b);
        memset(n,0,sizeof(n));
        memset(m,0,sizeof(m));
        memset(z,0,sizeof(z));
        for(int i=l1-1,j=0;i>=0;i--,j++)
            n[j]=a[i]-'0';
        for(int i=l2-1,j=0;i>=0;i--,j++)
            m[j]=b[i]-'0';
        if(l1>=l2)
            k=l1;
        else
            k=l2;
        for(int i=0;i<k;i++){
            z[i]+=n[i]+m[i];
               if(z[i]>9) {
                z[i]%=10;
                z[i+1]+=1;
               }
        }
        cout<<"Case "<<si<<":"<<endl;
        cout<<a<<" + "<<b<<" = ";
        int j=k-1;
        if(z[k]>0)
            j=k;
        for(;j>=0;j--){
            printf("%d",z[j]);
        }
        printf("\n");
        if(cc!=pp)
             printf("\n");
    }
    return 0;
}

 

原题http://acm.hdu.edu.cn/showproblem.php?pid=1002