//时间复杂度(n)
#include<stdio.h>
#include<string.h>
#define N 20
int f[N+1];
int fib(int n)
{
if(f[n])
return f[n];
else if(n==1||n==2)
return f[n]=1;
else
{
if(f[n - 2] == 0) f[n - 2] = fib(n-1);
if(f[n - 1] == 0) f[n - 1] = fib(n - 1);
return f[n] = f[n - 2] + f[n - 1];
}
}
int main(void)
{
memset(f,0,sizeof(f)); //memset() 的作用是在一段内存块中填充某个给定的值。
int n,a;
scanf("%d",&n);
while(n--)
{
scanf("%d",&a);
printf("%d\n",fib(a));
}
return 0;
}
//时间复杂度(2^n)
#include<stdio.h>
int fib(int n)
{
return(n == 1 || n == 2) ? 1: fib(n-2) + fib(n - 1);
}
int main(void)
{
int a,n;
scanf("%d",&n);
while(n--)
{
scanf("%d",&a);
printf("%d",fib(a));
}
return 0;
}
//时间复杂度( 以二为底n的对数)
#include<stdio.h>
typedef struct MTX{
int m00;
int m01;
int m10;
int m11;
}mtx;
mtx mtx0;
mtx m_multiply(mtx a, mtx b)
{
mtx c;
c.m00=a.m00*b.m00+a.m01*b.m10;
c.m01=a.m00*b.m01+a.m01*b.m11;
c.m10=a.m10*b.m00+a.m11*b.m10;
c.m11=a.m10*b.m01+a.m11*b.m11;
return c;
}
mtx m_power(int k)
{
mtx m;
if(1==k)
{
m=mtx0;
return m;
}
else if(0==k%2)
{
m=m_multiply(m_power(k/2),m_power(k/2));
return m;
}
else
{
m=m_multiply(m_power((k-1)/2),m_power((k-1)/2));
m=m_multiply(m,mtx0);
return m;
}
}
int fibonacci(int n)
{
int m;
mtx mtx1;
int t[2]={0, 1};
if(n<3)
return t[n];
else
mtx1=m_power(n-2);
return mtx1.m00;
}
int main(void)
{
mtx0.m00=1;
mtx0.m01=1;
mtx0.m10=1;
mtx0.m11=0;
int n=8;
int m=fibonacci(n);
printf("Fibonacci(%d)=%d",n,m);
return 0;
}