Matrix Exponentiation

2 problems from Matrix Exponentiation (contest 102644), difficulty -. 0/2 solutions verified against sample I/O.

2 items

Matrix Exponentiation

Special | 2 problems | 0/2 verified | Difficulty - | 2m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
C	Fibonacci				1m 24s
D	Count Paths				1m 21s

Practice › Codeforces Solutions › Matrix Exponentiation ›

CF 102644D - Count Paths

I can write the editorial, but the prompt does not include the actual problem statement sections, and the problem details are needed to produce a correct solution explanation, code, examples, and tests.

Practice › Codeforces Solutions › Matrix Exponentiation ›

CF 102644C - Fibonacci

I can write the editorial, but the problem statement section in your prompt is empty. I found that Codeforces 102644C “Fibonacci” asks for the n-th Fibonacci number modulo $10^9+7$, with $0 le n le 10^{18}$.