HDU 1002 A + B Problem II

    两个数相加......看到给的第二组样例就知道直接加法肯定是不行的了，算是一个大数处理的问题。所以用字符串然后转化成int数组再从后面一位一位的往前加就好了，一开始不小心加反了，所以WA了一下= =还是不太熟练，又改了半天......

   额，具体说就是这是个高精度计算的题= =用字符串输入进去，然后再变成int数组，一位一位加起来就好，超过10就进一位......

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char s1[1005],s2[1005];

int max(int a,int b)
{
    return a>b?a:b;
}

int main()
{
    int T,k=0;
    int i,p;
    int m1,m2;
    int len1,len2;
    scanf("%d",&T);
    while(T--)
    {
        if(k!=0)
            cout<<endl;
        k++;
        memset(s1,0,sizeof(s1));
        memset(s2,0,sizeof(s2));
        int a[1005]={0},b[1005]={0},c[1005]={0};
        scanf("%s %s",s1,s2);
        m1=0;
        m2=0;
        len1=strlen(s1);
        len2=strlen(s2);
        p=max(len1,len2);
        if(len1>len2)
            m2=len1-len2;
        else if(len1<len2)
            m1=len2-len1;
        for(i=1+m1;i<=p;i++)
        {
            a[i]=s1[i-m1-1]-'0';
            //cout<<"a["<<i<<"]="<<a[i]<<endl;
        }
        for(i=1+m2;i<=p;i++)
        {
            b[i]=s2[i-m2-1]-'0';
            //cout<<"b["<<i<<"]="<<b[i]<<endl;
        }
        //cout<<"p="<<p<<endl;
        for(i=p;i>0;i--)
        {
            c[i]=a[i]+b[i]+c[i];
            if(c[i]>=10)
            {
                c[i]=c[i]-10;
                c[i-1]=1;
            }
            //cout<<"i="<<i<<endl<<"c["<<i<<"]="<<c[i]<<endl;
        }
        cout<<"Case "<<k<<":"<<endl;
        cout<<s1<<" + "<<s2<<" = ";
        if(c[0]==1)
        {
            for(i=0;i<=p;i++)
            {
                cout<<c[i];
            }
        }
        else
        {
            for(i=1;i<=p;i++)
            {
                cout<<c[i];
            }
        }
        cout<<endl;
    }
    return 0;
}