代码如下：

#include <bits/stdc++.h>
using namespace std;
int k(char l)
{
	return l-'0';
}
int main()
{
	char a1[10000],a2[10000];
	int b1[10000],c1[10000],ans[10000],i,len1,len2,maxlen;
	bool q=false;
	memset(b1,0,sizeof(b1));
	memset(c1,0,sizeof(c1));
	memset(ans,0,sizeof(ans));
	gets(a1);
	gets(a2);
	len1=strlen(a1);
	len2=strlen(a2);
	if(len1>len2)maxlen=len1;
	else maxlen=len2;
	for(i=0;i<len1;i++)
		b1[len1-i-1]+=k(a1[i]);
	for(i=0;i<len2;i++)
		c1[len2-i-1]+=k(a2[i]);
	for(i=0;i<maxlen;i++)
	{
		ans[i]+=b1[i]+c1[i];
		if(ans[i]>=10){
			ans[i+1]+=1;
			ans[i]%=10;
		}
	}
	for(i=maxlen;i>=0;i--)
	{
		if((ans[i]==0)&&(q==false))continue;
		else {cout<<ans[i];q=true;} 
	}
	return 0;
}