高精度乘除法

高精度乘除法

乘法

输入一个大整数和一个整数

#include <iostream>
#include <string>
#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(); i++) {
        t = A[i] * b + t;
        c.push_back(t % 10);
        t = t / 10;
    }
    while (t) {
        c.push_back(t % 10);
        t = t / 10;
    }
    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');


    auto C = mul(A, b);
    for (int i = C.size() - 1; i >= 0; i--) cout << C[i];
    return 0;
}

大整数除法

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

vector<int> div(vector<int>& A, int b,int &r) {
    vector<int> c;
     r = 0;
    for (int i = A.size()-1; i >=0; i--) {
        r = A[i]  + r*10;
        c.push_back(r / b);
        r = r % b;
    }
    reverse(c.begin(), c.end());
    while (c.size() > 0 && 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');
    int r;

    auto C = div(A, b,r);
    for (int i = C.size() - 1; i >= 0; i--) cout << C[i];//输出商
    cout << endl << r;//输出余数
    return 0;
}