HDOJ 1002：大数加法

#include <iostream>
using namespace std;

int main()
{
    const int N =1005;
    string a,b,aa,bb;
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a>>b;
        aa = a;
        bb = b;
        if(a.length()<b.length())
            a.insert(0,b.length()-a.length(),'0');
        else
            b.insert(0,a.length()-b.length(),'0');
         b.insert(0,1,'0');
         a.insert(0,'0');
        int carry = 0;
        char c[N]={0};
        for(int j=a.length()-1; j>=0; j--)
        {
            c[j] = carry + a[j] + b[j] - '0' - '0';
            carry = c[j]/10;
            c[j] %= 10;
        }
        int m=0;
        while(c[m]=='')
            m++;
        cout<<"Case "<<i+1<<":n"<<aa<<" + "<<bb<<" = ";
        for(;m<a.length();m++)
            cout<<char(c[m]+'0');
        cout<<endl;
        if(i!=n-1)
            cout<<endl;
    }
}