高精度加法

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	char a1[100], b1[100];
	int a[100], b[100], c[100], lena, lenb, lenc, x;
	cin >> a1 >> b1;
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	memset(c, 0, sizeof(c));//给a,b,c中的元素赋值为0
	lena = strlen(a1);
	lenb = strlen(b1);//计算数组长度
	for (int i = 0; i < lena; i++)a[lena-i] = a1[i] - 48;
	for (int i = 0; i < lenb; i++)b[lenb - i] = b1[i] - 48;//char中储存的数转化为int中的数
	lenc = 1, x = 0;
	while (lenc <= lena || lenc <= lenb)
	{
		c[lenc] = a[lenc] + b[lenc] + x;
		x = c[lenc] / 10;
		c[lenc] %= 10;
		lenc++;
	}//算法实现
	c[lenc] = x;
	if (c[lenc] == 0)
		lenc--;
	for (int j = lenc; j >=1 ; j--)
		cout << c[j];//打印输出
	cout << endl;
	return 0;
}