【矩阵快速幂】Fibonacci

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9845		Accepted: 7019

Description

In the Fibonacci integer sequence, F₀ = 0, F₁ = 1, and F_n = F_{n − 1} + F_{n − 2} for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …

An alternative formula for the Fibonacci sequence is

.

Given an integer n, your goal is to compute the last 4 digits of F_n.

Input

The input test file will contain multiple test cases. Each test case consists of a single line containing n (where 0 ≤ n ≤ 1,000,000,000). The end-of-file is denoted by a single line containing the number −1.

Output

For each test case, print the last four digits of F_n. If the last four digits of F_n are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print F_n mod 10000).

Sample Input

0
9
999999999
1000000000
-1

Sample Output

0
34
626
6875

Hint

As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by

.

Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:

.

Source

Stanford Local 2006

学线代学得想死

现在才意识到矩阵的神奇的作用

师兄说有些题就是给出递推公式，用矩阵+快速幂，算n很大时候的值。关键是要构造出这样的一个矩阵。

#include

#include

#include

#include

using namespace std;

#define ll long long

const int mod = 10000;

const int dim = 2; //矩阵大小

int mk = 2;       //运算时矩阵大小

struct matrix

{

ll a[dim][dim];

matrix()

{

memset(a, 0, sizeof(a));

}

};

matrix operator *(const matrix  a, const matrix  b)

{

matrix ret;

for (int i = 0; i < mk;i++)

   for (int j = 0; j < mk;j++)

for (int k = 0; k < mk; k++)

{

ret.a[i][j] += a.a[i][k] * b.a[k][j];

ret.a[i][j] %= mod;

}

return ret;

}

matrix operator ^( matrix a, ll n)

{ 

matrix ret;

for (int i = 0; i < mk; i++) ret.a[i][i] = 1;

while (n)

{

if (n & 1) ret = ret*a;

a = a*a;

n >>= 1;

}

return ret;

}

int main()

{

matrix a; 

a.a[0][0] = a.a[0][1] = a.a[1][0] = 1;

while (1)

{

ll n;

scanf("%I64d", &n);

if (n == -1) break;

printf("%I64d\n", (a^n).a[1][0]);

}

}