51Nod - 1242 斐波那契数列的第N项

斐波那契数列的定义如下：

F(0) = 0

F(1) = 1

F(n) = F(n - 1) + F(n - 2) (n >= 2)

(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, ...)

给出n，求F(n)，由于结果很大，输出F(n) % 1000000009的结果即可。

Input 输入1个数n(1 <= n <= 10^18)。 Output 输出F(n) % 1000000009的结果。 Sample Input

11

Sample Output

89

矩阵快速幂模板。

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
typedef long long ll;
const int N = 2;
const int MOD = 1000000009;
struct Matrix
{
	ll m[N][N];
};
Matrix A = {1,1,1,0};
Matrix I = {1,0,0,1};
Matrix multi(Matrix a,Matrix b)
{
	Matrix c;
	
	for(int i = 0 ; i < N ; i++)
	{
		for(int j = 0 ; j < N ; j++)
		{
			c.m[i][j] = 0;
			for(int k = 0 ; k < N ; k++)
			{
				c.m[i][j] += a.m[i][k] * b.m[k][j] % MOD;
			}
			c.m[i][j] %= MOD;
		}
	} 
	return c;
}
Matrix power(Matrix A,ll k)
{
	Matrix ans = I ,p = A;
	while(k)
	{
		if(k & 1)
		{
			ans = multi(ans,p);
			k--;
		}
		k>>=1;
		p = multi(p,p);
	}
	return ans;
}
int main()
{
	ll n;
	while(~scanf("%lld",&n))
	{
		Matrix ans = power(A,n - 1);
		printf("%lld\n",ans.m[0][0]);
	}
}