traceability matrix template

Given n*n matrix A, ask A^k The ranks are all n #include #include#include#include#includeusing namespacestd;Const intn= the, mod=1000000007; typedefLong Longll;inline ll Read () {CharC=getchar (); ll x=0, f=1; while(c'0'|| C>'9'){if(c=='-') f=-1; c=GetChar ();} while(c>='0'c'9') {x=x*Ten+c-'0'; c=GetChar ();} returnx*F;} ll N,k;structmat{ll Mt[n][n]; Mat () {memset (MT,0,sizeof(MT));}} A,im,ans;voidinit () { for(intI=1; i1;} Mat Mul (Mat

Title Link: http://poj.org/problem?id=3070.Another way to represent Fibonacci is to power the matrix;So it's a fast-power matrix. Fast Matrix Learning#include #include#include#include#includeusing namespacestd;#defineN 10structnode{inta[n][n];} S,e;node mul (node p, node Q)///the product of two matrices is obtained;{node tem; for(intI=0; i2; i++) { fo

The template is as follows: // HDU 4888: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4888 # Include Template (network stream judgment: whether there is a matrix of always rows and columns)

The basic line segment tree should be noted that, due to the set and add operations, when the push-down is marked as lazy, the set is given priority, and then the ADD is given priority. Each time you execute the set operation, the ADD is marked as 0. Wa has been used several times because of a problem during the Computing period. The funny thing is that I found the template for more than an hour. # Include [Ultraviolet A] 11992-Fast

#include #includeusing namespacestd;Const intMOD =10000;structmatrix{intm[2][2];} ans,BaseMatrix multi (matrix A, matrix B) {matrix tmp; for(inti =0; I 2; ++i) { for(intj =0; J 2; ++j) {Tmp.m[i][j]=0; for(intK =0; K 2; ++k) Tmp.m[i][j]= (Tmp.m[i][j] + a.m[i][k] * b.m[k][j])%MOD; } } returntmp;}intFast_mod (intN//to find the n power of

Label: style blog Io color OS for SP Div on 1 #include "iostream" 2 #include "vector" 3 #include "cstring" 4 using namespace std; 5 6 typedef unsigned long int ULL; 7 typedef vector HDU 1575 Matrix Quick power Template

