蒟蒻求助，代码如下qwq

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
string a,b;
int A[100000005],B[100000005];
int ApB[1000000005];
int main()
{
    cin >> a >> b;
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    for(int i=0;i<a.size();i++)
    {
        string sa;
        sa = a[i];
        A[i]=stoi(sa);
    }
    for(int i=0;i<b.size();i++)
    {
        string sb;
        sb = b[i];
        B[i]=stoi(sb);
    }
    int bigger=max(a.size(),b.size());
    int tmp=0,tmp2=0;
    for(int i=0;i<bigger+1;i++)
    {
        if(A[i]+B[i]+tmp<10)
        {
            ApB[i]=A[i]+B[i]+tmp;
            continue;
        }
        if(A[i]+B[i]+tmp>=10)
        {
            ApB[i]=A[i]+B[i]+tmp-10;
            tmp=1;
            if(i==bigger-1)
            {
                tmp2=1;
            }
            continue;
        }
    }
    for(int i=bigger-1+tmp2;i>=0;i--)
    {
        cout << ApB[i];
    }
    return 0;
}