题意：矩阵快速幂取模 #include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;long long mod;long long p[]={1,1,1,0};void matrix(long long a[],long long b[],long long c[]

原题： The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …) are defined by the recurrence: F 0 = 0 F 1 =1 F i = F i−1 + F i−2 for i > 1 Write a program which calculates M n = F n mod 2 m f