高精度乘高精度

#include<vector>
#include<iostream>
using namespace std;

vector<int> solve(vector<int>& A, vector<int>& B)
{
    vector<int>C(A.size() + B.size() + 10, 0);
    for(int i=0;i<=A.size()-1;i++)
        for (int j = 0; j <= B.size() - 1; j++)
            C[i + j] = C[i + j] + A[i] * B[j];

    int t = 0;
    for (int i = 0; i <= C.size() - 1; i++)
    {
        t += C[i];
        C[i] = t % 10;
        t /= 10;
    }
    while (C.size() > 1 && C.back() == 0) C.pop_back();

    return C;

}

int main()
{
    vector<int>A, B;
    string a, b;
    cin >> a >> b;
    for (int i = a.size() - 1; i >= 0; i--)
        A.push_back(a[i] - '0');
    for (int i = b.size() - 1; i >= 0; i--)
        B.push_back(b[i] - '0');

    auto t = solve(A, B);
    for (int i = t.size() - 1; i >= 0; i--)
        cout << t[i];

    return 0;
}