Fibonacci

最新推荐文章于 2021-02-20 16:22:10 发布

丘大路

最新推荐文章于 2021-02-20 16:22:10 发布

阅读量205

点赞数 1

分类专栏：矩阵二分法

本文链接：https://blog.csdn.net/qq_35109299/article/details/52231682

版权

矩阵同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

二分法

4 篇文章 0 订阅

订阅专栏

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:

这题其实就是求题目中给出的那个矩阵的n次方，我们利用矩阵的快速幂乘法即可求出（我的代码中是用二分法来实现的）。

#include <stdio.h>
#include <string.h>
const int a1[2][2]={{1,0},{0,1}};
const int a2[2][2]={{1,1},{1,0}};

struct node
{
	int a[2][2];
}init,plus;

node mul(node p1,node p2)
{
	node p3;
	memset(p3.a,0,sizeof(p3.a));
	int i,j,l;
	for(i=0;i<2;i++)
		for(j=0;j<2;j++)
			for(l=0;l<2;l++)
			{
				p3.a[i][j]=(p3.a[i][j]+p1.a[i][l]*p2.a[l][j])%10000;
			}
	return p3;
}

node multi(int k1)
{
	node init1=init;
	while(k1)
	{
		if(k1&1)
		{
			init1=mul(init1,plus);
		}
		k1>>=1;
		plus=mul(plus,plus);
	}
	return init1;
}

int main()
{
	int k;
	while(~scanf("%d",&k))
	{
		memcpy(init.a,a1,sizeof(a1));
		memcpy(plus.a,a2,sizeof(a1));
		if(k==-1)
			break;
		node ans=multi(k);
		printf("%d\n",ans.a[0][1]);
	}
	return 0;
}