Can anybody please tell how to solve This problem..
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.