nyoj 148 fibonacci数列(二) 【矩阵快速幂】

最新推荐文章于 2019-08-19 17:14:33 发布

dxx_111

最新推荐文章于 2019-08-19 17:14:33 发布

阅读量464

点赞数

分类专栏：矩阵快速幂

本文链接：https://blog.csdn.net/dxx_111/article/details/48756295

版权

矩阵快速幂专栏收录该内容

4 篇文章 0 订阅

订阅专栏

fibonacci数列(二)

时间限制： 1000 ms | 内存限制： 65535 KB

难度： 3

描述

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.

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:

输入

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.

输出

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).

样例输入

样例输出

0
34
6875

来源

POJ

上传者

hzyqazasdf

思路：

要注意每一个数在矩阵中代表的什么含义，然后再做，否则很容易出错！

第一个矩阵中第一个数代表f(2)，依次类推，就能得到所有的f的值了！

代码：

#include <stdio.h>
#include <string.h>
int n;
struct Maxtri
{
	int r,c;
	int a[5][5];
};
Maxtri ori,res;
void init()
{
	memset(res.a,0,sizeof(res.a));
	for(int i=1;i<=2;i++)
		res.a[i][i]=1;
	ori.a[1][1]=1;ori.a[1][2]=1;
	ori.a[2][1]=1;ori.a[2][2]=0;
}
Maxtri maxtri(Maxtri x,Maxtri y)
{
	Maxtri z;
	memset(z.a,0,sizeof(z.a));
	for(int i=1;i<=2;i++)
	{
		for(int k=1;k<=2;k++)
		{
			if(x.a[i][k]==0)	continue;
			for(int j=1;j<=2;j++)
			{
				z.a[i][j]=(z.a[i][j]+(x.a[i][k]*y.a[k][j])%10000)%10000;
			}
		}
	}
	return z;
}
void maxtri_mod()
{
	while(n)
	{
		if(n%2!=0)
			res=maxtri(res,ori);
		ori=maxtri(ori,ori);
		n/=2;
	}
}
int main()
{
	while(scanf("%d",&n)&&(n!=-1))
	{
		if(n==0)
		{
			printf("0\n");
			continue;
		}
		init();
		n=n-1;
		maxtri_mod();
		printf("%d\n",res.a[1][1]);
	}
	return 0;
}