[UVA][矩陣] 10229 - Modular Fibonacci
Problem A: Modular Fibonacci
The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:
F0 = 0
F1 = 1
Fi = Fi-1 + Fi-2 for i>1
Write a program which calculates Mn = Fn mod
2m for given pair of n and m. 0£
n£
21474836...
