Cod sursa(job #2491698)

Utilizator MihneaGhiraMihnea MihneaGhira Data 12 noiembrie 2019 22:49:02
Problema Iepuri Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.32 kb
#include<fstream>
#define MOD 666013
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
long long n,x,y,z,A,B,C,T,pow;
long long a[3][3],aux[3][3],I[3][3];

void copiere(long long a[][3], long long b[][3]) {
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            a[i][j]=b[i][j];
}


void inm(long long a[][3],long long b[][3],long long c[][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;
            }
        }
}

int main(){
    fin>>T;
    for(int i=1;i<=T;i++){
        fin>>x>>y>>z>>A>>B>>C>>n;
        ///
        a[1][1]=a[1][2]=a[2][0]=a[2][2]=0;
        ///
        a[0][1]=B;a[0][0]=A;a[0][2]=C; /// BAC :(
        ///
        a[2][1]=a[1][0]=1;
        ///

        pow=n-2;
        for(int i=0;i<=2;i++)
            for(int j=0;j<=2;j++)
                if(i==j)
                    I[i][j]=1;

        while(pow!=0){
            if(pow%2==1){
                inm(I,a,aux);
                copiere(I,aux);
            }
            inm(a,a,aux);
            copiere(a,aux);
            pow/=2;
        }
        fout<<( (I[0][0]*x)%MOD + (I[0][1]*y)%MOD + (I[0][2]*z)%MOD )%MOD<<"\n";
    }
    return 0;
}