poj 3070 Fibonacci

http://poj.org/problem?id=3070

　　入门级矩阵快速幂，自己打了个属于自己的模板！

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>

using namespace std;
typedef __int64 ll;
const int mod = 10000;
const int matSize = 100;

struct Matrix {
    ll val[matSize][matSize];

    Matrix(bool Init = false) {
        for (int i = 0; i < matSize; i++) {
            for (int j = 0; j < matSize; j++) {
                val[i][j] = 0;
            }
            if (Init) val[i][i] = 1;
        }
    }


    void print() {
        for (int i = 0; i < matSize; i++) {
            for (int j = 0; j < matSize; j++) {
                printf("%I64d ", val[i][j]);
            }
            puts("");
        }
        puts("~~~");
    }
} Base;

Matrix operator * (Matrix _a, Matrix _b) {
    Matrix ret = Matrix();

    for (int i = 0; i < matSize; i++) {
        for (int k = 0; k < matSize; k++) {
            if (_a.val[i][k]) {
                for (int j = 0; j < matSize; j++) {
                    ret.val[i][j] += _a.val[i][k] * _b.val[k][j];
                    ret.val[i][j] %= mod;
                }
            }
        }
    }

    return ret;
}

Matrix operator ^ (Matrix _a, ll _p) {
    Matrix ret = Matrix(true);

    while (_p) {
        if (_p & 1) {
            ret = ret * _a;
        }
        _a = _a * _a;
        _p >>= 1;
    }

    return ret;
}

void initBase(ll _k = 1, ll _a = 1) {
    Base.val[0][1] = _k;
    Base.val[1][1] = _a;
    Base.val[0][0] = 0;
    Base.val[1][0] = 1;
}

ll fun(ll _x) {
    Matrix ret = Matrix();

    ret.val[0][0] = 0;
    ret.val[0][1] = 1;

    ret = ret * (Base ^ _x);
//    ret.print();

    return ret.val[0][0];
}

ll deal(ll _x) {
    return fun(_x);
}

int main() {
    ll n;

    initBase();
//    Base.print();
    while (~scanf("%I64d", &n) && ~n) {
        printf("%I64d\n", deal(n));
    }

    return 0;
}

——wirtten by Lyon