闫总算法基础课第二章笔记---高精度模板

1、高精度

A+B

1)大整数在数组倒叙存储；

2)竖式运算

#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)
	{
		//相加t = A[i] + B[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;
	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)
		cout << C[i];
	return 0;
}

2、高精度减法

#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];
	}
	//A和B结果相等 
	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');
	if(cmp(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;
}

3、高精度乘法A*b

#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;
	}
	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--)
		cout << C[i];
	return 0;
}

4、高精度A/b

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> divid(vector<int> &A, int b, int r)
{
	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;
	vector<int> A;
	cin >> a >> b;
	for(int i = a.size() - 1; i >= 0; --i)
		A.push_back(a[i] - '0');
	int r = 0;
	auto C = divid(A, b, r);
	for(int i = C.size() - 1; i >= 0; --i)
		cout << C[i];
	cout << " " << r << endl;
	return 0;
}