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;
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)
struct linearbasis { ll base[64], flag, cnt; void add(ll x) { for(int i = 62; ~i; i--) { if(x >> i & 1) {
题目测试链接代码/* 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)
前缀线性基模板F. Ivan and Burgers/* Author : lifehappy*/#pragma GCC optimize(2)#pragma GCC optimize(3)#include <bits/stdc++.h>
#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 =
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号