题解

#include<iostream>
#include<cstring>
using namespace std;
char a1[1010],b1[1010];
int a[10010],b[10010],c[10010],lena,lenb,mlen;
int main(){
	cin >> a1;
	cin >> b1;
	memset(c,0,sizeof c);
	memset(a,0,sizeof a);
	memset(b,0,sizeof b);
	lena=strlen(a1);
	lenb=strlen(b1);
	for(int i=1;i<=lena;i++) a[i] = a1[lena-i]-'0';
	for(int i=1;i<=lenb;i++) b[i] = b1[lenb-i]-'0';
	mlen = max(lena,lenb)+1;
	for(int i=1;i<=mlen;i++) c[i] = a[i] + b[i];
	for(int i=1;i<=mlen;i++){
		if(c[i] > 9){
			c[i+1] += (c[i]/10);
			c[i] %=10;
		}
	}                                                           
	while(c[mlen]==0&&mlen>1)mlen--;
	for(int i=mlen;i>=1;i--){
		cout << c[i];
	}
	
	return 0;
}