35 lines
745 B
C++
35 lines
745 B
C++
|
#include <bits/stdc++.h>
|
|||
|
|
|
|||
|
|
using namespace std;
|
|||
|
|
|
|||
|
|
/**
|
|||
|
|
* 功能：高精度乘低精度模板
|
|||
|
|
* @param A
|
|||
|
|
* @param b
|
|||
|
|
* @return
|
|||
|
|
*/
|
|||
|
|
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;
|
|||
|
|
C.push_back(t % 10);
|
|||
|
|
t /= 10;
|
|||
|
|
}
|
|||
|
|
while (C.size() > 1 && C.back() == 0) C.pop_back();
|
|||
|
|
return C;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
int main() {
|
|||
|
|
string a;
|
|||
|
|
int b;
|
|||
|
|
vector<int> A, C;
|
|||
|
|
cin >> a >> b;
|
|||
|
|
//倒着放的噢~
|
|||
|
|
for (int i = a.size() - 1; i >= 0; i--) A.push_back(a[i] - '0');
|
|||
|
|
C = mul(A, b);
|
|||
|
|
//倒着输出噢~
|
|||
|
|
for (int i = C.size() - 1; i >= 0; i--) printf("%d", C[i]);
|
|||
|
|
return 0;
|
|||
|
|
}
|