大数-乘法

/*首先通过字符串数组获取数字，再将字符串数组的数字转化成整数，再参与乘法计算*/


#include <iostream> 
#include <algorithm>
#include <string>
using namespace std;
#define MAX 1000


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 << a[i];
cout << " X ";
for (int i = 0; i < n; i++) cout << b[i];
cout << "=";
////////////////////////////////////////////
int flag = 1;
for (int i = 0; i < MAX; i++)   //由于数都是从数字末尾开始放 所以无关0要跳过
{
if (c[i] == 0 && flag == 1) continue;
else
{
flag = 2;
cout << c[i];
}
}
cout << endl;
}


void BigX(int m, int n)   //超大数乘法核心
{
for (int i = m - 1; i >= 0; i--)
{
int sum = (MAX-1) - (m - 1 - i);   //关键 具体参考乘法公式
for (int j = n - 1; j >= 0; j--)
{
int part1 = a[i] * b[j];
c[sum] += part1;
int part2 = c[sum];
c[sum] %= 10;
c[--sum] += part2 / 10;
}
}
output(m,n);
}

int main()
{
while (gets_s(ca),gets_s(cb))
{
/*初始化*/
memset(c, 0, sizeof(c));
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
////////////////////////
int m = strlen(ca);
int n = strlen(cb);
for (int i = 0; i < m; i++)a[i] = ca[i] - '0';  //类型转化
for (int i = 0; i < n; i++)b[i] = cb[i] - '0';
BigX(m, n);
cout << endl;
}
return 0;
}