Cod sursa(job #3347579)

Utilizator MilitaruMihaiMihaiMIlitaru MilitaruMihai Data 17 martie 2026 12:24:17
Problema Iepuri Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.44 kb
#include <iostream>
#include <fstream>
#define MOD 666013
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int t;
int c[3][3] = {{0 ,0, 0}, {1, 0, 0}, {0 ,1, 0}};
int a[3][3];
int u[3][3] = { {1, 0, 0}, {0, 1, 0}, {0, 0, 1}};
int sol[3][3];
void inmultire(int a[3][3], int b[3][3])
{
    int c[3][3];
    for (int i = 0; i < 3; ++i)
        for (int j = 0; j < 3; ++j)
    {
        c[i][j] = 0;
        for (int k = 0; k < 3; ++k)
        {
            c[i][j] += a[i][k] * b[k][j];
            c[i][j] %= MOD;
        }
    }
    for (int i = 0; i < 3; ++i)
        for (int j = 0; j < 3; ++j)
            a[i][j] = c[i][j];
}
void exp(int sol[3][3], int k)
{
    while (k)
    {
        if (k % 2 == 1) inmultire(sol,c), --k;
            else inmultire(c,c), k /= 2;
    }
}
int main()
{
    fin >> t;
    for (; t; --t)
    {
        int x, y, z, aa, b, cc, n;
        fin >> x >> y >> z >> aa >> b >> cc >> n;
        a[0][0] = x;
        a[0][1] = y;
        a[0][2] = z;

        c[0][0] = 0;
        c[0][1] = 0;
        c[0][2] = cc;
        c[1][0] = 1;
        c[1][1] = 0;
        c[1][2] = b;
        c[2][0] = 0;
        c[2][1] = 1;
        c[2][2] = aa;

        for (int i = 0; i < 3; ++i)
            for (int j = 0; j < 3; ++j)
                sol[i][j] = u[i][j];
        exp(sol,n);
        inmultire(a,sol);
        fout << a[0][0] << '\n';
    }
    return 0;
}