How to solve the following recurrence relation for N ≤109
F(n)=F(n−1)+F(n−2)+F(n−1)∗F(n−2)
(Assuming that we are provided with the values of F(1) and F(2) )
(EDIT: The problem link is attached.)
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | Um_nik | 145 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | nik_exists | 133 |
| 7 | DNR | 133 |
| 9 | AmShZ | 130 |
| 10 | Dominater069 | 129 |
→ Find user
→ Recent actions
Help needed in Matrix Exponentiation !!!
Revision en2, by anupamshah_, 2020-04-15 13:45:20
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
anupamshah_ | 2020-04-15 13:45:20 | 86 | ||
| en1 |
|
anupamshah_ | 2020-04-15 11:25:20 | 235 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/04/2026 02:30:10 (h1).
Desktop version, switch to mobile version.
Supported by
