Cod sursa(job #3192618)

Utilizator Giulian617Buzatu Giulian Giulian617 Data 13 ianuarie 2024 01:47:34
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.1 kb
#include <bits/stdc++.h>
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
const int MOD=666013;
int T,n,X,Y,Z,A,B,C,a[3][3],ans[3][3];
void initialization()
{
    a[0][0]=a[0][1]=a[1][1]=a[2][0]=0;
    a[1][0]=a[2][1]=1;
    a[0][2]=C;
    a[1][2]=B;
    a[2][2]=A;
    ans[0][0]=X;
    ans[0][1]=Y;
    ans[0][2]=Z;
    ans[1][0]=ans[1][1]=ans[1][2]=0;
    ans[2][0]=ans[2][1]=ans[2][2]=0;
}
void multiplication(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++)
            for(int k=0; k<3; k++)
                c[i][j]=(c[i][j]+(1LL*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];
}
void fast_exp(int power)
{
    while(power)
    {
        if(power%2)
            multiplication(ans,a);
        multiplication(a,a);
        power/=2;
    }
}
int main()
{
    f>>T;
    for(int t=1;t<=T;t++)
    {
        f>>X>>Y>>Z>>A>>B>>C>>n;
        initialization();
        fast_exp(n-2);
        g<<ans[0][2]<<'\n';
    }
    return 0;
}