HDU-6189 number number number（矩阵快速幂）

题目http://acm.hdu.edu.cn/showproblem.php?pid=6198
题意：最小的N用n个f[i]的和得到
思路：打表找规律f[3+2*n]-1（学弟找的，，
代码：

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MOD = 998244353;
const int msize = 2;
struct Matrix
{
    ll a[msize][msize];
    Matrix()
    {
        memset(a,0,sizeof(a));
    }
};

Matrix Multi(Matrix p,Matrix q)
{
    Matrix tmp;
    for(int i = 0;i < msize;i++)
    {
        for(int j = 0;j < msize;j++)
        {
            tmp.a[i][j] = 0;
            for(int k = 0;k < msize;k++)
                tmp.a[i][j] += ( p.a[i][k]*q.a[k][j] + MOD) % MOD;
                tmp.a[i][j] %= MOD;
        }
    }
    return tmp;
}

Matrix Fast_Matrix(ll n)
{
    Matrix base,ans;
    base.a[0][0] = base.a[0][1] = base.a[1][0] = 1;
    base.a[1][1] = 0;
    ans.a[0][0] = ans.a[1][1] = 1;
    ans.a[0][1] = ans.a[1][0] = 0;
    while(n > 0)
    {
        if(n & 1)
            ans = Multi(ans,base);
        base = Multi(base,base);
        n >>= 1;
    }
    return ans;
}

int main()
{
    ll n;
    while(~scanf("%lld",&n))
    {
        printf("%lld\n",Fast_Matrix(3+2*n-1).a[0][0]-1);
    }
}