Merhaba arkadaşlar,
Soru şöyle, kaynak: koduesi.com. Sorunun adı Big Fibonacci.
Fibonacci sequence is the sequence of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...
It is defined as follows: F(0) = 0.
F(1) = 1.
F(n) = F(n-1) + F(n-2) n >1.
Compute the number M(n) = F(n) mod 2^m where (0 <=...