高精度的加减乘除运算（C++）

高精度加法:

#include <iostream>
#include <vector>
#include <string>
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;
    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');
    auto C = add(A,B);
    for (int i = C.size() - 1;i >= 0;i--) printf ("%d",C[i]);
    return 0;
}

 高精度减法:

#include <iostream>
#include <vector>
#include <string>
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;
    int t = 0;
    for (int i = 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;
    }
    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');
    if (cmp(A,B))
    {
        auto C = sub(A,B); 
        for (int i = C.size() - 1;i >= 0;i--)
        {
            printf ("%d",C[i]);
        }
    }
    else
    {
        auto C = sub(B,A);
        printf ("-");
        for (int i = C.size() - 1;i >= 0;i--)
        {
            printf ("%d",C[i]);
        }
    }
    return 0;
}

高精度乘法:

#include <iostream>
#include <vector>
#include <string>
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;
    cin >> 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 <string>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> div(vector<int> &A,int b,int &r)
{
    vector<int> C;
    for (int i = A.size() - 1;i >= 0;i--)
    {
        r = r * 10 + A[i];
        C.push_back(r / b);
        r = r % b;
    }
    reverse(C.begin(),C.end());//字符串反转
    while (C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}
int main ()
{
    string a;
    cin >> a;
    int b;
    cin >> 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--)
    {
        printf ("%d",C[i]);
    }
    printf ("\n");
    printf ("%d",r);
    return 0;
}

 

欢迎留言讨论~