rt，自定义运算符写的，不过有点渣。。

#include<cstdio>
#include<cstring>
using namespace std;
struct num
{
    int fh,l,v[1001];
}x1,x2,san,ans,wu,xx;
int stack[3010],top,l,t,n,x;
char s1[1000010];
int max(int x,int y)
{
	if (x>y)return x;
	return y;
}
void clear(num &p)
{
    p.fh=p.l=0;
    memset(p.v,0,sizeof(p.v));
}
int bj(num a,num b)
{
    if (a.l!=b.l)return a.l>b.l;
    for (int i=a.l;i>=1;i++)
    {
        if (a.v[i]>b.v[i])return 1;
        if (a.v[i]<b.v[i])return 0;
    }
    return 1;
}
num operator /(num a,num b)
{
    num p;clear(p);p.fh=a.fh;p.l=max(a.l,b.l);
    for (int i=1;i<=p.l;i++)
        p.v[i]+=a.v[i]+b.v[i],p.v[i+1]=p.v[i]/10000,p.v[i]%=10000;
    while (p.v[p.l+1]>0)p.v[++p.l+1]=p.v[p.l]/10000,p.v[p.l]%=10000;
    return p;
}
num operator -(num a,num b)
{
    if (a.fh==-1&&b.fh==0){b.fh=-1;return a/b;}
    if (a.fh==0&&b.fh==-1){b.fh=0;return a/b;}
    if (!bj(a,b)){a.fh=-1-a.fh;b.fh=-1-b.fh;return b-a;}
    num p;clear(p);p.fh=a.fh;p.l=max(a.l,b.l);
    for (int i=1;i<=p.l;i++)
        p.v[i]+=a.v[i]-b.v[i],p.v[i+1]=(p.v[i]+10000)/10000-1,p.v[i]=(p.v[i]+10000)%10000;
    while (p.v[p.l]==0&&p.l>1)p.l--;
    return p;
}
num operator +(num a,num b)
{
    if (a.fh==-1&&b.fh==0){a.fh=0;return b-a;}
    if (a.fh==0&&b.fh==-1){b.fh=0;return a-b;}
    if (a.fh==b.fh)return a/b;
}
num operator *(num a,num b)
{
    num p;clear(p);p.fh=(a.fh+b.fh)%2;p.l=a.l+b.l-1;
    for (int i=1;i<=a.l;i++)
        for (int j=1;j<=b.l;j++)
            p.v[i+j-1]+=a.v[i]*b.v[j],p.v[i+j]+=p.v[i+j-1]/10000,p.v[i+j-1]%=10000;
    while (p.v[p.l+1]>0)p.v[++p.l+1]=p.v[p.l]/10000,p.v[p.l]%=10000;
    return p;
}
void write(num a)
{
    if (a.fh==-1)printf("-");
    printf("%d",a.v[a.l]);
    for (int i=a.l-1;i>=1;i--)
    {
        if (a.v[i]<1000)printf("0");
        if (a.v[i]<100)printf("0");
        if (a.v[i]<10)printf("0");
        if (a.v[i]<1)printf("0");
        printf("%d",a.v[i]);
    }
    printf("\n");
}
void read(num &a)
{
	int ln,kt,tot,i;
	scanf("%s",s1+1);
	ln=strlen(s1+1);kt=1;
	tot=1;a.l=1;
	if(s1[1]=='-')a.fh=-1,kt++;
	for(i=ln;i>=kt;i--)
	{
		a.v[a.l]+=(s1[i]-'0')*tot;
		tot=tot*10;
		if(tot==10000)tot=1,a.l++;
	}
	if(!a.v[a.l])a.l--;
}