![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【算法专题】矩阵快速幂
鱼儿冒个泡
这个作者很懒,什么都没留下…
展开
-
【矩阵快速幂】hdu Another kind of Fibonacci
#include<iostream>using namespace std;typedef long long ll;const ll mod = 10007;ll N, X, Y;struct Matrix { static const int N = 15; ll a[N][N]; Matrix(ll e = 0) { for (int i = 1; i <= 4; i++) for (int j = 1; j <= 4; j++) a[i].原创 2021-04-11 09:50:42 · 63 阅读 · 0 评论 -
【矩阵快速幂】hdu Tribonacci
#include<iostream>using namespace std;typedef long long ll;const ll mod=1e9+7;ll n;struct Matrix{ static const int N=15; ll a[N][N]; Matrix(ll e=0){ for (int i=1;i<=n;i++)for (int j=1;j<=n;j++)a[i][j]=e*(i==j); } Matrix mul(Matrix .原创 2021-04-11 09:04:33 · 109 阅读 · 0 评论 -
【矩阵快速幂】hdu Count
#include<iostream>using namespace std;typedef long long ll;ll t,k;const ll mod = 123456789;struct Matrix { static const int N = 6; ll a[N][N]; Matrix(ll e = 0) { for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { ..原创 2021-04-08 20:31:45 · 87 阅读 · 0 评论 -
【矩阵快速幂】hdu A Simple Math Problem
#include<iostream>using namespace std;typedef long long ll;int k, m;struct Matrix { static const int N = 10; ll a[N][N]; Matrix(ll e = 0) { for (int i = 0; i < N; ++i) { for (int j = 0; j < N; ++j) { a[i][j] = e * (i == j);..原创 2021-04-08 19:21:24 · 97 阅读 · 0 评论