poj3070Fibonacci

最新推荐文章于 2019-01-12 22:27:02 发布

hahaAll

最新推荐文章于 2019-01-12 22:27:02 发布

阅读量392

点赞数

分类专栏：快速幂

本文链接：https://blog.csdn.net/hahaAll/article/details/50583814

版权

快速幂专栏收录该内容

7 篇文章 0 订阅

订阅专栏

poj3070Fibonacci:http://poj.org/problem?id=3070

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11699		Accepted: 8306

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>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
const int mod = 10000;
typedef long long LL;

typedef struct Node
{
    LL a[2][2];
} node;

node fun(node x,node y)
{
    node tem = {0,0,0,0};
    for(int i = 0; i < 2; i++)
        for(int j = 0; j < 2; j++)
            for(int k = 0; k < 2; k++)
                tem.a[i][j] += x.a[i][k] * y.a[k][j],
                               tem.a[i][j] %= mod;
    return tem;
}
LL quickpow(LL n)
{
    node ans = {1,0,
                0,1
               },
         tem = {1,1,
                1,0
               };
    while(n)
    {
        if(n & 1)ans = fun(ans,tem);
        n >>= 1;
        tem = fun(tem,tem);
    }
    return (ans.a[0][0] + ans.a[0][1]) % mod;
}
int main()
{
//    freopen("in.txt","r",stdin);
    int n;
    while(scanf("%d",&n))
    {
        if(n == -1)break;
        if(n == 0)printf("0\n");
        else if(n <= 2)printf("1\n");
        else printf("%lld\n",quickpow(n - 2));
    }
    return 0;
}