【poj3070】Fibonacci

最新推荐文章于 2019-01-12 22:27:02 发布

路没有尽头

最新推荐文章于 2019-01-12 22:27:02 发布

阅读量322

点赞数 1

分类专栏：数论文章标签：数论-矩阵快速幂 poj

本文链接：https://blog.csdn.net/shengjinli1/article/details/53591706

版权

数论专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Description

In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …

An alternative formula for the Fibonacci sequence is

Given an integer n, your goal is to compute the last 4 digits of Fn.

Input

The input test file will contain multiple test cases. Each test case consists of a single line containing n (where 0 ≤ n ≤ 1,000,000,000). The end-of-file is denoted by a single line containing the number −1.

Output

For each test case, print the last four digits of Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn mod 10000).

    第一篇博客   代码基本套模版啦

include

using namespace std;

const int M=10000;

struct Matrix{
int a[2][2];
Matrix operator *(const Matrix& tmp){
Matrix ans;
memset(ans.a,0,sizeof(ans.a));
for( int i=0; i<2; i++)
for( int j=0; j<2; j++ )
for( int k=0; k<2; k++)
ans.a[i][j]=(ans.a[i][j]+a[i][k]*tmp.a[k][j])%M;
return ans;
}
};

int quick_pow( Matrix b, int n ) {
Matrix ans;
ans.a[0][0]=ans.a[1][1]=1;
ans.a[0][1]=ans.a[1][0]=0;

while( n )
{
    if( n%2 )
      ans=ans*b;
    b=b*b;
    n=n/2;  
}
return ans.a[0][1];

}

int main(){
int n;
Matrix base;
base.a[0][0]=base.a[0][1]=base.a[1][0]=1;
base.a[1][1]=0;
while(~scanf(“%d”,&n))
{
if( n==-1 )
break;
printf(“%d\n”,quick_pow(base,n));