折戟沉沙

#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #include<cstdlib> #include<vector> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fod(i,a,b) for(int i=a;i>=b;

一开始以为是找循环节 晕 一 一+ x∗2m≡l(modn+1)x*2^m\equiv l (mod n+1) x≡l∗(n/2+1)mx\equiv l*(n/2+1)^mCode:#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #define fo(i,a,b

题目链接 思路:先考虑只有k的请况,设f[i]为出现i种颜色的种数 k⋅(k−1)n−1=∑i≤kC(k,i)⋅f(i)k \cdot (k - 1)^{n - 1} = \sum_{i \leq k} C(k, i) \cdot f(i) 套二项式反演即可#include<iostream> #include<cstdio> #include<cmath> #include<cstring>

用exgcd求逆元,数据很水,int不会爆#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #define fo(i,a,b) for(int i=a;i<=b;i++) #define fod(i,a,b) for(int i=a;i>=b;i--) using nam