Large number-Addition

#include <iostream>
#include <string>
using namespace Std;


#define MAX 101
#define H 100


Char Ca[max];
Char Cb[max];
int A[max];
int B[max];
int C[max];


void output (int m,int n)
{
for (int i = 0; i < m; i++) cout << ca[i];
cout << "+";
for (int i = 0; i < n; i++) cout << cb[i];
cout << "=";
int flag = 1;
for (int i = 0; i < MAX; i++)
{
if (c[i] = = 0 && flag = = 1) continue;
Else
{
flag = 2;
cout << C[i];
}
}
}


void Big_add (int m, int n)//Extra large number of additive cores
{
int sum = H;
for (int i = H; I >= 0; i--)
{
int part1 = A[i] + b[i];
int part2 = C[sum] + part1;
C[sum] = part2% 10;
C[--sum] + = PART2/10;
}
Output (M, n);
}


int main ()
{
while (gets_s (CA), gets_s (CB))
{
/* Initialize */
memset (A, 0, sizeof (a));
memset (b, 0, sizeof (b));
memset (c, 0, sizeof (c));
/////////////////////////
int m = strlen (CA);
int n = strlen (CB);
int x = H;
for (int i = m-1; I >= 0; i--) a[x--] = ca[i]-' 0 '; To facilitate the insertion of an integer array from the end
x = H;
for (int i = n-1; I >= 0; i--) b[x--] = cb[i]-' 0 ';
Big_add (M, n);
cout << Endl;
}
return 0;
}