Gridea

高精度加 高精度减 高精度乘 高精度除

高精度加

#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(1);
    return C;
}

int main()
{
    string a,b;
    vector<int> A,B;
    
    cin >> a >> b;  //a = "123456"
    
    for(int i=a.size()-1; i>=0 ; i--)   //A = [6,5,4,3,2,1]
        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)    //A>=B
{
    if(A.size()!=B.size())  return A.size()>B.size();
    else
    {
        for(int i=A.size()-1;i>=0;i--)
            if(A[i]!=B[i])  return A[i]>B[i];
    }
    return true;    
}

//A>=B
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 = t - B[i];
        
        if(t<0){
            C.push_back(t+10);
            t = 1;
        }
        else{
            C.push_back(t);
            t=0;
        }
    }

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

    return C;
}

int main()
{
    string a,b;
    vector<int> A,B;
    
    cin >> a >> b;  //a = "123456"
    
    for(int i=a.size()-1; i>=0 ; i--)   //A = [6,5,4,3,2,1]
        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))//A>=B
    {
        auto C = sub(A,B);
        for(int i=C.size()-1; i>=0; i--)    cout << C[i];
    }
    else
    {
        auto C = sub(B,A);
        cout << "-";
        for(int i=C.size()-1; i>=0; i--)    cout << C[i];
    }

    cout << endl;
    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<string>
#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;
    int b;
    vector<int> A;

    cin >> a >> b;  //a = "123456"

    for (int i = a.size() - 1; i >= 0; i--)   //A = [6,5,4,3,2,1]
        A.push_back(a[i] - '0');
    
    int r=0;
    auto C = div(A, b, r);

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