斐波那契数列与矩阵快速幂
输入数列项数n,输出斐波那契数列第n项的后四位。代码如下:
#include
#include
#include
using namespace std;
long long fac_tmp[6][4];
void fac(int);
int main(){
int n[5], a[5];
cout << "input 5 numbers" << endl;
for(int i=0;i<5;i++){
cin >> n[i];
a[i] = fac(n[i]);
}
cout << "result" <
= 32; i = i - 32) {
a = (t00*fac_tmp[0][0] + t01*fac_tmp[0][2]) % 10000;
b = (t00*fac_tmp[0][1] + t01*fac_tmp[0][3]) % 10000;
c = (t10*fac_tmp[0][0] + t11*fac_tmp[0][2]) % 10000;
d = (t10*fac_tmp[0][1] &