问题描述:
F[n]= (n=0)
F[n]= (n=1)
F[n]=a*F(n-1)+b*F(n-2) 其它
斐波那契数列的普通情况
F[n]的通项公式:
推导:
数学一本通P25(hiahiahia符号太难写了,偷个懒了)
代码:
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int n;
double f0,f1,a,b,m,k,ans;
inline double s(double a,int b)
{
if(b==0)return 1;
double k=s(a,b/2);
if(b%2==0)return k*k;
else return k*k*a;
}
int main()
{
cin>>f0>>f1>>a>>b>>n;
if(f0==0&&f1==0){cout<<'0'<<endl;return 0;}
m=(a+sqrt(a*a+4*b))/2;
k=(a-sqrt(a*a+4*b))/2;
ans=(s(k,n)*(f1-m*f0)-s(m,n)*(f1-k*f0))/(k-m);
cout<<ans<<endl;
return 0;
}