【东莞2011年科普杯初中生网络邀请赛】星球间的距离（高精度）

代码如下：

#include<iostream> 
#include<cstring>
#include<cstdio> 
using namespace std;
int a[2000],b[2000],c[2000],la,lb,lc,x;
char a1[2000],b1[2000];
int main()
{
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	memset(c,0,sizeof(c));
	cin>>a1>>b1;
	la = strlen(a1); 
    lb = strlen(b1);
	for(int i = 1;i <= la; ++i) 
		a[la - i + 1] = a1[i - 1] - '0';
	for(int i = 1;i <= lb; ++i)	
		b[lb - i + 1] = b1[i - 1] - '0';
	x = 0;
	if(la > lb) lc = la;
	  else lc = lb;
	for(int i = 1;i <= lc; ++i)
	{
		c[i] = a[i] + b[i] + x;
		x = c[i] / 10;
		c[i] %= 10;
	}
	lc++;
	c[lc] = x;
	while(c[lc] == 0 && lc > 1) lc--;
	for(int i = lc;i >= 1; --i) cout<<c[i];
	return 0;
}