void super_add_de_xiao_rong(char a[N], char b[N])
{
	lena = strlen(a), lenb = strlen(b);
	for (int i = lena - 1; i >= 0; i--)
		a1[lena - i] = a[i] - '0';
	for (int i = lenb - 1; i >= 0; i--)
		b1[lenb - i] = b[i] - '0';
	int x = 0;
	while (lenc <= lena || lenc <= lenb)
	{
		c1[lenc] = a1[lenc] + b1[lenc] + x;
		x = c1[lenc] / 10;
		c1[lenc] %= 10;
		lenc++;
	}
	while (c1[lenc] == 0 && lenc >= 0)
		lenc--;
	for (int i = lenc; i >= 1; i--)
		cout << c1[i];
}