高精度加法

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<string.h>
using namespace std;
typedef long long ll;
char aa[100010];
char bb[100010];
int a[1000010], b[100010];
int c[10000010];
void add(int a[], int b[])
{
    int l = max(a[0], b[0]);
    for (int i = 1; i <= l; i++)
    {
        c[i] = a[i] + b[i];
    }
    l++;
    for (int i = 1; i <= l; i++)
    {
        if (c[i] > 9)
        {
            c[i + 1]++;
            c[i] = c[i] - 10;
        }
    }
    while (c[l] == 0 && l > 1)
    {
        l--;
    }
    for (int i = l; i >= 1; i--)
    {
        cout << c[i];
    }
    cout << endl;
}
int main()
{
    scanf("%s", &aa);
    scanf("%s", &bb);
    int l1 = strlen(aa);
    int l2 = strlen(bb);
    a[0] = l1;
    b[0] = l2;
    for (int i = l1; i >=1; i--)
    {
        a[i] = aa[l1 - i] - '0';
    }
    for (int i = l2; i >= 1; i--)
    {
        b[i] = bb[l2 - i] - '0';
    }
    add(a, b);
    return 0;
}