#include<bits/stdc++.h>
using namespace std;
int A[520], B[520], ans[520];
int main() {
    string a,b;
    cin>>a;
    cin>>b;
    int longA = a.length();
    int longB = b.length();
    for(int i=longA-1;i>=0;i--) A[longA-i] = a[i]-'0';
    for(int i=longB-1;i>=0;i--) B[longB-i] = b[i]-'0';
    int len_max=longA>=longB?longA:longB;
    for(int i=1;i<=len_max;i++)
    {
        ans[i]+=((A[i]+B[i])%10);
        ans[i+1]=(A[i]+B[i])/10;
    }
    if(ans[len_max+1]!=0) cout<<ans[len_max+1];
    for(int i=len_max;i>0;i--) cout<<ans[i];
    return 0;
}

P1601 A+B Problem（高精）这道题目求各位大佬讲解一下