高精度开跟模板
Posted adelalove
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了高精度开跟模板相关的知识,希望对你有一定的参考价值。
实质:二分+高精度乘法
1 struct node { 2 typedef ll INT; 3 static const INT S=100000000; 4 static const int S_n=9; 5 static const int SIZE=305; 6 INT a[SIZE]; int len, tag; 7 node() { len=1; CC(a, 0); } 8 node(char *s) { len=1; CC(a, 0); *this=s; } 9 node(INT x) { len=1; CC(a, 0); *this=x; } 10 void cln() { memset(a, 0, sizeof(INT)*(len+1)); len=1; tag=0; } 11 void fix() { while(len>1 && !a[len]) --len; } 12 void M(node &a, node &b, node &c) { 13 if(b.tag) { b.tag=0; P(a, b, c); b.tag=1; return; } 14 if(a.tag) { a.tag=0; P(a, b, c); a.tag=1; c.tag=1; return; } 15 c.cln(); 16 int flag=0, i=1; 17 node *x=&a, *y=&b; 18 if(a<b) flag=1, swap(x, y); 19 for(; i<=x->len; ++i) { 20 c.a[i]+=x->a[i]-y->a[i]; 21 if(c.a[i]<0) c.a[i]+=S, --c.a[i+1]; 22 } 23 c.len=i; 24 c.fix(); 25 c.tag=flag; 26 } 27 void P(node &a, node &b, node &c) { 28 if(b.tag) { b.tag=0; M(a, b, c); b.tag=1; return; } 29 if(a.tag) { a.tag=0; M(b, a, c); a.tag=1; return; } 30 c.cln(); 31 int i=1, l=max(a.len, b.len); INT k=0; 32 for(; i<=l || k; ++i) { 33 c.a[i]=a.a[i]+b.a[i]+k; 34 k=c.a[i]/S; 35 if(c.a[i]>=S) c.a[i]%=S; 36 } 37 c.len=i; 38 c.fix(); 39 } 40 void T(node &a, node &b, node &c) { 41 c.cln(); 42 for1(i, 1, a.len) for1(j, 1, b.len) { 43 int pos=i+j-1; 44 c.a[pos]+=a.a[i]*b.a[j]; 45 c.a[pos+1]+=c.a[pos]/S; 46 c.a[pos]%=S; 47 } 48 c.len=a.len+b.len; 49 c.fix(); 50 c.tag=a.tag^b.tag; 51 if(c.a[1]==0 && c.len==1) c.tag=0; 52 } 53 void D(node &a, INT b, node &c) { 54 c.cln(); INT t=0; 55 for(int i=len; i; --i) { 56 c.a[i]=(a.a[i]+t)/b; 57 t=((a.a[i]+t)%b)*S; 58 } 59 c.len=len; 60 c.fix(); 61 } 62 void D(node &a, node &b, node &c) { 63 c.cln(); 64 node l, r=a, mid, TP, ONE=(INT)1; 65 while(l<=r) { 66 P(l, r, TP); D(TP, 2, mid); 67 T(mid, b, TP); 68 if(TP<=a) P(mid, ONE, l); 69 else M(mid, ONE, r); 70 } 71 M(l, ONE, c); 72 c.tag=a.tag^b.tag; 73 if(c.a[1]==0 && c.len==1) c.tag=0; 74 } 75 node sqrt() { 76 node l, r=*this, mid, TP, ONE=(INT)1; 77 while(l<=r) { 78 P(l, r, TP); D(TP, 2, mid); 79 T(mid, mid, TP); 80 if(TP<=*this) P(mid, ONE, l); 81 else M(mid, ONE, r); 82 } 83 M(l, ONE, TP); 84 return TP; 85 } 86 bool operator<(node &b) { 87 if(b.tag && !tag) return 0; 88 if(!b.tag && tag) return 1; 89 if(b.tag && tag) { tag=b.tag=0; bool ret=b<*this; tag=b.tag=1; return ret; } 90 if(len!=b.len) return len<b.len; 91 for3(i, len, 1) if(a[i]<b.a[i]) return true; else if(a[i]>b.a[i]) return false; //这里一定要注意 92 return false; 93 } 94 node& operator= (INT b) { 95 cln(); 96 len=0; 97 if(b==0) { len=1; return *this; } 98 if(b<0) tag=1, b=-b; 99 while(b) { a[++len]=b%S; b/=S; } 100 return *this; 101 } 102 node& operator= (char *s) { 103 cln(); 104 if(s[0]==‘-‘) tag=1, ++s; 105 len=0; int l=strlen(s), t=0, k=1; 106 for3(i, l-1, 0) { 107 t=t+(s[i]-‘0‘)*k; 108 k*=10; 109 if(k>=S) a[++len]=t%S, t=0, k=1; 110 } 111 if(k!=1) a[++len]=t%S; 112 return *this; 113 } 114 node& operator= (const node &x) { 115 cln(); 116 memcpy(a, x.a, sizeof(INT)*(x.len+1)); 117 len=x.len, tag=x.tag; 118 return *this; 119 } 120 node operator+ (node x) { node c; P(*this, x, c); return c; } 121 node operator- (node x) { node c; M(*this, x, c); return c; } 122 node operator* (node x) { node c; T(*this, x, c); return c; } 123 node operator/ (node x) { node c; D(*this, x, c); return c; } 124 node operator/ (INT x) { node c; D(*this, x, c); return c; } 125 node& operator+= (node x) { node c; P(*this, x, c); return *this=c; } 126 node& operator-= (node x) { node c; M(*this, x, c); return *this=c; } 127 node& operator*= (node x) { node c; T(*this, x, c); return *this=c; } 128 node& operator/= (node x) { node c; D(*this, x, c); return *this=c; } 129 node& operator/= (INT x) { node c; D(*this, x, c); return *this=c; } 130 node& operator++ () { return *this+=1; } 131 node operator++ (int) { node ret=*this; ++*this; return ret; } 132 node& operator-- () { return *this-=1; } 133 node operator-- (int) { node ret=*this; --*this; return ret; } 134 bool operator> (node &x) { return x<*this; } 135 bool operator== (node &x) { return x<=*this&&x>=*this; } 136 bool operator<= (node &x) { return !(x<*this); } 137 bool operator>= (node &x) { return !(x>*this); } 138 void P() { 139 if(tag) putchar(‘-‘); 140 printf("%d", (int)a[len]); 141 char od[8]; od[0]=‘%‘; od[1]=‘0‘; 142 sprintf(od+2, "%d", S_n-1); 143 int l=strlen(od); od[l]=‘d‘; od[l+1]=‘