POJ 3070 Fibonacci (矩阵快速幂 Fibonacci数列新求法)

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

_TCgogogo_

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

阅读量909

点赞数

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

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/43878333

版权

ACM 同时被 2 个专栏收录

635 篇文章 0 订阅

订阅专栏

数论

78 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9974		Accepted: 7115

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:

Source

Stanford Local 2006

题目链接：http://poj.org/problem?id=3070

题目大意：求Fibonacci数列的后四位

题目分析：矩阵已经给了，直接矩阵快速幂对10000取余

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int const MOD = 1e4;
struct matrix
{
    int m[5][5];
}a;

matrix multiply(matrix x, matrix y)
{
    matrix ans;
    memset(ans.m, 0, sizeof(ans.m));
    for(int i = 1; i <= 2; i++)
        for(int j = 1; j <= 2; j++)
            if(x.m[i][j])
                for(int k = 1; k <= 2; k++)
                    ans.m[i][k] = (ans.m[i][k] + x.m[i][j] * y.m[j][k]) % MOD;
    return ans;
}

matrix quickmod(matrix a, int p)
{
    matrix ans;
    memset(ans.m, 0, sizeof(ans.m));
    for(int i = 1; i <= 2; i++)
        ans.m[i][i] = 1;
    while(p)
    {
        if(p & 1)
            ans = multiply(ans, a);
        p >>= 1;
        a = multiply(a, a);
    }
    return ans;
}

int main()
{   
    int n;
    matrix a;
    a.m[1][1] = 1; 
    a.m[1][2] = 1;
    a.m[2][1] = 1;
    a.m[2][2] = 0;
    while(scanf("%d", &n) != EOF && n != -1)
    {
        if(n == 0)
        {
            printf("0\n");
            continue;
        }
        matrix ans = quickmod(a, n - 1);
        printf("%d\n", ans.m[1][1]);
    }
}