poj 3070（矩阵快速幂）

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

真的好难

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

阅读量274

点赞数

分类专栏： acm 数学题

本文链接：https://blog.csdn.net/a73265/article/details/51154208

版权

acm 同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

数学题

15 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12213		Accepted: 8668

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

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
#define ll long long
const int Mod=10000;
long long n;
struct Matrix
{
    int ma[2][2];
    void init()
    {
        ma[0][0]=ma[0][1]=ma[1][0]=1;
        ma[1][1]=0;
    }
}p;

Matrix Multi(Matrix a,Matrix b)
{
    Matrix ans;
    memset(ans.ma,0,sizeof(ans.ma));
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            for(int k=0;k<2;k++)
                ans.ma[i][j]=(ans.ma[i][j]+a.ma[i][k]*b.ma[k][j])%Mod;
    return ans;
}

Matrix quick_pow(Matrix m,ll k)
{
    Matrix res;
    memset(res.ma,0,sizeof(res.ma));
    for(int i=0;i<2;i++)
        res.ma[i][i]=1;
    while(k)
    {
        if(k&1)
            res=Multi(res,m);
        k>>=1;
        m=Multi(m,m);
    }
    return res;
}

int main()
{
    while(~scanf("%lld",&n)&&n!=-1)
    {
        p.init();
        Matrix res;
        memset(res.ma,0,sizeof(res.ma));
        res=quick_pow(p,n);
        printf("%d\n",res.ma[0][1]);
    }
    return 0;
}