学习笔记---高精度

高精度计算

python中整数取值范围趋近无穷大,java中有BigInteger类和BigDecimal类,学习C/C++还是有必要掌握一下的

高精度加法

//模板
// C = A + B, A >= 0, B >= 0
vector<int> add(vector<int> &A, vector<int> &B)
{
    if (A.size() < B.size()) return add(B, A);

    vector<int> C;
    int t = 0;
    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;
}

//实例,高精度加法
#include<iostream>
#include<vector>
using namespace std;

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

高精度减法

//减法模板
// C = A - B, 满足A >= B, A >= 0, B >= 0
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;
    }

    while (C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}

//实例,高精度减法
#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;
    int t = 0;
    for(int i = 0;i<(int)A.size();i++){
        t = A[i]-t;
        if(i<(int)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;
    vector<int> A,B,C;
    
    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');
    
    if(cmp(A,B)){
        C=sub(A,B);
        for(int i = C.size()-1;i>=0;i--) printf("%d",C[i]);
    }
    else{
        C=sub(B,A);
        printf("-");
        for(int i = C.size()-1;i>=0;i--) printf("%d",C[i]);
    }
}

高精度乘法

//模板
// C = A * b, A >= 0, b >= 0
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;
}

//实例,高精度乘低精度
#include<iostream>
#include<vector>
using namespace std;

vector<int> mul(vector<int> &A,int b){
    int t = 0;
    vector<int> C;
    for(int i = 0;i<(int)A.size()||t;i++){
        if(i<(int)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(){
    vector<int> A,C;
    string a;
    int b;
    cin>>a>>b;
    
    for(int i = a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
    C=mul(A,b);
    
    for(int i = C.size()-1;i>=0;i--) printf("%d",C[i]);
    return 0;
}

高精度除法运算

//模板
// A / b = C ... r, A >= 0, b > 0
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;
}

//实例,大数除小数,输出商和余数
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

vector<int> div(vector<int> &A,int b,int &r){
    r = 0;
    vector<int> C;
    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(){
    vector<int> A,C;
    string a;
    int b,r;
    
    cin>>a>>b;
    
    for(int i = a.size()-1;i>=0;i--) A.push_back(a[i]-'0');
    
    C=div(A,b,r);
    
    for(int i = C.size()-1;i>=0;i--) printf("%d",C[i]);
    cout<<endl<<r;
    return 0;
}

vscode运行结果和手动配置CMakeLists文件