高精度(大数计算)

高精度

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

// C = A + B; 
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(1);
	return C;
}
// C = A + B;

// C = A - B;
bool cmp(string &A,string &B){
    if(A.size() != B.size()) return A.size() > B.size();
    for(int i=0;i<A.size();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;
}
// C = A - B;

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

// C = A / B;
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 %= b;
    }
    reverse(C.begin(), C.end());
    while(C.size() > 1 && C.back() == 0 ) C.pop_back();
    return C;
}
// C = A / B;

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