tije

#include<bits/stdc++.h>
using namespace std;
int a[200005],b[200005],c[200005];
int main(){
string s1,s2;
cin >> s1 >> s2;
int len1 = s1.size();
int len2 = s2.size();
for(int i =0;i< len1;++i){
a[i] = s1[len1 - i -1]-'0';
}
for(int i =0;i<len2;i){
b[i] = s2[len2 - i - 1]-'0';
}
int len = max(len1,len2);
for(int i =0;i<len;i){
c[i] += b[i]+a[i];
if(c[i] >= 10){
c[i] -= 10;
c[i+1]+=1;
}
}
while(c[len] == 0) len--;//寻找最高位下标
for(int i =len;i>=0;i--){
cout <<c[i];
}
return 0;
}