模板
_lifehappy_
这个作者很懒,什么都没留下…
展开
-
异或高斯消元模板题(存一个板子)
UVA - 11542/* Author : lifehappy*/#pragma GCC optimize(2)#pragma GCC optimize(3)#include <bits/stdc++.h>using namespace std;typedef long long ll;const int inf = 0x3f3f3f3f;const int N = 2e3 + 10;int prime[N], cnt;bool st[N];struct原创 2020-09-11 20:14:52 · 269 阅读 · 0 评论 -
类欧几里得算法详细推导过程(附带模板)
类欧几里得算法推导初识给出三种形式:f(a,b,c,n)=∑i=0n⌊ai+bc⌋f(a, b, c, n) = \sum_{i = 0} ^{n} \lfloor\frac{ai + b}{c}\rfloorf(a,b,c,n)=∑i=0n⌊cai+b⌋g(a,b,c,n)=∑i=0ni⌊ai+bc⌋g(a, b, c, n) = \sum_{i = 0} ^{n}i \lfloor \frac{ai + b}{c}\rfloorg(a,b,c,n)=∑i=0ni⌊cai+b⌋h(a,原创 2020-08-22 12:06:39 · 927 阅读 · 0 评论 -
F. Ivan and Burgers(前缀线性基模板)
前缀线性基模板F. Ivan and Burgers/* Author : lifehappy*/#pragma GCC optimize(2)#pragma GCC optimize(3)#include <bits/stdc++.h>#define mp make_pair#define pb push_back#define endl '\n'#define mid (l + r >> 1)#define lson rt << 1, l,原创 2020-08-18 11:12:40 · 276 阅读 · 0 评论 -
线性基模板
struct linearbasis { ll base[64], flag, cnt; void add(ll x) { for(int i = 62; ~i; i--) { if(x >> i & 1) { if(!base[i]) { base[i] = x; return ; }原创 2020-08-18 10:35:18 · 215 阅读 · 0 评论 -
权值线段树模板
const int N = 3e5 + 10;ll value[N];struct Tree { ll sum[N << 1], cnt[N << 1]; void update(int rt, int l, int r, int pos, int x) { if(l == r) { cnt[rt] += x; sum[rt] = cnt[rt] * value[l];原创 2020-08-16 11:17:06 · 241 阅读 · 0 评论 -
高斯消元求行列式值(inv)板子
ll A[110][110];const int mod;ll quick_pow(ll a, ll n, ll mod) { ll ans = 1; while(n) { if(n & 1) ans = ans * a % mod; a = a * a % mod; n >>= 1; } return ans;}ll inv(ll a) { return quick_pow(a, mo原创 2020-08-07 16:41:30 · 466 阅读 · 0 评论 -
线段树平方和板子
题目测试链接代码/* Author : lifehappy*/#pragma GCC optimize(2)#pragma GCC optimize(3)#include <bits/stdc++.h>#define mp make_pair#define pb push_back#define endl '\n'#define mid (l + r >> 1)#define lson rt << 1, l, mid#define rson r原创 2020-07-17 21:13:26 · 439 阅读 · 0 评论 -
C(n, m)模板
#include <bits/stdc++.h>#define mp make_pair#define pb push_backusing namespace std;typedef pair<int, int> pii;typedef long long ll;typedef unsigned long long ull;const double eps = 1e-7;const double pi = acos(-1.0);const int inf =原创 2020-06-15 22:16:46 · 600 阅读 · 0 评论