poj 3070 Fibonacci(矩阵快速幂)

最新推荐文章于 2019-09-29 19:46:45 发布

KinFungYu

最新推荐文章于 2019-09-29 19:46:45 发布

阅读量866

点赞数

分类专栏： poj 矩阵文章标签：矩阵快速幂求Fibonacci数列

本文链接：https://blog.csdn.net/WEYuLi/article/details/9228781

版权

poj 同时被 2 个专栏收录

184 篇文章 0 订阅

订阅专栏

矩阵

8 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7303		Accepted: 5186

Description

In the Fibonacci integer sequence, F₀ = 0, F₁ = 1, and F_n = F_n_{− 1} + F_n_{− 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 F_n.

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 F_n. If the last four digits of F_n are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print F_n mod 10000).

Sample Input

Sample Output

Hint

As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by

Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:

题意：用矩阵乘法来求Fibonacci数列。

分析：矩阵快速幂

AC代码;

#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <iostream>

using namespace std;
typedef struct node
{
    int m[2][2];
    void init()
    {
        m[0][0]=m[0][1]=m[1][0]=1;
        m[1][1]=0;
    }
}matrix;
int n;
matrix matrix_multi(matrix a,matrix b)
{
    matrix temp;
    for(int i=0;i<2;i++)
    for(int j=0;j<2;j++)
    {
        temp.m[i][j]=0;
        for(int k=0;k<2;k++)
        temp.m[i][j]+=a.m[i][k]*b.m[k][j];
        if(temp.m[i][j]>10000)
        temp.m[i][j]%=10000;
    }
    return temp;
}
int main()
{
    while(cin>>n)
    {
        if(n==-1) break;
        matrix r,a;
        r.m[1][0]=r.m[0][1]=0;  //将r设为单位矩阵（主对角线为1，其余为0，任何矩阵与之相乘得到其本身）
        r.m[0][0]=r.m[1][1]=1;
        a.init();
        while(n)
        {
            if(n&1)
            r=matrix_multi(r,a);
            a=matrix_multi(a,a);
            n>>=1;
        }
        cout<<r.m[1][0]<<endl;
    }
    return 0;
}