hdu 2256 Problem of Precision

题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=2256

首先看网上流传的解法：

如果用(xn+yn*sqrt(6))%1024来求解结果，是错误的，因为double类型本身就涉及到精度问题！如果再用double类型的取余，那就错了！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;

const int MAXN = 3;
const int iMod = 1024;

struct Matrix
{
    int iMatrix[MAXN][MAXN];
};

Matrix iPer, iCell;
void Inite()
{
    iCell.iMatrix[0][0] = 5, iCell.iMatrix[0][1] = 12, iCell.iMatrix[1][0] = 2, iCell.iMatrix[1][1] = 5;
    iPer.iMatrix[0][0] = iPer.iMatrix[1][1] = 1, iPer.iMatrix[0][1] = iPer.iMatrix[1][0] = 0;
}

Matrix Multi_Matrix(Matrix a, Matrix b)
{
    Matrix c;
    int i, j, k;
    for(i = 0; i < 2; ++i)
    {
        for(j = 0; j < 2; ++j)
        {
            c.iMatrix[i][j] = 0;
            for(k = 0; k < 2; ++k)
            {
                c.iMatrix[i][j] += a.iMatrix[i][k] * b.iMatrix[k][j];
                c.iMatrix[i][j] %= iMod;
            }
        }
    }
    return c;
}

Matrix Quick_Mod_Matrix(int k)
{
    if(k == 1)
        return iCell;
    Matrix tmp = iCell, c = iPer;

    while(k)
    {
        if(k&1)
        {
            c = Multi_Matrix(c, tmp);
            k--;
        }
        k >>= 1;
        tmp = Multi_Matrix(tmp, tmp);
    }
    return c;
}

int main()
{
    int T, k;
    scanf("%d", &T);
    Matrix c;
    Inite();
    while(T--)
    {
        scanf("%d", &k);
        c = Quick_Mod_Matrix(k);
        printf("%d\n", (2*c.iMatrix[0][0] - 1)%iMod);
    }
    return 0;
}