Cod sursa(job #3349425)

Utilizator Diaconescu99Mihai Diaconescu Diaconescu99 Data 29 martie 2026 09:06:26
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.23 kb
#include <fstream>

/// Varianta 3 - ok
using namespace std;
const int MOD = 666013;

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

ifstream f("iepuri.in");
ofstream g("iepuri.out");

void mul(int A[3][3], int B[3][3]) { /// A <- A * B
    long long C_mat[3][3];
    int i, j, k;
    for (i = 0; i < 3; ++i) {
        for (j = 0; j < 3; ++j) {
            C_mat[i][j] = 0;
            for (k = 0; k < 3; ++k) {
                C_mat[i][j] += (long long)A[i][k] * B[k][j];
            }
        }
    }

    for (i = 0; i < 3; ++i) {
        for (j = 0; j < 3; ++j) {
            A[i][j] = C_mat[i][j] % MOD;
        }
    }
}

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

    int V[3][3] = {
        {X, Y, Z},
        {0, 0, 0},
        {0, 0, 0}
    };

    while (n > 0) {
        if (n % 2 == 0) {
            mul(M, M);
            n /= 2;
        } else {
            mul(V, M);
            n--;
        }
    }
    return V[0][2];
}

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