Fibonacci sequence
2018-01-22 17:08
302 查看
斐波那契前N项的和:f(n)=f(n+1)-1
#include<stdio.h>
#include<string.h>
struct Edge
{
long long num[3][3];
}a;
long long xl,yl,t;
long long ksj(long long x,long long y)
{
long long ans=0;
while(y)
{
if(y%2)
ans=(ans+x)%10000;
x=(x+x)%10000;
y/=2;
}
return ans;
}
Edge play(Edge x,Edge y)
{
Edge idx;
memset(&idx,0,sizeof(idx));
for(int i=1;i<=2;i++)
for(int j=1;j<=2;j++)
for(int k=1;k<=2;k++)
idx.num[i][j]=(idx.num[i][j]+ksj(x.num[i][k],y.num[k][j]))%10000;
return idx;
}
Edge power(Edge x,long long y)
{
if(y==1)
return x;
Edge idx=power(x,y/2);
idx=play(idx,idx);
if(y%2)
idx=play(idx,x);
return idx;
}
int main()
{
scanf("%lld",&t);
for(int i=1;i<=t;i++)
{
scanf("%lld%lld",&xl,&yl);
a.num[1][1]=1;
a.num[1][2]=1;
a.num[2][1]=1;
Edge idx=power(a,yl);
Edge idx2;
long long idx3=(idx.num[1][1]+idx.num[1][2])%10000;
long long idx4;
if(xl==1)
idx4=1;
else
{
idx2=power(a,xl-1);
idx4=(idx2.num[1][2]+idx2.num[1][1])%10000;
}
printf("%lld\n",(idx3-idx4+10000)%10000);
}
}
相关文章推荐
- ZOJ3952 Fibonacci Sequence Chicken Edition 【模拟】
- ZOJ 3952 Fibonacci Sequence Chicken Edition(构造/模拟)
- POJ3982-The Fibonacci sequence
- 【ZOJ3952 The 17th Zhejiang University Programming Contest E】【简单构造 模拟 or汇编】Fibonacci Sequence Chicken
- POJ3982-The Fibonacci sequence
- 17th浙大校赛 ZOJ3952 Fibonacci Sequence Chicken Edition【汇编】
- Create pseudo-random numbers based on Fibonacci sequence
- 算法学习笔记--2. Selection sort & Fibonacci sequence
- SZ Fibonacci Sequence
- C# Fibonacci Sequence
- A Problem With Fibonacci Sequence
- LeetCode - Fibonacci Sequence/Dynamic Programming - Climbing Stairs
- 1273 Fibonacci sequence sum
- 欧拉项目 Problem 25 of in the Fibonacci sequence to contain 1000 digits
- ZOJ 3952 Fibonacci Sequence Chicken Edition
- ZOJ 3952 Fibonacci Sequence Chicken Edition 模拟
- Recipe 19.3. Generating the Fibonacci Sequence
- Fibonacci sequence of k order
- Sicily 1779. Fibonacci Sequence Multiplication
- uva 10689 - Yet another Number Sequence(缓存,类Fibonacci)