算法基础课：高精度

大整数存储

放到一个数组中，每个单元存一位，逆序存储

高精度加法

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

vector<int> a, b, c;
string add1, add2;

vector<int> add(vector<int> &a, vector<int> &b){
    if (a.size() < b.size()) return add(b, a);
    int t = 0;
    vector<int> c;
    for (int i = 0; i < a.size(); i ++){
        t += a[i];
        if (i < b.size()) t += b[i];
        c.push_back(t % 10);
        t /= 10;
    }
    if (t) c.push_back(t);
    return c;
}

int main(void){
    cin >> add1 >> add2;
    for (int i = add1.size() - 1; i >= 0; i--) a.push_back(add1[i] - '0');
    for (int i = add2.size() - 1; i >= 0; i--) b.push_back(add2[i] - '0');
    c = add(a, b);
    for (int i = c.size() - 1; i >= 0; i--) cout << c[i];
    
}

逆序存储原因：有进位，倒着放容易处理。vector 数组处理最后一个数的位置比较方便。

高精度减法

#include<iostream>
#include<vector>
using namespace std;
vector<int> A;
vector<int> B;
bool cmp(vector <int> a, vector<int> b){
    if (a.size() > b.size()) return true;
    else if (a.size() < b.size()) return false;
    else{
        for (int i = a.size() - 1; i >= 0; i--){
            if (a[i] != b[i]) return a[i] > b[i];
        }
    }
    return true;
}
vector<int> trim_zero(vector<int> a){
    while (a.back() == 0 && a.size() > 1) a.pop_back();
    return a;
}
vector<int> sub(vector<int> &a, vector<int> &b){
    vector<int> res;
    int t = 0;
    for (int i = 0; i < a.size(); i++){
        t = a[i] - t;
        if (i < b.size())
        t -= b[i];
        res.push_back((t + 10) % 10);
        if (t < 0){
            t = 1;
        }
        else{
            t = 0;
        }
    }
    return trim_zero(res);
}

int main(){
    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');
    }
    trim_zero(A), trim_zero(B);
    vector<int> C;
    if (cmp(A,B)) C = sub(A, B);
    else {
        cout << "-";
        C = sub(B, A);
    }
    
    for (int i = C.size() - 1; i >= 0; i --){
        cout << C[i];
    }
}

高精度乘法

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

vector<int> a;
string A;
int b;

vector<int> mul(vector<int> &q, int r){
    vector<int> c;
    int t = 0;
    for(int i = 0; i < q.size() || t; i++){
        if (i < q.size()) 
            t += q[i] * r;
            c.push_back(t % 10);
            t /= 10;
    }
    return c;
}
vector<int> trim_zero(vector<int> c){
    while (c.back() == 0 && c.size() > 1) c.pop_back();
    return c;
}

int main(){
    cin >> A;
    for (int i = A.size() - 1; i >= 0; i--){
        a.push_back(A[i] - '0');
    }
    cin >> b;
    auto c = mul(a, b);
    auto d = trim_zero(c);
    for (int i = d.size() - 1; i >= 0; i--){
        cout << d[i];
    }
}

高精度除法

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
vector<int> A;
int B;

vector<int> trim_zero(vector<int> a){
    while (a.back() == 0 && a.size() > 1) a.pop_back();
    return a;
}

vector<int> div(vector<int> &A, int B, int &r){
    vector <int> C;
    r = 0;
    for (int i = 0; i < A.size(); i++){
        r = r * 10 + A[i];
        C.push_back(r / B);
        r %= B;
    }
    reverse(C.begin(), C.end());
    while (C.back() == 0 && C.size() > 1) C.pop_back();
    return C;
}

int main(void){
    string a;
    cin >> a;
    for (int i = 0; i < a.size(); i++){
        A.push_back(a[i] - '0');
    }
    cin >> B;
    while (A.back() == 0 && A.size() > 1) A.pop_back();
    int r;
    auto res = div(A, B, r);
    for (int i = res.size() - 1; i >= 0; i--){
        cout << res[i];
    }
    cout << endl << r << endl;
}

除法不再逆序排序，是因为除法是从高往低运行，除后的余数容易储存