[tem]高精度1

 1 //倒着存 B取的低精最大值所以简化了一点
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N=1005,B=1e4,W=4,L=1005;
struct people{
    int a,b,t;
}p[N];
bool cmp(people x,people y){
    return x.t<y.t;
}

struct big{
    int size,d[L];
    big(int a=1):size(a){memset(d,0,sizeof(int)*L);}
    
};
bool bigger(big &a,big &b){
    if(a.size>b.size) return true;
    if(a.size<b.size) return false;
    for(int i=a.size-1;i>=0;i++){
        if(a.d[i]>b.d[i]) return true;
    }
    return false;
}
bool noSmallInt(big &a,int k){    //special
    if(a.size>1) return true;
    if(a.d[0]>=k) return true;
    return false;
}
void clear0(big &a){
    a.size=1;
    memset(a.d,0,sizeof(int)*L);
}
void copy(big &t,big &s){
    t.size=s.size;
    memcpy(t.d,s.d,sizeof(int)*L);
}

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

void jianInt(big &a,int k){
    if(a.d[0]<k){
        int i=1;a.d[0]+=B;
        while(a.d[i]==0) {a.d[i]+=B;i++;}
        a.d[i]--;
        while(i==a.size-1&&a.d[i]==0) a.size--,i--;
    }
    a.d[0]-=k;
}

void addInt(big &a,int k){
    int g,i=0,tmp=a.d[0]+k;
    a.d[0]=tmp%B;
    g=tmp/B;
    while(g){
        tmp=a.d[++i]+g;
        a.d[i]=tmp%B; if(i>a.size-1) a.size=i+1;
        g=tmp/B;
    }
}

void chuInt(big &a,int k){
    int g=0;
    for(int i=a.size-1;i>=0;i--){
        g=g*B+a.d[i];
        a.d[i]=g/k;
        g%=k;
    }
    while(a.d[a.size-1]==0) a.size--;
}