高精度模板

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<cmath>
#include<ctime>
#include<cstring>
#define yyj(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout);
#define llg long long
#define maxn 60100
#define RG register llg
using namespace std;
llg m,T,L,mi,jz,jzw;
struct node
{
    llg len,z[maxn/7];
}a,b,ling;

char s[maxn];

inline llg compare(node a,node b)
{
    if (a.len>b.len) return 1;
    if (a.len<b.len) return -1;
    for (RG i=a.len;i>0;i--)
    {
        if (a.z[i]>b.z[i]) return 1;
        if (a.z[i]<b.z[i]) return -1;
    }
    return 0;
}

node numcpy(node p,llg det)
{
    node c;
    memset(c.z,0,sizeof(c));
    for (RG i=1;i<=p.len;i++) c.z[i+det-1]=p.z[i];
    c.len=p.len+det-1;
    return c;
}

inline node operator +(node a,node b)
{
    node c;
    memset(c.z,0,sizeof(c.z));
    c.len=max(a.len,b.len);
    for (RG i=1;i<=c.len;i++) c.z[i]=a.z[i]+b.z[i];
    for (RG i=1;i<=c.len;i++) {c.z[i+1]+=c.z[i]/jz; c.z[i]=c.z[i] % jz;}
    if (c.z[c.len+1]!=0) c.len++;
    return c;
}

inline node operator -(node a,node b)
{
    node c;
    memset(c.z,0,sizeof(c.z));
    c.len=max(a.len,b.len);
    for (RG i=1;i<=c.len;i++) c.z[i]=a.z[i]-b.z[i];
    for (RG i=1;i<=c.len;i++) if (c.z[i]<0) c.z[i]+=jz,c.z[i+1]--;
    while (c.z[c.len]==0 && c.len>1) c.len--;
    return c;
}

inline node operator *(node a,node b)
{
    node c;
    llg x=0;
    memset(c.z,0,sizeof(c.z));
    for (RG i=1;i<=a.len;i++)
    {
        x=0;
        for (RG j=1;j<=b.len;j++)
        {
            c.z[i+j-1]+=a.z[i]*b.z[j]+x;
            x=c.z[i+j-1]/jz;
            c.z[i+j-1]%=jz;
        }
        c.z[i+b.len]=x;
    }
    c.len=min(a.len+b.len,(llg)maxn-10);
    while (c.z[c.len]==0 && c.len>1) c.len--;
    return c;
}

inline node operator /(node a,node b)
{
    node c;
    memset(c.z,0,sizeof(c.z));
    c.len=a.len-b.len+1;
    if (compare(a,b)==-1) 
    {
        c.len=1;
        return c;
    }
    else
    {
        for (RG i=c.len;i>=1;i--)
        {
            node tmp=numcpy(b,i);
            while (compare(a,tmp)>=0) 
            {
                c.z[i]++; a=a-tmp;
            }
        }
        while (c.len>1 && c.z[c.len]==0) c.len--;
    }
    return c;
}

inline node operator %(node a,node b)
{
    node c;
    memset(c.z,0,sizeof(c.z));
    c.len=a.len-b.len+1;
    if (compare(a,b)==-1) 
    {
        return a;
    }
    else
    {
        for (RG i=c.len;i>=1;i--)
        {
            node tmp=numcpy(b,i);
            while (compare(a,tmp)>=0) 
            {
                c.z[i]++; a=a-tmp;
            }
        }
        while (c.len>1 && c.z[c.len]==0) c.len--;
    }
    return a;
}

inline node operator ^(node a,llg mi)
{
    node c;
    memset(c.z,0,sizeof(c.z));
    c.len=1,c.z[1]=1;
    while (mi!=0)
    {
        if (mi%2) c=c*a;
        mi/=2;
        a=a*a;
    }
    return c;
}

inline void in_()
{
    scanf("%lld",&m);
    ling.len=1;
    if (m!=4 && m!=5 && m!=8)
    {
        jz=(llg)1e8,jzw=8;
    }
    else
    {
        jz=10,jzw=1;
    }
    scanf("%s",s+1);
    L=strlen(s+1);
    memset(a.z,0,sizeof(a.z));
    a.len=1;
    llg p=0,x=1;
    for (RG i=1;i<=L;i++)
    {
        if (p==jzw)
        {
            p=x=1;
            a.len++;
            a.z[a.len]+=(s[L-i+1]-'0')*x;
            x*=10;
        }
        else
        {
            p++;
            a.z[a.len]+=x*(s[L-i+1]-'0');
            x*=10;
        }
    }
    if (m!=7)
    {
        scanf("%s",s+1);
        L=strlen(s+1);
        b.len=1; p=0; x=1;
        memset(b.z,0,sizeof(b.z));
        for (RG i=1;i<=L;i++)
        {
            if (p==jzw)
            {
                p=x=1;
                b.len++;
                b.z[b.len]=(s[L-i+1]-'0')*x;
                x*=10;
            }
            else
            {
                p++;
                b.z[b.len]+=x*(s[L-i+1]-'0');
                x*=10;
            }
        }
    }
    else
    {
        scanf("%lld",&mi);
    }
}

inline void swap_(node &a,node &b)
{
    node c;
    c.len=a.len;
    for (RG i=1;i<=a.len;i++) c.z[i]=a.z[i];
    a.len=b.len;
    for (RG i=1;i<=b.len;i++) a.z[i]=b.z[i];
    b.len=c.len;
    for (RG i=1;i<=c.len;i++) b.z[i]=c.z[i];
}

inline void dg_(llg x)
{
    if (x!=0) dg_(x/10);
    if (x!=0) printf("%lld",x%10);
}

inline void dg(llg x,llg sd)
{
    if (sd<jzw) dg(x/10,sd+1);
    printf("%lld",x%10);
}

inline void oupt(node a)
{
    if (a.len<=1 && a.z[1]==0)
    {
        printf("0
");
        return ;
    }
    dg_(a.z[a.len]);
    for (RG i=a.len-1;i>=1;i--)
    {
        dg(a.z[i],1);
    }
    printf("
");
}

inline node gcd(node a,node b) 
{
    if (compare((a%b),ling)!=1) 
        return b; 
    else return gcd(b,a%b);
} 

int main()
{
    yyj("lazy");
    cin>>T;
    while (T--)
    {
        in_();
        if (m==1)
        {
            oupt(a+b);
        }
        if (m==2)
        {
            //node c=a-b;
            oupt(a-b);
        }
        if (m==3)
        {
            oupt(a*b);
        }
        if (m==4)
        {
            //    node c=a/b;
            oupt(a/b);
        }
        if (m==5)
        {
            oupt(a%b);
        }
        if (m==6)
        {
            cout<<"FUCK";
        }
        if (m==7)
        {
            node c;
            memset(c.z,0,sizeof(c.z));
            c.len=1,c.z[1]=1;
            while (mi!=0)
            {
                if (mi%2) c=c*a;
                mi/=2;
                a=a*a;
            }
            oupt(c);
        }
        if (m==8)
        {
            oupt(gcd(a,b));
        }
        if (m==9)
        {
            cout<<"FUCK!";
        }
    }
    return 0;
}