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

类欧几里得算法推导 初识 给出三种形式： 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=0n​i⌊cai+b​⌋ h(a,

前缀线性基模板 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,

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 ; }

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];

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

题目测试链接 代码 /* 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

#include <bits/stdc++.h> #define mp make_pair #define pb push_back using 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 =