Fibonacci n<10^10次方它的后四位
来源:互联网 发布:淘宝详情页教程视频 编辑:程序博客网 时间:2024/05/29 18:28
#include <iostream>#include <cstdio>using namespace std;struct M{ intm[4][4];};M mul(M a,M b){ M c; c.m[0][0]=(a.m[0][0]*b.m[0][0]+a.m[0][1]*b.m[1][0])%10000; c.m[0][1]=(a.m[0][0]*b.m[0][1]+a.m[0][1]*b.m[1][1])%10000; c.m[1][0]=(a.m[1][0]*b.m[0][0]+a.m[1][1]*b.m[1][0])%10000; c.m[1][1]=(a.m[1][0]*b.m[0][1]+a.m[1][1]*b.m[1][1])%10000; return c;}M creatone(){M c;c.m[0][0]=1;c.m[0][1]=1;c.m[1][0]=1;c.m[1][1]=0; return c;}M fibonacci(int k){if(k==1) return creatone();if(k%2==0) {M en = fibonacci(k/2);return mul(en,en);}else {M en = fibonacci(k/2);return mul(mul(en,en),creatone());}return creatone();}void init(){ int n; while(cin>>n) {if(n==-1)break;if(n==0){cout<<0<<endl;continue;}M one = fibonacci(n);;int value = one.m[0][1];cout<<value%10000<<endl; }}int main(){init();return 0;}