题目:高精度乘法
地址 :http://ybt.ssoier.cn:8088/problem_show.php?pid=1307
类型:模拟
题解:
#include <bits/stdc++.h>
using namespace std;
vector<int> a, b, c;
string x, y;
// 模拟乘法,低位相乘
void turn(string a, vector<int>& b) {
reverse(a.begin(), a.end());
for (int i = 0; i < a.size(); i++) {
b.push_back(a[i] - '0');
}
return;
}
void mul(vector<int> a, vector<int> b) {
c.push_back(0);
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < b.size(); j++) {
if (c.size() - 1 < i + j + 1)
c.push_back(0);
c[i + j] += a[i] * b[j];
c[i + j + 1] += c[i + j] / 10;
c[i + j] = c[i + j] % 10;
}
}
// cout << c.size() << endl;
for (int i = c.size() - 1; i > 0; i--) {
if (c[i] == 0)
c.pop_back();
else
break;
}
for (int i = c.size() - 1; i >= 0; i--) {
cout << c[i];
}
return;
}
int main() {
cin >> x >> y;
turn(x, a);
turn(y, b);
mul(a, b);
return 0;
}