基础练习29高精度加法

#include 
#include <string>
using namespace std;
int main()
{
    string a, b;
    cin >> a >> b;
    int lena = a.length(); 
    int lenb = b.length();
    int A[100] = {0};
    int B[100] = {0};
    int j = 0;
    for (int i = lena - 1; i >= 0; i--) {
        A[j++] = a[i] - '0';
    } 
    j = 0;
    for (int i = lenb - 1; i >= 0; i--) {
        B[j++] = b[i] - '0';
    }   
    int C[101] = {0};
    int temp = 0;
    for (int i = 0; i < 100; i++) {
        C[i] = A[i] + B[i] + temp;
        temp = C[i] / 10;
        C[i] = C[i] % 10;
    }
    int max = lena;
    if (max < lenb)
        max = lenb;
    max = max - 1;
    if (C[max + 1] != 0)
        max = max + 1;
    for (int i = max; i >= 0; i--) {
        cout << C[i];
    }
    return 0;
}