POJ3070 fibonacci 矩阵乘法

最新推荐文章于 2021-01-11 21:31:59 发布

Albafica

最新推荐文章于 2021-01-11 21:31:59 发布

阅读量561

点赞数

分类专栏：矩阵乘法数学

本文链接：https://blog.csdn.net/lenleaves/article/details/8858547

版权

数学同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

矩阵乘法

13 篇文章 0 订阅

订阅专栏

这次又涨姿势了。。。。

矩阵的幂能够用来求斐波那契数列。具体的方法就在下面的题目里面。

因为矩阵幂能够用分治法来求，所以能够节省不少时间，另外由于就取最后四位，那么直接对结果取模10000，至于为什么在运算中取模不影响最后的结果这涉及到同余的知识。

请参见Matrix67大牛的这篇博客http://www.matrix67.com/blog/archives/236

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7024		Accepted: 4972

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

#include<iostream>
#include<cstdio>

#define MAXN 32

using namespace std;

struct Matrix
{
    int size;
    long modulo;
    long element[MAXN][MAXN];
    void setSize(int);
    void setModulo(int);
    Matrix operator* (Matrix);
    Matrix power(int);

};

void Matrix::setSize(int a)
{
    for (int i=0; i<a; i++)
        for (int j=0; j<a; j++)
            element[i][j]=0;
    size = a;
}

void Matrix::setModulo(int a)
{
    modulo = a;
}

Matrix Matrix::operator* (Matrix param)
{
    Matrix product;
    product.setSize(size);
    product.setModulo(modulo);
    for (int i=0; i<size; i++)
        for (int j=0; j<size; j++)
            for (int k=0; k<size; k++)
            {
                product.element[i][j]+=element[i][k]*param.element[k][j];
                product.element[i][j]%=modulo;
            }
    return product;
}

Matrix Matrix::power(int exp)
{
    Matrix tmp = (*this) * (*this);
    if (exp==1) return *this;
    else if (exp & 1) return tmp.power(exp/2) * (*this);
    else return tmp.power(exp/2);
}

int n;
Matrix  m,ans;
int main()
{
    m.setModulo(10000);
    while(~scanf("%d",&n) && n!=-1)
    {
        m.setSize(2);
        m.element[0][0]=m.element[0][1]=m.element[1][0]=1;
        if(n==0)printf("0\n");
        else
        {
            ans=m.power(n);
            printf("%d\n",ans.element[0][1]);
        }
    }
    return 0;
}