大數-加法

#include
#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)  //超大數加法核心
{
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))
{
/*初始化*/
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'; //爲了方便 整型數組從末尾開始插入
x = H;
for (int i = n - 1; i >= 0; i--) b[x--] = cb[i] - '0';
big_add(m, n);
cout << endl;
}
return 0;
}