Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long MOD=1000000009;
- const int MAXN = 300;
- typedef long long ll;
- struct matrix{
- int n , m;
- int arr[MAXN][MAXN];
- matrix(){}
- matrix(int x , int y , int V=0){
- n = x; m = y;
- for(int j=0;j<n;j++) for(int i=0;i<m;i++) arr[j][i] = V;
- }
- matrix(int x , int y , int A[MAXN][MAXN]){
- n = x; m = y;
- for(int j=0;j<n;j++) for(int i=0;i<m;i++) arr[j][i] = A[j][i];
- }
- matrix operator * (matrix &mat){
- matrix res(n , mat.m , 0);
- long long theta;
- for(int j=0;j<n;j++){
- for(int i=0;i<mat.m;i++){
- theta = 0;
- for(int k=0;k<m;k++){
- theta += 1ll * arr[j][k] * mat.arr[k][i];
- theta%=MOD;
- }
- res.arr[j][i] = theta;
- }
- }
- return res;
- }
- matrix power(long long K){
- matrix res(n , m , 0) , b(n , m , 0);
- for(int j=0;j<n;j++) res.arr[j][j] = 1;
- b = (*this);
- while(K>0){
- if( (K&1) )
- res = res * b;
- K/=2;
- b = b * b;
- }
- return res;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement