高精度算法

当就算是long long（或int64）还不够怎么办？用高精度算法。自己动手丰衣足食。——洛谷hh

高精度加法

#include<iostream>
#include<vector>
using namespace std;
//C = A + B;
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; 
	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 = add(A,B);
	
	for(int i = C.size() - 1;i >= 0; i--) cout<<C[i];
	return 0;
}

高精度减法

#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;	 
}
//C = A - B;
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');
	
	if(cmp(A,B))
	{
		vector<int> C = sub(A,B);
		
		for(int i = C.size() - 1;i >= 0; i--) cout<<C[i];
	}
	else
	{
		vector<int> C = sub(B,A);
			cout<<"-";
		for(int i = C.size()- 1 ; i >= 0 ;i--)
		cout<<C[i];
	}
	return 0;

}

高精度乘法（洛谷）

#include<iostream>
#include<vector>
const int N = 5e5 +10;
using namespace std;
int A[N],B[N],C[N];

//C = A * B 
int mul(int size_A,int size_B)
{
	
	for(int i = 1; i <= size_A; i++)
		for(int j = 1; j <= size_B ; j++)
		{ 
			C[i + j - 1] += A[i] * B[j];
		} 
	int len = size_A + size_B;
	for(int i = 1; i < len; i++ )
	{
		if(C[i] > 9)
		{
			C[i + 1] += C[i] / 10;
			C[i] %= 10;//进位
		}
			 
	}
	while(C[len] == 0 && len > 1) len-- ;//去前导0 
	return len;	
}
int main() 
{
	string a,b;
	cin>>a>>b;
	
 	for(int i=1;i<=a.size();i++) A[i]=a[a.size()-i]-'0';
    for(int i=1;i<=b.size();i++) B[i]=b[b.size()-i]-'0';

	int Len= mul(a.size(),b.size());
		
	for(int i = Len;i >= 1; i-- ) 
		cout<<C[i];
	return 0; 
}

高精度乘低精度

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

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

高精度除法（高精/低）

#include<iostream>
#include<algorithm> 
#include<vector>
using namespace std;

//A / b  商C 余r 
vector<int> div(vector<int> &A,vector<int> &B)
{
	vector<int> C;
	for(int i = 1; i <= A.size(); i++)
		for(int j = 1; j <= B.size(); j++)
			C[i + j -1] += A[i] * B[i];
	
	while(C.size() > 1 && C.back() == 0) C.pop_back(); 
	
	return C;
}
int main() 
{
	string a,b;

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