Can anybody please tell how to solve This problem..
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 162 |
2 | -is-this-fft- | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Can anybody please tell how to solve This problem..
Name |
---|
Notice that the problem is asking you to find the solution to the following problem:
f(N) = f(N-a) + f(N-b), where f(0) = 1
Since N can be quite large, you cannot simply solve bottom up, as this would be O(N). The correct approach is to utilize matrix exponentiation to solve recurrence relations. I recommend a google search for doing this with a simple recurrence relation to start, fibonacci. After that, you will see that this is easily solved in a similar way.