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 | 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 | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
How can i calculate the the (nth fibonacci)th fibonacci number mod M with (n, M <= 10^9)
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?
Name |
---|