hdu 1002 A + B Problem II 大整数相加

第二次写这道题了...依然写得磕磕绊绊的....好多冗余代码....简直要被格式逼疯了T_T....

关于进位问题的解决方法之一是倒着读入数组....以前写的时候用的是数组前空一位，最后判断下前导0

还有就是字符型读入整形数组要减去‘0’.......还要注意格式......

自己的挫代码......

#include<stdio.h>
#include<string.h> 
#define MAX 1010
int main()
{
    int n,t=1;
    scanf("%d",&n);
    while(t<=n)
    {
        char s1[MAX],s2[MAX];
        int a[MAX],b[MAX],sum[MAX];
        int i,j,l1,l2,mins;
        scanf("%s%s",&s1,&s2);
        l1=strlen(s1);
        l2=strlen(s2);
        mins=l1<l2?l1:l2;
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        for(i=l1-1,j=0;i>=0;i--)
        {
            a[j++]=s1[i]-'0';
        }
        for(i=l2-1,j=0;i>=0;i--)
        {
            b[j++]=s2[i]-'0';
        }
        memset(sum,0,sizeof(sum));
        for(i=0;i<mins;i++)
        {
            sum[i]=sum[i]+a[i]+b[i];
            if(sum[i]>9)
            {
                 sum[i]-=10;
                 sum[i+1]++;
             }
        }
        if(l1==l2)
        {
            if(sum[mins]==0)
            {
                printf("Case %d:
",t++);
                printf("%s + %s = ",s1,s2);
            for(i=mins-1;i>=0;i--)
            printf("%d",sum[i]);
            if(t!=n+1)
            printf("

");
            else
            printf("
");
            }
            else
            {
                printf("Case %d:
",t++);
                printf("%s + %s = ",s1,s2);
            for(i=mins;i>=0;i--)
            printf("%d",sum[i]);
            if(t!=n+1)
            printf("

");
            else
            printf("
");
            }
           
        }
        if(l1>l2)
        {
            for(i=mins;i<=l1;i++)
            {
              sum[i]+=a[i];
              if(sum[i]>9)
            {
                 sum[i]-=10;
                 sum[i+1]++;
             }
            }
            if(sum[l1]!=0)
            {
                printf("Case %d:
",t++);
                printf("%s + %s = ",s1,s2);
            for(i=l1;i>=0;i--)
            printf("%d",sum[i]) ;
            if(t!=n+1)
            printf("

");
            else
            printf("
");
            }
            else
            {
                printf("Case %d:
",t++);
                printf("%s + %s = ",s1,s2);
             for(i=l1-1;i>=0;i--)
            printf("%d",sum[i]) ;
            if(t!=n+1)
            printf("

");
            else
            printf("
");
            }
        }
        if(l2>l1)
        {
            for(i=mins;i<=l2;i++)
            {
              sum[i]+=b[i];
              if(sum[i]>9)
            {
                 sum[i]-=10;
                 sum[i+1]++;
             }
            }
            if(sum[l2]!=0)
            {
                printf("Case %d:
",t++);
                printf("%s + %s = ",s1,s2);
            for(i=l2;i>=0;i--)
            printf("%d",sum[i]) ;
        if(t!=n+1)
            printf("

");
            else
            printf("
");
            }
            else
            {
                printf("Case %d:
",t++);
                printf("%s + %s = ",s1,s2);
            for(i=l2-1;i>=0;i--)
            printf("%d",sum[i]) ;
            if(t!=n+1)
            printf("

");
            else
            printf("
");
            }
        }
    }
}

大神的代码....完全一样的思路，人家代码就写得这么简洁，整整少了三分之二呀！！！！T_T........

#include<iostream>
#include<cstring>

using namespace std;

int s1[1005],s2[1005],ans[1005];

int main(){
    int t;
    char str1[1005],str2[1005];
    cin>>t;
    int cases=0;
    while(t--){
        cin>>str1>>str2;
        if(cases)
            cout<<endl;
        int i,j;
        int len1=strlen(str1),len2=strlen(str2);
        memset(s1,0,sizeof(s1));
        memset(s2,0,sizeof(s2));
        memset(ans,0,sizeof(ans));
        int si=0,sj=0;
        for(i=len1-1;i>=0;i--)
            s1[si++]=str1[i]-'0';
        for(j=len2-1;j>=0;j--)
            s2[sj++]=str2[j]-'0';

        for(i=0;i<1005;i++){
            ans[i]+=s1[i]+s2[i];
            if(ans[i]>=10){
                ans[i+1]+=ans[i]/10;
                ans[i]%=10;
            }
        }
        for(j=1004;j>=0;j--)
            if(ans[j]!=0)
                break;
        cout<<"Case "<<++cases<<":"<<endl;
        if(j==-1){
            cout<<"0 + 0 = 0"<<endl;
            continue;
        }
        cout<<str1<<" + "<<str2<<" = ";
        for(i=j;i>=0;i--)
            cout<<ans[i];
        cout<<endl;
    }
    return 0;
}