题目大意:求第n个斐波那契数( 0 ≤ n ≤ 1,000,000,000)
解题思路:斐波那契可用矩阵来优化;假设当前两个数为a,b(a<b) 建立一个矩阵
|a|
|b|
便可以得出
|0,1| |a| | b |
|1,1|·|b|=|a+b|有根据矩阵的结合律,运用矩阵快速幂求出前面n-1矩阵的值,最后在做乘法就得出解。
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n;
const int maxn=10000;
struct ss
{
long long messi[3][3];
}p,ans;
long long end[3];
long long ku[3][3];
ss work(ss a,ss b)
{
ss c;
memset(c.messi,0,sizeof(c.messi));
for (int i=1;i<=2;++i)
for (int j=1;j<=2;++j)
for (int z=1;z<=2;++z)
{
c.messi[i][j]=(c.messi[i][j]+a.messi[i][z]*b.messi[z][j]%maxn)%maxn;
}
return c;
}
int main()
{
while (scanf("%d",&n)&& n!=-1)
{
p.messi[1][1]=0; p.messi[1][2]=0; ans.messi[1][1]=0; ans.messi[1][2]=1;
p.messi[2][1]=0; p.messi[2][2]=0; ans.messi[2][1]=1; ans.messi[2][2]=1;
if (n==0)
{
cout<<"0"<<endl;
continue;
};
if (n==1)
{
cout<<"1"<<endl;
continue;
};
bool m=true;
int ci=n-1;
while (ci>0)
{
if (ci%2==1)
{
if (m)
{
p=ans;
}else
p=work(p,ans);
m=false;
}
ci=ci/2;
ans=work(ans,ans);
}
end[1]=0; end[2]=1;
memset(ku,0,sizeof(ku));
for (int i=1;i<=2;++i)
for (int z=1;z<=2;++z)
{
ku[i][1]=(ku[i][1]+p.messi[i][z]*end[z]%maxn)%maxn;
}
cout<<ku[2][1]%maxn<<endl;
}
}
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n;
const int maxn=10000;
struct ss
{
long long messi[3][3];
}p,ans;
long long end[3];
long long ku[3][3];
ss work(ss a,ss b)
{
ss c;
memset(c.messi,0,sizeof(c.messi));
for (int i=1;i<=2;++i)
for (int j=1;j<=2;++j)
for (int z=1;z<=2;++z)
{
c.messi[i][j]=(c.messi[i][j]+a.messi[i][z]*b.messi[z][j]%maxn)%maxn;
}
return c;
}
int main()
{
while (scanf("%d",&n)&& n!=-1)
{
p.messi[1][1]=0; p.messi[1][2]=0; ans.messi[1][1]=0; ans.messi[1][2]=1;
p.messi[2][1]=0; p.messi[2][2]=0; ans.messi[2][1]=1; ans.messi[2][2]=1;
if (n==0)
{
cout<<"0"<<endl;
continue;
};
if (n==1)
{
cout<<"1"<<endl;
continue;
};
bool m=true;
int ci=n-1;
while (ci>0)
{
if (ci%2==1)
{
if (m)
{
p=ans;
}else
p=work(p,ans);
m=false;
}
ci=ci/2;
ans=work(ans,ans);
}
end[1]=0; end[2]=1;
memset(ku,0,sizeof(ku));
for (int i=1;i<=2;++i)
for (int z=1;z<=2;++z)
{
ku[i][1]=(ku[i][1]+p.messi[i][z]*end[z]%maxn)%maxn;
}
cout<<ku[2][1]%maxn<<endl;
}
}