HDU 1002 高精度整数

第一天

//hdu1002:高精度整数

#include <iostream>
#include <cstring>
using namespace std;
int main()
{
    int n;
    cin >> n;
    for(int m = 0; m < n; m++)
    {
        char a[1000] = {}, b[1000] = {};
        int c[1001] = {};
        cin >> a >> b;
        int i, j, k = 0;
        int r = 0;
        //a和b一起加
        for(i = strlen(a) - 1, j = strlen(b) - 1; i >= 0&&j >= 0; i--, j--)
        {
            int p = (a[i] - '0') + (b[j] - '0') + r;
            r = p/10;
            c[k++] = p%10;
        }
        //b加完了只剩a
        while(i >= 0)
        {
            int p = (a[i] - '0') + r;
            r = p/10;
            c[k++] = p%10;
            i--;
        }
        //a加完了只剩b
        while(j >= 0)
        {
            int p = (b[j] - '0') + r;
            r = p/10;
            c[k++] = p%10;
            j--;
        }
        //最高位
        if(r)
            c[k++] = r;
        cout <<  "Case " << m + 1 << ":" << endl;
        cout << a << " + " << b << " = ";
        for(int i = k - 1; i >= 0; i--)
            cout << c[i];
        if(m != n - 1)
            cout << endl << endl;   
        else
            cout << endl;
    }
}

思路:a和b先一起加,如果其中有一个加完了,就另一个单独加. 由于是加是从数组后往前加,但是是依次push到结果c数组中,所以最后c要倒过来输出