高精度算法（cpp）加减乘除大合集

前言

总所周知int型存储的数的大小是有很大限制的，所以我们在计算超大数的加减乘除时就要用到高精度算法。
主要思想就是把超大数的每一位都存储在数组中，然后运用我们小学所学的竖式计算来进行计算。
c++比较需要，java和Python有更方便的选择。
本文所有代码仅限于计算非负整数
在cpp中我们使用vector可增长数组来存储

高精度加法

#include <iostream>
#include <vector>

using namespace std;

vector<int> add(vector<int> &A, vector<int> &B)
{
    vector<int> C;
    int t = 0;
    for (int i = 0; i < A.size() || i < B.size(); i ++ )
    {
        if(i < A.size())
            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()
{
    string a, b;
    vector<int> 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 C = add(A, B);

    for (int i = C.size() - 1; i >= 0; i -- ) cout << C[i];
    cout << endl;

    return 0;
}

---

高精度减法

#include<iostream>
#include<vector>

using namespace std;

//判断正负值
bool cmp(vector<int> &a, vector<int> &b)
{
    //长度不相同的情况下
    if(a.size() != b.size())
        return a.size() > b.size();

    for(int i = a.size() -  1; i >= 0; i --)
    {
        if(a[i] != b[i])
            return a[i] > b[i];
    }
    return true;
}

//返回计算结果
vector<int> sub(vector<int> &a, vector<int> &b)
{
    vector<int> C;
    for(int i = 0, t = 0; i < a.size(); i ++)
    {
        t = a[i] -t;
        if(i < b.size())    t -= b[i];
        C.push_back((t + 10) % 10);
        if(t < 0)   t = 1;
        else
         t = 0;
    }
    //清除0
    while(C.size() > 1 && C.back() == 0)    C.pop_back();
    return C;
}

int main()
{
    string a, b;
    cin >> a >> b;

    //对字符串的转换
    vector<int> 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');

    vector<int> C;
    //判断正负
    if(cmp(A,B))  C = sub(A,B);
    else
    {    C = sub(B,A),  cout << "-";}        

    //输出
    for(int i = C.size() - 1; i >= 0; i --)
    {
        cout << C[i];
    }

    return 0;
}

---

高精度乘法

#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 += A[i] * b;
        C.push_back(t % 10);
        t /= 10;
    }

    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');

    auto C = mul(A, b);

    for (int i = C.size() - 1; i >= 0; i -- ) printf("%d", C[i]);

    return 0;
}

---

高精度除法

#include <iostream>
#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 = r * 10 + A[i];
        C.push_back(r / b);
        r %= b;
    }
    reverse(C.begin(), C.end());
    while (C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}

int main()
{
    string a;
    vector<int> A;

    int B;
    cin >> a >> B;
    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 << endl;

    return 0;
}