Problem link : (http://mirror.codeforces.com/problemset/problem/166/E)
How to solve this problem log(n) with binary exponentiation of some 2 × 2 matrix into power n. Needs some explanation in this problem .Thanks in advance.
Sorry for bad english.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Problem link : (http://mirror.codeforces.com/problemset/problem/166/E)
How to solve this problem log(n) with binary exponentiation of some 2 × 2 matrix into power n. Needs some explanation in this problem .Thanks in advance.
Sorry for bad english.
Name |
---|
Not sure how to do it with a 2x2 matrix, but I solved this problem by exponentiating a 4x4 adjacency matrix. I'm guessing the 2x2 solution somehow exploits the symmetry in the tetrahedron.