[tem]高精度2

从1开始

const int N=;
const int B=1e4,L=;

struct big{
    int size,d[L];
    big(int a=):size(a){memset(d,,sizeof(int)*L);}
};

void jia(big &a,big &b){
    int g=,i;
    for(i=;;i++){
        if(g==&&i>a.size&&i>b.size) break;
        int tmp=g;
        if(i<=a.size) tmp+=a.d[i];
        if(i<=b.size) tmp+=b.d[i];
        a.d[i]=tmp%B;
        g=tmp/B;
    }
    a.size=i-;
}

void cheng(big &a,big &b,big &c){
    for(int i=;i<=a.size;i++){
        int g=;
        for(int j=;j<=b.size;j++){
            c.d[i+j-]+=a.d[i]*b.d[j]+g;
            g=c.d[i+j-]/B;
            c.d[i+j-]%=B;
        }
        c.d[i+b.size]=g;
    }
    c.size=a.size+b.size;
    while(c.d[c.size]==&&c.size>) c.size--;
}

void chengInt(big &a,int k){
    int g=,i;
    for(i=;i<=a.size;i++){
        int tmp=a.d[i]*k;
        a.d[i]=(tmp+g)%B;
        g=(tmp+g)/B;
    }
    while(g){
        a.d[++a.size]=g%B;
        g/=B;
    }
}

void copy(big &t,big &s){
    t.size=s.size;
    for(int i=;i<=s.size;i++) t.d[i]=s.d[i];
}

big max(big &a,big &b){
    if(a.size>b.size) return a;
    if(a.size<b.size) return b;
    for(int i=a.size;i>=;i--){
        if(a.d[i]>b.d[i]) return a;
        if(a.d[i]<b.d[i]) return b;
    }
    return a;
}

void print(big &a){
    for(int i=a.size;i>=;i--){
        if(i==a.size);
        else if(a.d[i]<) cout<<"";
        else if(a.d[i]<) cout<<"";
        else if(a.d[i]<) cout<<"";
        cout<<a.d[i];
    }
    cout<<"\n";
}