struct bignum{// 感谢HFUU-QERMint shu[89];int len;bignum(){memset(shu,0,sizeof(shu));}bignum operator = (int a){char b[30];sprintf(b+1,"%d",a);return *this=b;}bool operator < (bignum a) const {if(len!=a.len) return len<a.len;for(int i=a.len;i;i--) if(shu[i]!=a.shu[i]) return shu[i]<a.shu[i];return false;}bool operator == (bignum a){if(len!=a.len) return false;for(int i=a.len;i;i--) if(shu[i]!=a.shu[i]) return false;return true;}bignum operator = (char *a){len=strlen(a+1);for(int i=1;a[i]=='0';i++) len--;for(int i=1;i<=len;i++) shu[i]=a[len-i+1]-'0';return *this;}bool operator > (bignum a) const{return a<*this;}void move(){for(int i=1;i<=len;i++){if(shu[i]>9){if(i==len){shu[++len]=shu[i]/10;shu[i]%=10;}else shu[i+1]+=shu[i]/10,shu[i]%=10;}}}bignum operator + (bignum a){int lm=max(len,a.len);bignum new1;for(int i=1;i<=lm;i++){new1.shu[i]=shu[i]+a.shu[i];}new1.len=lm;new1.move();return new1;}bignum operator * (bignum a){bignum new1;for(int i=1;i<=len;i++)for(int k=1;k<=a.len;k++)new1.shu[i+k-1]+=shu[i]*a.shu[k];new1.len=len+a.len-1;new1.move();return new1;}bignum operator * (int a){bignum e1;e1=a;return (*this)*e1;}bignum operator / (int a){bignum new1;if(len<=2){new1=0;return new1;}else{new1.len=len-2;for(int i=len;i>2;i--) new1.shu[i-2]=shu[i];return new1;}}void print(){long long ans=0;for(int i=len;i;i--) ans=(ans*10+shu[i])%mod;printf("%lld",ans);}}
京公网安备 11010502036488号