【POJ 3070】 Fibonacci

【题目链接】

           点击打开链接

【算法】

          矩阵乘法快速幂

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
const long long MOD = ;

long long n;
struct Matrix
{
    long long n,m;
    long long mat[][];
} ans;

inline void multipy(Matrix &a,Matrix b)
{
    long long i,j,k;
    Matrix ans;
    ans.n = a.n; ans.m = b.m;
    memset(ans.mat,,sizeof(ans.mat));
    for (i = ; i <= a.n; i++)
    {
        for (j = ; j <= b.m; j++)
        {
            for (k = ; k <= a.m; k++)
            {
                ans.mat[i][j] = (ans.mat[i][j] + a.mat[i][k] * b.mat[k][j]) % MOD;
            }
        }
    }
    a = ans;
}

inline void power(Matrix &a,long long n)
{
    Matrix p,ans;
    p.n = p.m = ;
    p.mat[][] = ; p.mat[][] = ;
    p.mat[][] = ; p.mat[][] = ;
    ans.n = ans.m = ;
    ans.mat[][] = ; ans.mat[][] = ;
    ans.mat[][] = ; ans.mat[][] = ;
    while (n > )
    {
        if (n & ) multipy(ans,p);
        n >>= ;
        multipy(p,p);
    }
    a = ans;
}

inline void solve()
{
    Matrix tmp;
    tmp.n = ; tmp.m = ;
    tmp.mat[][] = ; tmp.mat[][] = ;
    ans.n = ans.m = ;
    ans.mat[][] = ans.mat[][] = ans.mat[][] = ;
    ans.mat[][] = ;
    power(ans,n-);
    multipy(ans,tmp);
    cout<< ans.mat[][] << endl;
}

int main()
{

    while (scanf("%lld",&n) != EOF && n != -)
    {
        if (!n) cout<<  << endl;
        else if (n == ) cout<<  << endl;
        else solve();
    }

    return ;
}