矩阵链乘+斐波那契+快速幂专题

最新推荐文章于 2024-08-14 11:57:49 发布

置顶

qiqijianglu

最新推荐文章于 2024-08-14 11:57:49 发布

阅读量2.8k

点赞数

CC 4.0 BY-SA版权

分类专栏：数论

本文链接：https://blog.csdn.net/qiqijianglu/article/details/8040132

这篇博客探讨了如何使用矩阵乘法高效地计算斐波那契数列的特定部分，包括前四位和后四位的计算方法，并介绍了通过构造矩阵解决斐波那契数列的指数形式问题。同时，提到了一种不同类型的斐波那契问题的解决方案，利用二分法简化计算过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://acm.hdu.edu.cn/showproblem.php?pid=3117

Fibonacci Numbers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1093 Accepted Submission(s): 469

Problem Description

The Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for the first two elements f0 and f1 which are respectively zero and one.

What is the numerical value of the nth Fibonacci number?

Input

For each test case, a line will contain an integer i between 0 and 10 ⁸ inclusively, for which you must compute the ith Fibonacci number fi. Fibonacci numbers get large pretty quickly, so whenever the answer has more than 8 digits, output only the first and last 4 digits of the answer, separating the two parts with an ellipsis (“...”).

There is no special way to denote the end of the of the input, simply stop when the standard input terminates (after the EOF).

Sample Input

Sample Output

  
  
  
   
   
   0
1
1
2
3
5
9227465
14930352
24157817
39088169
63245986
1023...4155
1061...7723
1716...7565

Source

IPCP 2005 Northern Preliminary for Northeast North-America

Recommend

lcy

求斐波那契的前四位和后四位，后四位直接模上10000就行了，利用矩阵乘法

下面举例来说明计算前4 位
123456.32=1234.56*10^2
s=d.xxx*10^(len-4)
log10(s)=log10(d.xxxxx)+log10(10^(len-4))=log10(d.xxxx)+len-4;
log10(s)+4-len=log10(d.xxxx)
d.xxxx=10^(log10(s)+4-len)

s=(1/sqrt(5))*[(1+sqrt(5))/2.0]^i;
len=(int)log10(s)+1;
d.xxxx=10^(log10(s)+4-((int)log10(s)+1))=10^(log10(s)-(int)log10(s)+3);

#include <cstdio>
#include<iostream>
#include<cstdlib>
#include<stdio.h>
#include<math.h>
using namespace std;
int f[40];
const int MAX = 2;
typedef struct
{
int m[MAX][MAX];
} Matrix;
Matrix P =
{
1,1,
1,0
};
Matrix I =
{
1,0,
0,1
};
Matrix matrixmul(Matrix a,Matrix b) //矩阵乘法
{
int i,j,k;
Matrix c;
for (i = 0 ; i < MAX; i++)
for (j = 0; j < MAX;j++)
{
c.m[i][j] = 0;
for (k = 0; k < MAX; k++)
c.m[i][j] += (a.m[i][k] * b.m[k][j])%10000;
c.m[i][j] %= 10000;
}
return c;
}
Matrix quickpow(int n)
{
Matrix m = P, b = I;
while (n >= 1)
{
if (n & 1)
b = matrixmul(b,m);
n = n >> 1;
m = matrixmul(m,m);
}
return b;
}
void pre(int  n)
{
        double a=sqrt(5.0);
        double b=(sqrt(5.0)+1)/2;
        double s=log(1.0/a)/log(10.0)+n*log(b)/log(10.0);
        double t=s-(int)s+3;
        double f=pow(10.0,t);
        f=(int)f;
        cout<<f<<"...";
}
void bb(int n)
{
    Matrix g=quickpow(n-