Cod sursa(job #3319716)

Utilizator Alexia12345Maftei Alexia Alexia12345 Data 2 noiembrie 2025 20:07:43
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.29 kb
#include <fstream>
#define MOD 666013
using namespace std;

ifstream fin("iepuri.in");
ofstream fout("iepuri.out");

long long mat[4][4],tk,rez[4][4];

void inmultire(long long a[4][4], long long b[4][4])
{
    long long c[4][4]={0};
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            for(int k=0;k<3;k++)
                c[i][j]=(c[i][j]+a[i][k]*b[k][j]%MOD)%MOD;

    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            a[i][j]=c[i][j]%MOD;
}

void fib(long long n, long long a[4][4])
{
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            if(i==j)
                rez[i][j]=1;
            else rez[i][j]=0;
    while(n)
    {
        if(n%2==1)
            inmultire(rez,mat);
        inmultire(mat,mat);
        n/=2;
    }
}

int main()
{
    int t;
    fin>>t;
    while(t--)
    {
        long long x,y,z,a,b,c,n;
        fin>>x>>y>>z;
        fin>>a>>b>>c;
        fin>>n;
        for(int i=0;i<3;i++)
            for(int j=0;j<3;j++)
                mat[i][j]=0;
        mat[0][1] = 1;
        mat[1][2] = 1;
        mat[2][0] = c;
        mat[2][1] = b;
        mat[2][2] = a;

        fib(n,mat);

        tk=(rez[0][0]*x%MOD+rez[0][1]*y%MOD+rez[0][2]*z%MOD)%MOD;
        fout<<tk<<endl;
    }
    return 0;
}