第一章基础算法：高精度

第一章基础算法：高精度

高精度加法、减法、乘法、除法没有什么特别的算法思维，就是利用vector进行正常的加减乘除的操作。板子比较简单，但高精度与其他算法融合可能有些难，如国王游戏。

AcWing 791：高精度加法

#include <iostream>
#include <vector>

using namespace std;

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

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;
    C = add(A, B);
    
    for(int i = C.size()-1; i >= 0; i--) cout << C[i];
    return 0;
}

---

AcWing 792：高精度减法

#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 < 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];
    return 0;
}

---

AcWing 793：高精度乘法

#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');
    
    vector<int> C;
    C = mul(A, b);
    
    for(int i = C.size()-1; i>=0; i--) cout << C[i];
    return 0;
}

---

AcWing 794：高精度除法

#include <iostream>
#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()
{
    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');
    
    vector<int> C;
    int r;
    C = div(A, b , r);
    
    for(int i=C.size()-1; i>=0; i--) cout << C[i];
    
    cout << endl << r << endl;
    return 0;
}