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 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.