qq_43520313的博客

题目求xn‾=∑i=0n[ni]xix^{\overline{n}}=\sum_{i=0}^{n}\begin{bmatrix}n\\i\end{bmatrix}x^ixn=i=0∑n​[ni​]xi在取模modmodmod意义下思路x2k‾=xk‾(x+k)k‾x^{\overline{2k}}=x^{\overline{k}}(x+k)^{\overline{k}}x2k=xk(x+k)k。假设知道xk‾x^{\overline{k}}xk就能快速求出(x+k)k‾(x+k)^{\over

题目https://uoj.ac/problem/269给定mmm次多项式f(x),n,xf(x),n,xf(x),n,x，求Q(f,n,x)=∑i=0nf(i)(ni)xi(1−x)n−iQ(f,n,x)=\sum_{i=0}^{n}f(i){n\choose i}x^i(1-x)^{n-i}Q(f,n,x)=i=0∑n​f(i)(in​)xi(1−x)n−if(x)f(x)f(x)给定点值表示法。n≤109n\le 10^9n≤109思路把多项式转换成下降幂表示，假设f(x)=∑i=0

对于n−1n-1n−1次多项式f(x)f(x)f(x)，给定a0,a1..an−1a_0,a_1..a_{n-1}a0​,a1​..an−1​，其中ai=f(i)a_i=f(i)ai​=f(i)，求f(x)f(x)f(x)得下降幂表示。即f(x)=∑i=0n−1fixi‾[x≥i]f(x)=\sum_{i=0}^{n-1}f_ix^{\underline{i}}[x\ge i]f(x)=i=0∑n−1​fi​xi​[x≥i]求出fif_ifi​f(i)=∑j=0n−1fjij‾[i≥j]0≤i≤n

#include<bits/stdc++.h>#define ll long longusing namespace std;const double Pi=acos(-1.0);const int N=2100009;const ll mod=998244353,G=3;//G是mod的原根ll a[N],b[N],c[N],d[N],f[N],p[N],p1[N],Gi,_inv;//Gi是原根的逆元,inv是lim的逆元int n,m,bit,lim,r[N];//lim表示

#include<bits/stdc++.h>#define ll long longusing namespace std;const int N=2100009;const ll mod=998244353,G=3;//G是mod的原根int n,m;ll a[N],b[N];int bit,lim,r[N];//lim表示当前运算的长度ll ln[N],inv[N],tmp[N],diff[N],integral[N],sqr[N],quotient[N],remain

给定两个数组aaa，bbb，求ccc满足ci=∑j=0iajbi−j0≤i≤n−1c_i=\sum_{j=0}^{i}a_jb_{i-j}\quad 0\le i\le n-1ci​=j=0∑i​aj​bi−j​0≤i≤n−1如果aaa或者bbb有一段前缀为000，比如a0=a1=a2=...=ak=0a_0=a_1=a_2=...=a_k=0a0​=a1​=a2​=...=ak​=0，那么不用计算就知道了c0=c1=c2=...=ck=0c_0=c_1=c_2=...=c_k=0c0​=c1​=c

给定多项式F(x)F(x)F(x)和G(x)G(x)G(x)，求F(x)F(x)F(x)除以G(x)G(x)G(x)的商Q(x)Q(x)Q(x)和余数R(x)R(x)R(x)。即F(x)=Q(x)G(x)+R(x)Deg(R)<Deg(G)<Deg(F)F(x)=Q(x)G(x)+R(x)\quad Deg(R)<Deg(G)<Deg(F)F(x)=Q(x)G(x)+R(x)Deg(R)<Deg(G)<Deg(F)首先构造FR(x)=xDeg(F)F(1x)F

给定多项式G(x)G(x)G(x)，已知A(x)A(x)A(x)满足G(A(x))≡0  mod  xnG(A(x))\equiv 0\;mod\;x^nG(A(x))≡0modxn求模xnx^nxn意义下的A(x)A(x)A(x)倍增法首先解出[x0]G(A(x))≡0  mod  x\begin{aligned}[x^0]G(A(x))\equiv 0\;mod\;x\end{aligned}[x0]G(A(x))≡0modx​这时候A(x)  mod  xA(x)\;mod\;

C0=1C_0=1C0​=1有递推式Cn=∑i=0n−1CiCn−1−iC_n=\sum_{i=0}^{n-1}C_iC_{n-1-i}Cn​=i=0∑n−1​Ci​Cn−1−i​设CnC_nCn​的生成函数为A=∑i=0∞CixiA=\sum_{i=0}^{\infty}C_ix^iA=∑i=0∞​Ci​xi，则A2=∑i=0∞∑j=0iCiCi−jxiA^2=\sum_{i=0}^{\infty}\sum_{j=0}^{i}C_iC_{i-j}x^iA2=i=0∑∞​j=0∑i​Ci​C

题目：https://www.luogu.com.cn/problem/P5162思路：设总的方案数为gng_ngn​，所有方案的层数的总数为fnf_nfn​，则答案就是fngn\frac{f_n}{g_n}gn​fn​​。先算gng_ngn​gn=∑i=1n(ni)gn−ig_n=\sum_{i=1}^{n}{n\choose i}g_{n-i}gn​=i=1∑n​(in​)gn−i​含义就是我们枚举第一层里都有哪些积木，再乘上剩下的积木贡献的方案数gn−ig_{n-i}gn−i​，化简。

#include<bits/stdc++.h>#define ll long longusing namespace std;const double Pi=acos(-1.0);const int N=2100009;const ll mod=998244353,G=3;//G是mod的原根ll A[N],B[N],C[N],D[N],E[N];//多次使用记得清空ll p[N],p1[N],Gi,_inv;//Gi是原根的逆元,_inv是lim的逆元int n,m;int

泰勒公式f(x)=∑i=0∞f(i)(x0)i!(x−x0)i\begin{aligned}f\left( x\right) =\sum ^{\infty }_{i=0}\dfrac {f^{(i)}\left( x_{0}\right) }{i!}\left( x-x_{0}\right) ^{i}\end{aligned}f(x)=i=0∑∞​i!f(i)(x0​)​(x−x0​)i​