/************************************************author:p owatrcreated time:2015-8-5 21:06:30File name:b.cpp /#include 　　Template--Fast power of matrix

Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1575# Include HDU1575: Tr A (matrix quick power template)

Number SequenceTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 148003 Accepted Submission (s): 35976Problem Descriptiona number sequence is defined as follows:F (1) = 1, f (2) = 1, f (n) = (A * F (n-1) + B * F (n-2)) MoD 7.Given A, B, and N, you is to calculate the value of f (n).Inputthe input consists of multiple test cases. Each test case contains 3 integers a, b and N in a single line (1 Outputfor each test case, print the value of f (n) in

The main topic: Give a m*n 01 matrix, the following Q queries, the query matrix exists in the size of the K*l sub-matrix.Idea: two-dimensional hash. We first hash the big matrix and then insert all the possible k*l sub-matrices into the hash table, and then just look at the hash tables for each query hash to see if they exist.It is worth mentioning that the probl

Hihocoder #1143: Domino Coverage problem • Time limit:10000msSingle Point time limit:1000msMemory Limit:256MBDescribeDominoes, an ancient toy. Today we are going to look at the problem of Domino coverage:We have a 2xN strip board and then use the 1x2 dominoes to cover the entire board. How many different coverage methods are there for this chessboard?For example, for a board with a length of 1 to 3, we have the following types of coverage:Hint: Domino OverlayTip: How to quickly calculate results

[Luogu 1939] [TEMPLATE] matrix acceleration (series), luogu1939Description A [1] = a [2] = a [3] = 1 A [x] = a [X-3] + a [x-1] (x> 3) Returns the remainder value of the nth clause of Series a on 1000000007 (10 ^ 9 + 7.Input/Output Format Input Format: The first line is an integer T, indicating the number of queries. The following T rows have a positive integer n in each row. Output Format: Each row outputs

#include See also matrix fast power template paste up

Split each point into the origin A and pseudo point b,a->b there are two one-way (adjacency table implementation needs to establish a reverse empty edge, and to ensure that the loop cost and 0), a residual capacity of 1, the cost of its own negative value (easy to calculate the shortest path), the other residual capacity +∞, the cost is 0 ( The point is guaranteed to pass multiple times, but only once for the cost.In addition, the pseudo point B and the right side of the origin and the point bel

Define MAXN 100#define FABS (x) ((x) >0? ( x):-(x))#define ZERO (x) (Fabs (x) struct mat{int n,m;Double DATA[MAXN][MAXN];};int Mul (mat c,const mat a,const mat b) {int i,j,k;if (A.M!=B.N)return 0;C.N=A.N,C.M=B.M;for (i=0;ifor (j=0;jfor (c.data[i][j]=k=0;kC.DATA[I][J]+=A.DATA[I][K]*B.DATA[K][J];return 1;}int INV (mat a) {int I,J,K,IS[MAXN],JS[MAXN];Double T;if (A.N!=A.M)return 0;for (k=0;kfor (t=0,i=k;ifor (j=k;jif (Fabs (A.data[i][j]) >t)T=fabs (A.data[is[k]=i][js[k]=j]);if (zero (t))return 0;if

#include #include#include#include#include#includeusing namespacestd;#defineMAXN 100000000#definePrime1 9983543#definePrime2 9804799#defineMOD 99999971#defineN 1010intm,n,a,b,q; unsignedintunsigned a hash;intA[n][n],b[n][n],p1[n],p2[n];BOOLH[MAXN];intMain () {scanf ("%d%d%d%d",m,n,a,B); for(intI=1; i) for(intj=1; j) scanf ("%1d",A[i][j]); for(intI=1; i) for(intj=1; j) A[i][j]+=a[i-1][j]*prime1; for(intI=1; i) for(intj=1; j) A[i][j]+=a[i][j-1]*prime2; p1[0]=1; p2[0]=1;

F-Number Sequence#include #include using namespace Std;struct MAT{int ans[2][2];};Mat I,mid;int M;Mat Cal (Mat A,mat B){Mat C;int i,j,k;for (i=0;ifor (j=0;j{c.ans[i][j]=0;for (k=0;kC.ANS[I][J]+=A.ANS[I][K]*B.ANS[K][J];c.ans[i][j]%=7;}return C;}Mat ATL (int n){Mat Res=mid;Mat Mid=i;while (n) {if (n1)Res=cal (Res,mid);Mid=cal (Mid,mid);N>>=1;}return res;}int main (){int k,i,j;int a,b,n;while (scanf ("%d%d%d", a,b,n)!=-1){if (a==0b==0n==0)BreakI.ans[0][0]=a;I.ans[1][0]=b;I.ans[0][1]=1;i.ans[1][1]=0

const int MAXN = 110;struct matrax{int M[MAXN][MAXN];} A,per;int n,m;void Init () {for (int i = 0, i Matrix Quick Power "template"

Label: style blog HTTP Io color ar OS SP Http://poj.org/problem? Id = 3070 # Include # Include String . H> # Include # Include # Include # Define Mod4 10000 Using Namespace STD; Struct M { Int A [ 3 ] [ 3 ];} Init, Res; Int N; m mult (m x, m y) {m tmp; For ( Int I = 0 ; I 2 ; I ++ ){ For (Int J = 0 ; J 2 ; J ++ ) {TMP. A [I] [J] = 0 ; For ( Int K = 0 ; K 2 ; K ++ ) {TMP. A [I] [J] = (TMP. A [I] [J] + X. A [I] [k] * Y. A [k] [J]) % MoD ;}}} Return TMP;} m POW (m x, Int N

Question: Calculate the nth entry of the Fibonacci series 1 #include "iostream" 2 #include "vector" 3 #include "cstring" 4 using namespace std; 5 6 typedef unsigned long int ULL; 7 typedef vector Poj 3070 Matrix Quick power Template