学累了就出去走走吧算法思想代码实现123456789101112131415161718192021222324252627282930313233343536373839404142434445#include <iostream>#include <cstring>#include <algorithm>using namespace std;vector<int> mul(vector<int> A, int b){ // 默认A 大于 b vector<int> C; int t = 0; for(int i = 0; i < A.size(); i++){ t += A[i] * b; C.push_back(t % 10); t /= 10; } // 如果t很大可能会留有剩余 while(t){ C.push_back(t % 10); t /= 10; } // 去除前导0 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--) cout << C[i]; return 0;}