题解 | #高精度整数加法#

#include <iostream>
using namespace std;
#include<cmath>


int main() {
    string s1, s2;
    cin >> s1 >> s2;
    int len1 = s1.length(), len2 = s2.length();
    if (len1 > len2) {
        for (int i = 0; i < len1 - len2; i++) {
            s2.insert(s2.begin(), '0');
        }
    } else {
        for (int i = 0; i < len2 - len1; i++) {
            s1.insert(s1.begin(), '0');
        }
    }
    int len = s1.length();
    int temp = 0;
    string s;
    for (int i = 0; i < len; i++) {
        int sum = s1[len - i - 1] - '0' + s2[len - i - 1] - '0' + temp;
        if (sum > 9) {
            s.insert(s.begin(), sum -10 + '0');
            temp=1;
        } else {
            s.insert(s.begin(), sum + '0');
            temp = 0;
        }
    }
    if(temp==1)
    {
        s.insert(s.begin(), '1');
    }
    cout<<s;

}
// 64 位输出请用 printf("%lld")