pku 3070 矩阵快速幂

最新推荐文章于 2022-03-18 20:33:25 发布

JustSteps

最新推荐文章于 2022-03-18 20:33:25 发布

阅读量1k

点赞数

分类专栏： acm题目

本文链接：https://blog.csdn.net/JustSteps/article/details/8805264

版权

acm题目专栏收录该内容

22 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6946		Accepted: 4908

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 <iostream>
#include <cstring>
#include <cstdio>
#define MAX 2
using namespace std;
struct matrix
{
    int num[MAX][MAX];
    matrix()
    {
        memset(num,0,sizeof(num));
    }
};
matrix res;
matrix A;
matrix operator*(matrix &a,matrix &b)
{
    matrix t;
    int i,j,k;
    for(i=0;i<MAX;i++)
        for(j=0;j<MAX;j++)
            for(k=0;k<MAX;k++)
                t.num[i][j]=t.num[i][j]%10000+(a.num[i][k]*b.num[k][j])%10000;
    return t;
}
void quickpower(int n)
{
    while(n)
    {
        if(n&1)
            res=res*A;
        n>>=1;
        A=A*A;
    }
}
void init()
{
    res.num[0][0]=1;
    res.num[0][1]=0;
    res.num[1][0]=0;
    res.num[1][1]=1;
    A.num[0][0]=1;
    A.num[0][1]=1;
    A.num[1][0]=1;
    A.num[1][1]=0;
}
int main()
{
    int n;
    while(scanf("%d",&n),n!=-1)
    {
        init();
        quickpower(n);
        printf("%d\n",res.num[0][1]%10000);
    }
    return 0;
}