AOJ 401 gcd定理 + 矩阵快速幂

传送门：AOJ 401

题解

fibonacci数列的性质：
gcd(fib(n),fib(m))=fib(gcd(n,m))
证明：可以通过反证法先证fibonacci数列的任意相邻两项一定互素，然后可证n>m时gcd(fib(n),fib(m))=gcd(fib(n-m),fib(m))，递归可
求gcd(fib(n),fib(m))=gcd(fib(k),fib(l))，最后k=l，不然继续递归。K是通过展转相减法求出，易证k=gcd(n,m)，所以gcd(fib(n),fib(m))
=fib(gcd(n,m))。

---

实现

1.现求gcd(n , m)
2.构造矩阵， 矩阵快速幂求解

---

/*
adrui's submission
Language : C++
Result : Accepted
Love : ll
Favorite : Dragon Balls


Standing in the Hall of Fame
*/


#include<cstdio>
#include<cstring>
using namespace std;

#define debug 0
#define mod 10003
#define M(a, b) memset(a, b, sizeof(a))

int n, m;

struct Matrix {                                         //矩阵
    int mat[2][2];
    int row, col;

    Matrix(int _row, int _col) {
        row = _row;
        col = _col;
        M(mat, 0);
    }

    void unit() {
        for (int i = 0; i < row; i++)
            mat[i][i] = 1;
    }

    void init() {
        mat[0][1] = mat[1][0] = mat[1][1] = 1;
    }
};

Matrix operator * (Matrix a, Matrix b) {                //矩阵乘法
    Matrix c(a.row, b.col);

    for (int i = 0; i < a.row; i++)
        for (int j = 0; j < c.col; j++)
            for (int k = 0; k < a.col; k++)
                c.mat[i][j] = (c.mat[i][j] + a.mat[i][k] * b.mat[k][j]) % mod;

    return c;
}

int operator ^ (Matrix tmp, int b) {                    //快速幂
    Matrix res(2, 2);
    res.unit();

    while (b) {
        if (b & 1) res = res * tmp;
        tmp = tmp * tmp;
        b >>= 1;
    }

    return res.mat[0][1];
}

int main() {
#if debug
    freopen("in.txt", "r", stdin);
#endif //debug

    while (~scanf("%d%d", &n, &m), n + m) {
        Matrix res(2, 2);
        res.init();

        while (m) {                                     //gcd
            int t = m;
            m = n % m;
            n = t;
        }

        int a = res ^ n;                                //矩阵快速幂
        printf("%d\n", a);                              //ans
    }

    return 0;
}