Cod sursa(job #1325251)

Utilizator andrei.arnautuAndi Arnautu andrei.arnautu Data 23 ianuarie 2015 17:38:09
Problema Iepuri Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.54 kb
#include <cstdio>
#include <cstring>
#define Mod 666013
using namespace std;

FILE *fin=freopen("iepuri.in","r",stdin);
FILE *fout=freopen("iepuri.out","w",stdout);

int M[3][3], Sol[3][3], Aux[3][3];
int t, a, b, c, x, y, z, n;

void Initialize()
{
    memset(Sol, 0, sizeof(Sol));

    for(int i = 0; i < 3; ++i)
        Sol[i][i] = 1;

}

void Multiply_1()
{
    int i, j, l;
    memset(Aux, 0, sizeof(Aux));

    for(i = 0; i < 3; ++i)
        for(j = 0; j < 3; ++j)
            for(l = 0; l < 3 ; ++l)
                Aux[i][j] = (1LL * Sol[i][l] * M[l][j] + Aux[i][j]) % Mod;

    memcpy(Sol, Aux, sizeof(Sol));

}

void Multiply_2()
{
    int i, j, l;
    memset(Aux, 0, sizeof(Aux));

    for(i = 0; i < 3; ++i)
        for(j = 0; j < 3; ++j)
            for(l = 0; l < 3 ; ++l)
                Aux[i][j] = (1LL * M[i][l] * M[l][j] + Aux[i][j]) % Mod;

    memcpy(M, Aux, sizeof(M));
}

void Pow(int p)
{
    int i = 1;

    memset(M, 0, sizeof(M));
    M[1][0] = M[2][1] = 1;
    M[0][2] = c, M[1][2] = b, M[2][2] = a;

    for(; i <= p; i <<= 1)
    {
        if(i & p)
            Multiply_1();
        Multiply_2();
    }
    printf("%d\n", (1LL * Sol[0][2] * x + 1LL * Sol[1][2] * y + 1LL * Sol[2][2] * z) % Mod);
}

int main()
{

    for(scanf("%d", &t); t > 0; --t)
    {
        scanf("%d%d%d%d%d%d%d", &x, &y, &z, &a, &b, &c, &n);

        //if( n == 3 )
        //{ printf("%d\n", (x * c + y * b + z * a) % Mod); continue; }

        Initialize();
        Pow(n - 2);
    }
}