题解

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+5;

string s1,s2;
int a[N];
int b[N];
int c[N];
int lena,lenb,len;

int main(){
cin >> s1 >> s2;
lena = s1.length();
lenb = s2.length();
len = max(lena,lenb);
for(int i=0;i<lena;i++){
a[i] = s1[lena - 1 - i] - '0';
}
for(int i=0;i<lenb;i++){
b[i] = s2[lenb - 1 - i] - '0';
}
for(int i=0;i<len;i++){
c[i] += a[i] + b[i];
c[i+1] += c[i]/10;
c[i] %= 10;
}
while(c[len]) len++;
for(int i=len-1;i>=0;i--){
cout << c[i];
}

return 0;

}