算法路-HDU-ACM---1002

#include<stdio.h>
#include<string.h> 


int main()
{
    int t;
    char a[1000],b[1000],c[1000];
    int al,bl;
    
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        c[0]='0';
        printf("Case %d:\n",i);
        scanf("%s %s",a,b);
        al=strlen(a); 
        bl=strlen(b);        
        printf("%s + %s = ",a,b);
        
        int l = (al>bl?al:bl);
        c[l+1]='\0';
        
        int zeng=0,temp;
        for(int j=l;j>0;j--)
        {
            if(al!=0 && bl!=0)
            {
                temp = a[al-1] + b[bl-1] + zeng - '0' -'0';
                c[j] = temp%10 + '0';
                zeng = temp/10;
                
                al--;
                bl--;
            }
            else if(al!=0 && bl==0)
            {
                temp = a[al-1] + zeng - '0';
                c[j] = temp%10 + '0';
                zeng = temp/10;
            
                al--;
            }
            else if(al==0 && bl!=0)
            {
                temp = b[bl-1] + zeng - '0';
                c[j] = temp%10 + '0';
                zeng = temp/10;
                
                bl--;
            }
        }
        if(zeng!=0)
        {
            c[0]=zeng + '0';
//            printf("Case %d:\n%s + %s = %s\n\n",i+1,a,b,c);
            printf("%s\n",c);
        }
        else {
            char *p = c+1;
//            printf("Case %d:\n%s + %s = %s\n\n",i+1,a,b,p);
            printf("%s\n",p);
        }
        if(i!=t) printf("\n");
    }
    return 0;
}