hdu1002-大数相加

1002

#include<iostream>  
#include<string>  
using namespace std;  
string pre(string &a)
{
    int i = 0;
    if (a[0]!='0') return a;
    while (a[i] == '0') i++;
    a = a.substr(i,a.length()-1);   //删除前面的0，如000000007
    return a ;
}
int main()  
{
    string a,b,t;
    int n,case1,alen,blen,tlen,sum,bit,Case = 0;
    while (cin>>n)
    {  
        while (n--)
        {
            Case ++;
            cin>>a>>b;
            pre(a);
            pre(b);
            alen = a.length()-1;
            blen = b.length()-1;
            alen<blen?t = "0"+b:t = "0"+a;
            tlen = t.length()-1;
            bit = 0;
            for (int i = blen,j = alen; j>=0 || i>=0; j--,i--)
            {
                sum= (j>=0?a[j]-48:0) + (i>=0?b[i]-48:0) +bit;
                bit = sum/10;
                t[tlen--] = sum%10+'0';
            }
            if(sum>=10) t[tlen--] = '1';
            if(t[0] == '0') t = t.substr(1,t.length() - 1);
            printf("Case %d:\n",Case);
            cout<<a<<" + "<<b<<" = "<<t<<endl;
            if(n>0) cout<<endl;
        }
    }
    return 0;