题目(http://acm.hdu.edu.cn/showproblem.php?pid=1568)
Fibonacci 的基本递推公式:
0 if n=0;
F(n)= 1 if n=1;
F(n-1)+F(n-2) if n>1.
求解递推方程就可以解出如下的通项公式封闭形式的通项公式:
下面举例来说明计算前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 <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int data[30]={0,1};
int main()
{for(int i=2; i<=20; i++)
data[i]=data[i-1]+data[i-2];
int m;
while(cin>>m)
{if(m<21)//前20位打表小于10000
cout<<data[m]<<endl;
else
{
double y=log10(1.0/sqrt(5))+m*log10((1.0+sqrt(5))/2.0)
+4-(int)(log10(1.0/sqrt(5))+m*log10((1.0+sqrt(5))/2.0)+1);
int ans=(int)pow(10.0,y);
cout<<ans<<endl;
}
}
return 0;
}