POJ 3070 Fibonacci【矩阵快速幂】

最新推荐文章于 2021-09-24 14:28:56 发布

Head_Hard

最新推荐文章于 2021-09-24 14:28:56 发布

阅读量223

点赞数

分类专栏：快速幂

本文链接：https://blog.csdn.net/Head_Hard/article/details/79038445

版权

快速幂专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 17044		Accepted: 11902

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:

#include<iostream>
using namespace std;
#define ll long long
const int mod = 10000;
ll Mod(ll x)
{
    return x % mod;
}
struct mat
{
    ll m[2][2];
}unit;
mat operator * (mat a, mat b)
{
    mat ans;
    ll x;
    for(int i = 0; i < 2; i++)
    {
        for(int j = 0; j < 2; j++)
        {
            x = 0;
            for(int k = 0; k < 2; k++)
                x += Mod(Mod(a.m[i][k]) * Mod(b.m[k][j]));
            ans.m[i][j] = Mod(x);
        }
    }
    return ans;
}
void init()
{
    for(int i = 0; i < 2; i++)
        for(int j = 0; j < 2; j++)
            if(i == j)
                unit.m[i][j] = 1;
            else
                unit.m[i][j] = 0;
    return;
}
mat Pow(mat a, ll b)
{
    mat ret = unit;
    while(b)
    {
        if(b & 1)
            ret = ret * a;
        a = a * a;
        b >>= 1;
    }
    return ret;
}
int main()
{
    ll n;
    while(cin >> n)
    {
        if(n == -1)
            break;
        init();
        mat mm, nn;
        mm.m[0][0] = mm.m[0][1] = mm.m[1][0] = 1;
        mm.m[1][1] = 0;
        nn = Pow(mm, n);
        cout << nn.m[0][1] << endl;
    }
    return 0;
}