与高精度乘低精度不同,高精度乘高精度利用了乘法竖式中的一个规律:
如上图所示,数组A和B为乘数,数组C中存放对应位的乘积。最后的结果就是数组C竖着相加
代码如下:
// 高精度乘法乘高精度乘法
#include <iostream>
#include <vector>
using namespace std;
vector<int> mul(vector<int> A, vector<int> B)
{
vector<int> C(A.size() + B.size());
// 计算乘积C
for (int i = 0; i < A.size(); i ++ )
for (int j = 0; j < B.size(); j ++ )
C[i + j] += A[i] * B[j];
// 处理进位
for (int i = 0, t = 0; i < C.size() || t; i ++ )
{
t += C[i];
if (i >= C.size()) C.push_back(t % 10);
else C[i] = t % 10;
t /= 10;
}
// 除去前导0
while (C.size() > 1 && !C.back()) C.pop_back();
return C;
}
int main()
{
string a, b;
cin >> a >> b;
vector<int> A, B;
for (int i = a.size() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
for (int i = b.size() - 1; i >= 0; i -- ) B.push_back(b[i] - '0');
vector<int> C = mul(A, B);
for (int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
cout << endl;
return 0;
}