POJ 3070 Fibonacci 矩阵快速幂求解

点击转到

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 19599		Accepted: 13545

Description

In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 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 Fn.

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 Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn mod 10000).

Sample Input

0
9
999999999
1000000000
-1

Sample Output

0
34
626
6875

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<cstdio>
#include<algorithm>
#include<cstring>
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};
    node 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()
{
    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;
}