Ripped的博客

求n个人，每次报m次出队，求第k个出队的人f[n][k]=(f[n−1][k−1]+m−1)%nf[n][k]=(f[n-1][k-1]+m-1)\%nf[n][k]=(f[n−1][k−1]+m−1)%n时间复杂度为O(k)O(k)O(k)当kkk很大但是m<<nm<<nm<<n时，可以把多次(m−1)(m-1)(m−1)加在一起，一起取模#inclu...

FFT:FFT:FFT: Ck=∑i+j=kAi∗BjC_k=\sum_{i+j=k}A_i*B_jCk​=∑i+j=k​Ai​∗Bj​FWT:FWT:FWT: Ck=∑i⊕j=kAi∗BjC_k=\sum_{i \oplus j=k}A_i*B_jCk​=∑i⊕j=k​Ai​∗Bj​#include<cstdio>using namespace std;const int N...

#include <bits/stdc++.h>using namespace std;const int N=100050;const int M=100050;int n,m;struct Edge{int v,next;}edge[M];int cnt,head[N];void init() {cnt=0; memset(head,-1,sizeof(head));...

线性基插入void insert(int rt,ll x){ int i; fd(i,31,0) if (x & (1<<i)) if (basis[rt][i] == 0) { basis[rt][i] = x; return; } else x =...

查询区间k小值输入n个数，每次询问某一区间内的第k小值。样例输入7 31 5 2 6 3 7 42 5 34 4 11 7 3样例输出563#include<cmath>#include<cstdio>#include<vector>#include<cstring>#include<iomanip>#i...

a ^ a ^ a ^ … ^ b % m#include <bits/stdc++.h>#define fo(i,a,b) for(i=a;i<=b;i++)using namespace std;const int maxn=1e6+5;typedef long long ll;int minDiv[maxn],phi[maxn],sum[maxn];int T...