POJ3070-Fibonacci

最新推荐文章于 2019-03-26 00:15:50 发布

Wang_128

最新推荐文章于 2019-03-26 00:15:50 发布

阅读量301

点赞数

分类专栏： POJ ----矩阵快速幂

本文链接：https://blog.csdn.net/a664607530/article/details/77619654

版权

POJ 同时被 2 个专栏收录

159 篇文章 1 订阅

订阅专栏

----矩阵快速幂

25 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16092		Accepted: 11309

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:

Source

Stanford Local 2006

题意：给出Fibonacci的第n项的矩阵递推方法，问Fn的最后四位是什么。

解题思路：矩阵快速幂取模。

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int n;

struct Matrix
{
	int v[9][9];
	Matrix()
	{
		memset(v, 0, sizeof v);
	}
};

Matrix mul(Matrix a, Matrix b, int d)
{
	Matrix ans;
	for (int i = 1; i<=d; i++)
	{
		for (int j = 1; j<=d; j++)
		{
			for (int k = 1; k<=d; k++)
			{
				ans.v[i][j] += (a.v[i][k] * b.v[k][j])%10000;
				ans.v[i][j] %= 10000;
			}
		}
	}
	return ans;
}

Matrix pow(Matrix a, int k, int d)
{
	Matrix ans = a;
	while (k)
	{
		if (k & 1) ans = mul(ans, a, d);
		k >>= 1;
		a = mul(a, a, d);
	}
	return ans;
}

int main()
{
	while (~scanf("%d", &n)&&n!=-1)
	{
		Matrix a, ans;
		a.v[1][1] = a.v[1][2] = a.v[2][1] = 1;
		a.v[2][2] = 0;
		ans = pow(a, n, 2);
		printf("%d\n", ans.v[2][2]);
	}
	return 0;
}