算法思路
每次A[i]之间称上b
#include <iostream>
#include <vector>
using namespace std;
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 += b * A[i];
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;
vector<int> A;
cin>>a>>b;
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;
}