I have a problem about fibonacci numbers: ==================
let f[i] be the ith fibonacci number
f[i] = 1 (1 <= i <= 2)
f[i] = f[i-1] + f[i-2] (i > 2)
how can i calculate f[f[n]] mod M (n, M <= 10^9). anyone can help me?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
I have a problem about fibonacci numbers: ==================
how can i calculate f[f[n]] mod M (n, M <= 10^9). anyone can help me?
Name |
---|