boolcheck(int x){/* ... */}// 检查x是否满足某种性质// 区间[l, r]被划分成[l, mid]和[mid + 1, r]时使用:intbsearch_1(int l,int r){while(l < r){int mid = l + r >>1;if(check(mid)) r = mid;// check()判断mid是否满足性质else l = mid +1;}return l;}// 区间[l, r]被划分成[l, mid - 1]和[mid, r]时使用:intbsearch_2(int l,int r){while(l < r){int mid = l + r +1>>1;if(check(mid)) l = mid;else r = mid -1;}return l;}
浮点数二分模版
boolcheck(double x){/* ... */}// 检查x是否满足某种性质doublebsearch_3(double l,double r){constdouble eps =1e-6;// eps 表示精度,取决于题目对精度的要求, 精度为小数点后面6位有效数字,这里就写1e-8// printf("%.6f\n", l); 直接这样输出while(r - l > eps){double mid =(l + r)/2;if(check(mid)) r = mid;else l = mid;}return l;}
高精度加法
// C = A + B, A >= 0, B >= 0
vector<int>add(vector<int>&A, vector<int>&B){if(A.size()< B.size())returnadd(B, A);
vector<int> C;int t =0;for(int i =0; i < A.size(); i ++){
t += A[i];if(i < B.size()) t += B[i];
C.push_back(t %10);
t /=10;}if(t) C.push_back(t);return C;}
高精度减法
// C = A - B, 满足A >= B, A >= 0, B >= 0
vector<int>sub(vector<int>&A, vector<int>&B){
vector<int> C;for(int i =0, t =0; i < A.size(); i ++){
t = A[i]- t;if(i < B.size()) t -= B[i];
C.push_back((t +10)%10);if(t <0) t =1;else t =0;}while(C.size()>1&& C.back()==0) C.pop_back();return C;}
高精度乘低精度
// C = A * b, A >= 0, b > 0
vector<int>mul(vector<int>&A,int b){
vector<int> C;int t =0;for(int i =0; i < A.size()|| t; i ++){if(i < A.size()) t += A[i]* b;
C.push_back(t %10);
t /=10;}while(C.size()>1&& C.back()==0) C.pop_back();return C;}
高精度除以低精度
// A / b = C ... r, A >= 0, b > 0
vector<int>div(vector<int>&A,int b,int&r){
vector<int> C;
r =0;for(int i = A.size()-1; i >=0; i --){
r = r *10+ A[i];
C.push_back(r / b);
r %= b;}reverse(C.begin(), C.end());while(C.size()>1&& C.back()==0) C.pop_back();return C;}