Hello, could someone please explain this problem 450B - Jzzhu and Sequences to me. I've read the editorial and some other peoples code, but I'm not sure I completely understand it. Thanks in advance!
Hello, could someone please explain this problem 450B - Jzzhu and Sequences to me. I've read the editorial and some other peoples code, but I'm not sure I completely understand it. Thanks in advance!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| Name |
|---|



Notice that the relation f[i] = f[i+1] + f[i-1] can be rewritten as f[i+1] = f[i] — f[i-1]. We can now calculate f[i] just by using the rewritten relation. After calculating the first 8 terms of f, we get the numbers: x, y, y-x, -x, -y, x-y, x, y. Notice that f repeats itself; to be more precise, f[i+6] = f[i] for any i, so we can just take n modulo 6 and print the corresponding number from the first 6 terms of f.
Thank you
Another thing apart from the already present comments, learn matrix exponentiation method for fibonacci numbers. Similar idea will work here.