Cod sursa(job #1820780)

Utilizator MotoAMotoi Alexandru MotoA Data 2 decembrie 2016 11:13:28
Problema Iepuri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.01 kb
#include <fstream>
#include <cstring>
using namespace std;
const int MOD = 666013;
ifstream f("iepuri.in");
ofstream g("iepuri.out");

int T, N, X, Y, Z, A, B, C;

void inmult(int A[][3], int B[][3]) // A <-- A*B
{
    int C[3][3];
    for(int i = 0; i < 3; i++)
        for(int j = 0; j < 3; j++)
        {
            long long s = 0;
            for(int k = 0; k < 3; k++)
                s += (long long)A[i][k] * B[k][j];
            C[i][j] = s % MOD;
        }
    memcpy(A, C, sizeof(C));
}

int putere(int n)
{
 int M[3][3] = {{0, 0, C}, {1, 0, B}, {0, 1, A}};
 int P[3][3] = {{X, Y, Z}, {0, 0, 0}, {0, 0, 0}};

    while(n > 0)
    {
        while(n % 2 == 0)
        {
            inmult(M, M);
            n /= 2;
        }
        inmult(P, M);
        n--;
    }
    return P[0][2];
}

int main()
{

    f >> T;
    while(T--)
    {
        f >> X >> Y >> Z >> A >> B >> C >> N;
        g << putere(N - 2) << '\n';
    }
    f.close();
    g.close();
    return 0;
}