hdu 3306 Another kind of Fibonacci

Another kind of Fibonacci

分析

代码

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define MXM 4
#define mod(x) ((x)%10007)
struct mat{ 
    LL d[MXM][MXM];
    mat operator*(const mat x){
        mat ret;
        LL tmp;
        for(int i = 0; i < MXM; i++){
            for(int j = 0; j < MXM; j++){
                tmp = 0;
                for(int k = 0; k < MXM; k++){
                    tmp = mod(tmp + d[i][k]* x.d[k][j]);
                }
                ret.d[i][j] = tmp;
            }
        }
        return ret;
    }
    void init_unit(){
        for(int i = 0; i < MXM; i++)
            for(int j = 0; j < MXM; j++) d[i][j] = i == j ? 1 : 0;
    }
    void init(LL x, LL y){
        d[0][0] = d[3][1] = 1;
        d[1][0] = d[2][0] = d[3][0] = d[2][3] = d[3][2] = d[3][3] = 0;
        d[0][1] = d[1][1] = mod(x*x);
        d[0][2] = d[1][2] = mod(2*x*y);
        d[0][3] = d[1][3] = mod(y*y);
        d[2][2] = mod(y);
        d[2][1] = mod(x);
    }
}ma;
mat matrixPow(mat base, int pow){
    mat res;
    res.init_unit();
    while(pow){
        if(pow & 1) res = res * base;
        base = base * base;
        pow >>= 1;
    }
    return res;
}
int solve(int n, int x, int y){
    ma.init(x, y);
    ma = matrixPow(ma, n-1);
    return mod(2*ma.d[0][0]+ma.d[0][1]+ma.d[0][2]+ma.d[0][3]);
}
int main(){
    int n, x, y;
    while(scanf("%d%d%d", &n, &x, &y) == 3){
        printf("%d\n", solve(n, x, y));
    }
    return 0;
}