矩阵快速幂求斐波那契数列 poj3070

最新推荐文章于 2019-11-03 16:21:23 发布

HS-Zeng

最新推荐文章于 2019-11-03 16:21:23 发布

阅读量667

点赞数

分类专栏： Acm 文章标签：矩阵快速幂斐波那契数列

本文链接：https://blog.csdn.net/u010826976/article/details/26017955

版权

Acm 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题目链接： POJ 3070

Language:

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8738		Accepted: 6203

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 <string.h>
#include <cstdio>
using namespace std;

const int mod = 10000;

struct matrix
{
        int a[2][2];
};

matrix mul(matrix x, matrix y)
{
        matrix res;
        res.a[0][0] = (((x.a[0][0] % mod) * (y.a[0][0] % mod)) % mod + ((x.a[0][1] % mod) * (y.a[1][0] % mod)) % mod) % mod;
        res.a[0][1] = (((x.a[0][0] % mod) * (y.a[0][1] % mod)) % mod + ((x.a[0][1] % mod) * (y.a[1][1] % mod)) % mod) % mod;
        res.a[1][0] = (((x.a[1][0] % mod) * (y.a[0][0] % mod)) % mod + ((x.a[1][1] % mod) * (y.a[1][0] % mod)) % mod) % mod;
        res.a[1][1] = (((x.a[1][0] % mod) * (y.a[0][1] % mod)) % mod + ((x.a[1][1] % mod) * (y.a[1][1] % mod)) % mod) % mod;
        return res;
}

int quickPower(matrix x, long long n)
{
        matrix res;
        memset(res.a, 0, sizeof(res.a));
        res.a[0][0] = res.a[1][1] = 1;
        while (n) {
                if (n & 1) 
                        res = mul(res, x);
                n = n >> 1;
                x = mul(x, x);
        }
        return res.a[0][1];
}

int main()
{
        long long n;
        while (scanf("%lld", &n) && n != -1) {
                if (n == 0) 
                        printf("0\n");
                else {        
                        matrix x;
                        x.a[0][0] = x.a[0][1] = x.a[1][0] = 1;
                        x.a[1][1] = 0;
                        int re = quickPower(x, n);
                        printf("%d\n", re);
                }
        }
}