超牛的题解

#include<bits/stdc++.h>
using namespace std;
const int N=505;
string s1,s2;
int c[N],a[N],b[N];
int main(){
int la,lb,lc;
cin>>s1>>s2;
la=s1.size();
lb=s2.size();
for(int i=0;i<la;i++){
a[la-i]=s1[i]-'0';
}
for(int i=0;i<lb;i++){
b[lb-i]=s2[i]-'0';
}
lc=max(la,lb)+1;
for(int i=1;i<=lc;i++){
c[i]+=a[i]+b[i];
c[i+1]=c[i]/10;
c[i]=c[i]%10;
}
if(c[lc]==0){
lc--;
}
for(int i=lc;i>=1;i--){
cout<<c[i];
}
return 0;
}