hdu 6198 number number number

学了下矩阵做斐波那契数列。。

#include <cstdio>
#include <iostream>

using namespace std;

const int MOD =998244353;

struct matrix//定义矩阵结构体
{
    long long  m[2][2];
}ans, base;

matrix multi(matrix a, matrix b)//定义矩阵乘法
{
    matrix tmp;
    for(int i = 0; i < 2; ++i)
    {
        for(int j = 0; j < 2; ++j)
        {
            tmp.m[i][j] = 0;
            for(int k = 0; k < 2; ++k)
                tmp.m[i][j] = (tmp.m[i][j] + 1LL*a.m[i][k] * b.m[k][j]%MOD) % MOD;
        }
    }
    return tmp;
}
int fast_mod(int n)  // 求矩阵 base 的  n 次幂
{
    base.m[0][0] = base.m[0][1] = base.m[1][0] = 1;
    base.m[1][1] = 0;
    ans.m[0][0] = ans.m[1][1] = 1;  // ans 初始化为单位矩阵
    ans.m[0][1] = ans.m[1][0] = 0;
    while(n)
    {
        if(n & 1)  //实现 ans *= t; 其中要先把 ans赋值给 tmp，然后用 ans = tmp * t
            ans = multi(ans, base);

        base = multi(base, base);
        n >>= 1;
    }
    return ans.m[0][1];
}

int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        //n++;
        //n*=2;
        //n+=2;
        n=3+n*2;
        printf("%d\n", fast_mod(n)-1);
    }
    return 0;
}

队友代码

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>
#include<vector>

typedef long long unsigned ll;
const ll mod = 998244353;
const int inf = 0x3f3f3f3f;

using namespace std;

typedef vector<ll> vec;
typedef vector<vec> mat;

mat mul(mat A,mat B){
    mat C(2,vec(2));
    for(int i=0;i<2;i++)
        for(int k=0;k<2;k++)
            for(int j=0;j<2;j++){
                C[i][j]=(C[i][j]+A[i][k]*B[k][j])%mod;
            }
    return C;
}

mat Pow(mat A,ll n){
    mat C(2,vec(2));
    C[0][0]=C[1][1]=1;
    while(n){
        if(n&1)    C=mul(C,A);
        n>>=1;
        A=mul(A,A);
    }
    return C;
}

int main(){
    ll n;
    while(scanf("%lld",&n)==1){
        mat C(2,vec(2));
        C[0][0]=C[0][1]=C[1][0]=1;
        C[1][1]=0;
        mat D=Pow(C,n*2+1);
        ll ans=(D[0][0]+D[0][1]-1)%mod;
    //    cout<<(Pow(C,n))[0][0]<<endl;
        printf("%lld\n",ans);
    }
    return 0;
}