高精度计算

长整数相加

#include <iostream>
#include <vector>

using namespace std;
vector<int> b,a;

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 c;
    cin>>c;
    for(int i=c.size()-1;i>=0;i--)a.push_back(c[i]-'0');
    cin>>c;
    for(int i=c.size()-1;i>=0;i--)b.push_back(c[i]-'0');
    
    auto d=add(a,b);
    
    for(int i=d.size()-1;i>=0;i--)printf("%d",d[i]);
    
}

减

#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;
    }

    while (C.size() > 1 && C.back() == 0) C.pop_back();
    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');

    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];
    cout << endl;

    return 0;
}

乘法

#include <iostream>
#include <vector>

using namespace std;

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

int main()
{
    string b;
    int a;
    vector<int> B;    
    cin>>b;
    for(int i=b.size()-1;i>=0;i--)B.push_back(b[i]-'0');
    cin>>a;
    

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

除法

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

using namespace std;

void div(int a,vector<int>&B){
   
    vector<int>C;
    int t=0;
    for(int i=0;i<B.size();i++){
        t=t*10+B[i];
        C.push_back(t/a);
        t%=a;
    }
    reverse(C.begin(),C.end());
    while(C.size()>1&&C.back()==0)C.pop_back();
    for(int i=C.size()-1;i>=0;i--){
        printf("%d",C[i]);
    }
    cout<<endl;
    cout<<t<<endl;
    
}

int main()
{
    string b;
    int a;
    vector<int> B;    
    cin>>b;
    for(int i=0;i<b.size();i++)B.push_back(b[i]-'0');
    cin>>a;
    div(a,B);
}