快速Fibonacci数列，矩阵法

最新推荐文章于 2023-02-01 20:35:39 发布

Jonariguez

最新推荐文章于 2023-02-01 20:35:39 发布

阅读量2.5k

点赞数 1

分类专栏：矩阵快速幂 Fibonacci数矩阵 POJ 文章标签：数论

本文链接：https://blog.csdn.net/u013068502/article/details/38338609

版权

该博客介绍了如何利用矩阵和快速幂的方法来高效地计算斐波那契数列的第n项，并给出了具体的矩阵运算过程和代码实现。文章适合对数论和矩阵运算有一定了解的读者。

摘要由CSDN通过智能技术生成

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9156		Accepted: 6494

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 eac