[HDU2256]Problem of Precision

题目大意：

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;

struct Matrix
{
    int element[2][2];
};

int n, kase;
Matrix a, b;

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

void POW(int k)
{
    if (k != 1) POW(k / 2);
    else return;
    a = MUL(a, a);
    if (k % 2 == 1) a = MUL(a, b);
}


int main()
{
    cin >> kase;
    while (kase--)
    {
        cin >> n;
        b.element[0][0] = 5;
        b.element[0][1] = 2;
        b.element[1][0] = 12;
        b.element[1][1] = 5;
        a = b;
        if (n > 1) POW(n - 1);
        b.element[0][0] = 5;
        b.element[0][1] = 2;
        b.element[1][0] = 0;
        b.element[1][1] = 0;
        if (n > 1) a = MUL(b, a);
        else a = b;
        cout << (2 * a.element[0][0] + 1023) % 1024 << endl;
    }
}