POJ 3070 Fibonacci（矩阵快速幂）

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

nudt_oys

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

阅读量239

点赞数

分类专栏：数论文章标签： POJ

本文链接：https://blog.csdn.net/qq_26658823/article/details/52253848

版权

数论专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Fibonacci

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

题目大意：求第n个Fibonacci数的后四位。

解题思路：矩阵快速幂。刚开始把初始化函数放在外面了，导致WA了一次。。

代码如下：

#include <cstdio>
#include <cstring>
#define MOD 10000
typedef long long ll;
const int maxn = 2;
ll n;
struct Matrix
{
    ll mat[maxn][maxn];
    Matrix operator * (const Matrix m)const
    {
        Matrix temp;
        for(int i = 0;i < maxn;i++){
            for(int j = 0;j < maxn;j++){
                temp.mat[i][j] = 0;
                for(int k = 0;k < maxn;k++){
                    temp.mat[i][j] += (mat[i][k] * m.mat[k][j]) ;
                    temp.mat[i][j] %= MOD;
                }
            }
        }
        return temp;
    }
};

ll Pow(Matrix& m,int k)
{
    Matrix ans;
    memset(ans.mat,0,sizeof(ans.mat));
    for(int i = 0;i < maxn;i++){
        ans.mat[i][i] = 1;
    }
    while(k){
        if(k & 1)
            ans = ans * m;
        k >>= 1;
        m = m * m;

    }
    return ans.mat[0][1];
}

void init(Matrix& m)
{

    m.mat[0][0] = m.mat[0][1] = m.mat[1][0] = 1;
    m.mat[1][1] = 0;
}

int main()
{
    Matrix m;
    while(scanf("%I64d",&n) != EOF && n != -1){
        init(m);
        printf("%I64d\n",Pow(m,n));
    }
    return 0;
}