备战区域赛
Linfanty
啦啦啦~
展开
-
矩阵快速幂
首先把非线性递推式转换为线性递推式∵ (n+1)4 = n4 + 4n3 + 6n2 + 4n + n0∵ F(n+1) = F(n) + 2F(n-1) + (n+1)4∴ F(n+1) = F(n) + 2F(n-1) + n4 + 4n3 + 6n2 + 4n + n0然后我们看下下面的状态转移矩阵作者:徐森威链接:https://www.jianshu.com/p/25eba927d9d...原创 2018-04-15 13:37:46 · 267 阅读 · 0 评论 -
逆元求组合数
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll inf = 0x3f3f3f3f3f3f3f3f; #define show(a) cout<<#a<&...原创 2018-04-15 13:39:44 · 406 阅读 · 0 评论