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 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | Um_nik | 161 |
3 | atcoder_official | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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!
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.