#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
const int MAXN = 1e6 + 10;
vector<int> mul(vector<int>& A, int b)
{
vector<int>C;
int t = 0;
for (int i = 0; i < A.size()||t; i++)
{
if (i < A.size())t += A[i] * b; //用A的每一位去乘b
C.push_back(t % 10); //t的个位压入C
t /= 10; //t移去个位
}
while (C.size() > 1 && C.back() == 0)C.pop_back();//消除前导零
return C;
}
int main()
{
string a;
int b;
cin >> a >> b;
vector<int>A;
for (int i = a.size() - 1; i >= 0; i--)
A.push_back(a[i]-'0');
vector<int>C = mul(A, b);
for (int i = C.size() - 1; i >= 0; i--)
{
printf("%d", C[i]);
}
return 0;
}
类似于高精度加法,这里使用大的A的每一位与b相乘,得到个位压入,再把个位移出,以次累计。