POJ - 3070 Fibonacci 【矩阵快速幂 & 斐波那契】

最新推荐文章于 2024-05-17 16:43:56 发布

原创最新推荐文章于 2024-05-17 16:43:56 发布 · 180 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

Accept 专栏收录该内容

161 篇文章

订阅专栏

博客给出题目链接http://poj.org/problem?id=3070，指出这是一道矩阵快速幂模板题，并给出了AC代码。

题目链接：http://poj.org/problem?id=3070

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20937		Accepted: 14358

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

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:

解题思路

矩阵快速幂模板题。

AC代码

#include <iostream>
#include <cstdio>
using namespace std;
const int mod = 1e4;
struct Matrix {
	int e[2][2];
};
Matrix base = {1,1,1,0};
Matrix Matrix_mul(Matrix a,Matrix b)
{
	Matrix tmp;
	for(int i=0;i<2;i++) 
		for(int j=0;j<2;j++) {
			tmp.e[i][j] = 0;
			for(int k=0;k<2;k++)
				tmp.e[i][j] = (tmp.e[i][j] + a.e[i][k] * b.e[k][j])%mod;
		}
	return tmp;
}
int Matrix_pow(Matrix x,int n)
{
	Matrix ans;
	ans.e[0][0]=ans.e[1][1] = 1;
	ans.e[0][1]=ans.e[1][0] = 0;
	while( n!=0) {
		if(n & 1)
			ans = Matrix_mul(ans,x);
		x = Matrix_mul(x,x);
		n >>= 1;
	}
	return ans.e[0][1];
}
int main()
{
	int n;
	while(scanf("%d",&n) && n!=-1)
		printf("%d\n",Matrix_pow(base,n));
	return 0;
}