基础算法一之高精度运算

高精度加法

#include <iostream>
#include <cmath>
#include <string>
#include <vector>
using namespace std;

vector<int> add(vector<int> &A, vector<int> &B)
{
    vector<int> C;
    if(A.size() < B.size()) return add(B, A);
    
    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(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.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]);
   cout << endl;

   system("pause");
   return 0;
}

高精度减法

#include<iostream>
#include <vector>

// judge if A >= B
bool compare(vector<int> &A, vector<int> &B)
{
	// 1. len(A) != len(B)
	if (A.size() != B.size()) return A.size() > B.size();
	// 2.len(A) == len(B)
	for (int i = A.size()-1; i>=0; i--)
		if (A[i] != B[i]) return A[i] > B[i];
	// 3. A==B
	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;
	}
	// remove pre 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 j = b.size()-1; j>=0; j--) B.push_back(b[j] - '0');
	if (compare(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];
	}
	return 0;
}

高精度乘法

#include <iostream>
#include <vector>

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 + t;
		C.push_back(t % 10);
		t /= 10;
	}
	return C;
}

int main()
{
	string a;
	int b;
	vector<int> A;
	cin >> a >> b;
	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--) cout << C[i];
	return 0;
}

高精度除法

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

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 = 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, r;
	vector<int> A;
	cin >> a >> b;
	for (int i=a.size()-1; i>=0; i--) A.push_back(a[i] - '0');
	auto C = div(A, b, r);
	for (int i=C.size()-1; i>=0; i--) cout << C[i];
	cout << endl << r << endl;

	return 0;
}