How to solve this problem using matrix exponentiation. The recurrence relation is :
f(n, k, 0) = 2 * f(n - 1, k, 1) + f(n - 1, k, 0)
f(n, k, 1) = f(n - 1, k, 1) + f(n - 1, k, 0)
1 < n < 1e9
1 < k < 1e3
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Problem BBRICKS from Codechef Long challenge
How to solve this problem using matrix exponentiation. The recurrence relation is :
f(n, k, 0) = 2 * f(n - 1, k, 1) + f(n - 1, k, 0)
f(n, k, 1) = f(n - 1, k, 1) + f(n - 1, k, 0)
1 < n < 1e9
1 < k < 1e3
| Name |
|---|


