高精度减法 模板

#include<iostream>
#include<vector>
using namespace std;
const int N = 100000;
bool cmp(vector<int> &a,vector<int> &b){
    if(a.size()!=b.size())return a.size()>b.size();
    else
        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;
    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 = 0;
        // else t = 1;
        if(t<0){
            c.push_back((10+t));
            t = 1;
        }else {
            c.push_back(t);
            t = 0;
        }
    }
    while (c.size() > 1&&c.back() == 0) c.pop_back();
    return c;
    
}
int main(){
    string a,b;
    cin>>a>>b;
    vector<int>A,B,c;
    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)){
       c = sub(A,B);
       for(int i = c.size()-1;i>=0;i--)cout<<c[i];
        
    }
    else{
       c = sub(B,A);
       cout<<"-";
       for(int i = c.size()-1;i>=0;i--)cout<<c[i];
    }
    
}