高精度

是时候结束这个局面了。。

说真的，有了模板一切都好说。

A+B

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 5 using namespace std; 6 7 const int MAXN = 10001; 8 9 char c[MAXN]; 10 11 inline char *read() 12 16 17 struct Big_int 18 25 inline void operator = (char *c) 26 30 inline void operator = (int x) 31 38 } 39 inline void print() 40 45 }; 46 47 inline Big_int operator + (const Big_int x, const Big_int y) 48 57 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 58 return ret; 59 } 60 61 inline bool operator < (const Big_int x, const Big_int y) 62 70 71 inline Big_int operator (Big_int x, Big_int y) 72 83 ret.s[i] = x.s[i] y.s[i]; 84 } 85 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 86 return ret; 87 } 88 89 inline Big_int operator * (const Big_int x, const Big_int y) 90 100 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 101 return ret; 102 } 103 104 Big_int a, b, ans; 105 106 int main() 107
View Code

AB

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 5 using namespace std; 6 7 const int MAXN = 10001; 8 9 char c[MAXN]; 10 11 inline char *read() 12 16 17 struct Big_int 18 25 inline void operator = (char *c) 26 30 inline void operator = (int x) 31 38 } 39 inline void print() 40 45 }; 46 47 inline Big_int operator + (const Big_int x, const Big_int y) 48 57 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 58 return ret; 59 } 60 61 inline bool operator < (const Big_int x, const Big_int y) 62 70 71 inline Big_int operator (Big_int x, Big_int y) 72 83 ret.s[i] = x.s[i] y.s[i]; 84 } 85 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 86 return ret; 87 } 88 89 Big_int a, b, ans; 90 91 int main() 92
View Code

A*B

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 5 using namespace std; 6 7 const int MAXN = 10001; 8 9 char c[MAXN]; 10 11 inline char *read() 12 16 17 struct Big_int 18 25 inline void operator = (char *c) 26 30 inline void operator = (int x) 31 38 } 39 inline void print() 40 45 }; 46 47 inline Big_int operator + (const Big_int x, const Big_int y) 48 57 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 58 return ret; 59 } 60 61 inline bool operator < (const Big_int x, const Big_int y) 62 70 71 inline Big_int operator (Big_int x, Big_int y) 72 83 ret.s[i] = x.s[i] y.s[i]; 84 } 85 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 86 return ret; 87 } 88 89 inline Big_int operator * (const Big_int x, const Big_int y) 90 100 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 101 return ret; 102 } 103 104 Big_int a, b, ans; 105 106 int main() 107
View Code

数楼梯（高精fib）

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 5 using namespace std; 6 7 const int MAXN = 10001; 8 9 char c[MAXN]; 10 11 inline char *read() 12 16 17 struct Big_int 18 25 inline void operator = (char *c) 26 30 inline void operator = (int x) 31 38 } 39 inline void print() 40 45 }; 46 47 inline Big_int operator + (const Big_int x, const Big_int y) 48 57 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 58 return ret; 59 } 60 61 inline bool operator < (const Big_int x, const Big_int y) 62 70 71 inline Big_int operator (Big_int x, Big_int y) 72 83 ret.s[i] = x.s[i] y.s[i]; 84 } 85 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 86 return ret; 87 } 88 89 inline Big_int operator * (const Big_int x, const Big_int y) 90 100 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 101 return ret; 102 } 103 104 int n; 105 Big_int a, b, ans; 106 107 int main() 108 118 ans.print(); 119 return 0; 120 }
View Code

B进制星球（随便改改模板即可）

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 5 using namespace std; 6 7 const int MAXN = 10001; 8 9 int n; 10 char c[MAXN]; 11 12 inline char *read() 13 17 18 struct Big_int 19 26 inline void operator = (char *c) 27 33 inline void operator = (int x) 34 41 } 42 inline void print() 43 50 }; 51 52 inline Big_int operator + (const Big_int x, const Big_int y) 53 62 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; return ret; 64 } 65 66 inline bool operator < (const Big_int x, const Big_int y) 67 75 76 inline Big_int operator (Big_int x, Big_int y) 77 88 ret.s[i] = x.s[i] y.s[i]; 89 } 90 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 91 return ret; 92 } 93 94 inline Big_int operator * (const Big_int x, const Big_int y) 95 105 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 106 return ret; 107 } 108 109 Big_int a, b, ans; 110 111 int main() 112
View Code

国王游戏。。。

（高精除以低精，更好写。。）

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <algorithm> 5 #define N 1001 6 7 using namespace std; 8 9 int n, b; 10 11 struct node 12 p[N]; 15 16 const int MAXN = 10001; 17 18 char c[MAXN]; 19 20 inline char *read() 21 25 26 struct Big_int 27 34 inline void operator = (char *c) 35 39 inline void operator = (int x) 40 48 } 49 inline void print() 50 55 }; 56 57 inline Big_int operator + (const Big_int x, const Big_int y) 58 67 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 68 return ret; 69 } 70 71 inline bool operator < (const Big_int x, const Big_int y) 72 80 81 inline Big_int operator (Big_int x, Big_int y) 82 93 ret.s[i] = x.s[i] y.s[i]; 94 } 95 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 96 return ret; 97 } 98 99 inline Big_int operator * (const Big_int x, const Big_int y) 100 110 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 111 return ret; 112 } 113 114 inline Big_int operator / (Big_int x, int y) 115 123 ret.idx = x.idx; 124 while(!ret.s[ret.idx 1] && ret.idx > 1) ret.idx; 125 return ret; 126 } 127 128 inline Big_int Big(int x) 129 134 135 inline Big_int max(const Big_int x, const Big_int y) 136 139 140 inline bool cmp(node x, node y) 141 144 145 Big_int a, ans; 146 147 int main() 148 160 ans.print(); 161 return 0; 162 }
View Code

上一篇：[luoguP2949] [USACO09OPEN]工作调度Work Scheduling（贪心 + 优先队列）

下一篇：[luoguP2890] [USACO07OPEN]便宜的回文Cheapest Palindrome（DP）

---

模板 高精度