矩阵快速幂——Fibonacci(POJ-3070)

题目

In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 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 Fn.

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 Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn mod 10000).

Sample Input
0
9
999999999
1000000000
-1
Sample Output
0
34
626
6875

题意

输出斐波那契数列第n项，并取模10000，注意n最大1000000000。

解析

直接按题目所给的提示构造0-1矩阵，求其n-2次幂，矩阵左侧两项相加并取模即可。注意前两项特判。

正确代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
#define ll long long
const int mod=10000;
struct matrix//建立矩阵
{
   
    ll m[3][3];
} ans,res;
matrix mul(matrix a,matrix b,int n