【模板】高精度。。。。。

真是越学越回去了，颓颓颓~

看到了zky大佬的高精模板    简直tql

兴冲冲打抄了一发

 如下：

struct bignum{
    int num[100];
    bignum(){num[0]=1;}
    void set(long long x){
        memset(num,0,sizeof(num));
        while (x) num[++num[0]] =x%10,x/=10; 
        if(!num[0]) num[0]=1;
    }
    void show(){
        for(int i=num[0];i>=1;--i)
        putchar(num[i]+'0');
    }
    bignum operator + (bignum b) const {
        bignum c;
        c.set(0);
        c.num[0]=max(num[0]+b.num[0])+1;
        for(int i=1;i<=num[i];i++){
            c.num[i]+=num[i]+b.num[i];
            c.num[i+1]+=c.num[i]/10;
            c.num[i]%=10;
        }
        while (c.num[0]>1 && !c.num[c.num[0]]) 
            c.num[0]--;
        return c;
    }
    bignum operator * (bignum b) const {
        bignum c;
        c.set(0);
        c.num[0]=num[0]+b.num[0]+1;
        for(int i=1;i<=num[i];i++)
        　　for(int j=1;j<=b.num[0];j++){
           　　 c.num[i-j+1]+=num[i]*b.num[j];
           　　 c.num[i-j]+=c.num[i-j+1]/10;
           　　 c.num[i-j+1]%=10;
        }
        while (c.num[0]>1 && !c.num[c.num[0]]) 
            c.num[0]--;
        return c;
    }
    bool operator < (bignum b) const {
        if(num[0]<b.num[0]) return true;
        if(num[0]>b.num[0]) return false;
        for(int i=num[0];i>=1;i--){
            if(num[i]<b.num[i]) return true;
            if(num[i]>b.num[i]) return false;
        }    
        return false;
    }
};

附% and -

struct bignum{
    int len, s[MAXN];
    bignum() {
        len = 0; 
        memset(s, 0, sizeof(s)); 
    }
};
char str[10000 + 5];
bignum operator - (bignum a, const bignum& b){
    for(int i = a.len; i >= 1; i--){
        a.s[i] -= b.s[i];
        if(a.s[i] < 0) {
            a.s[i+1]--, a.s[i] += base;
        }
    }
    while(!a.s[a.len] && a.len > 0) {
        a.len--;
    }
    return a;
}
bool judge(bignum a, bignum b) {
    if(a.len != b.len) return a.len > b.len;
    for(int i = a.len; i >= 1; i--){
        if(a.s[i] != b.s[i]) return a.s[i] > b.s[i];
    }
    return true;
}
bignum operator % (bignum a, bignum b){
    while(judge(a, b)) {
        a = a - b;
    }
    return a;
}