Cod sursa(job #2492160)

Utilizator MihneaGhiraMihnea MihneaGhira Data 13 noiembrie 2019 23:57:43
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.39 kb
#include<fstream>
#define MOD 666013
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
long long T, n,pow;
long long a[3][3],auxiliar[3][3],I3[3][3],x,y,z,A,B,C;

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

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

int main(){
    fin>>T;
    for(int i=1;i<=T;i++){
        fin>>x>>y>>z>>A>>B>>C>>n;
        for(int i=0;i<=2;i++)
            for(int j=0;j<=2;j++)
            if(i==j)
                I3[i][j]=1;
            else
                I3[i][j]=0;
        a[0][1]=B;a[0][0]=A;a[0][2]=C; /// BAC :(
        ///
        a[1][1]=a[1][2]=a[2][0]=a[2][2]=0;
        ///
        a[2][1]=a[1][0]=1;
        ///
        pow=n-2;
        while(pow!=0){
            if(pow%2==1) {
                inm(I3,a,auxiliar);
                cpy(I3,auxiliar);
            }
            inm(a,a,auxiliar);
            cpy(a,auxiliar);
            pow/=2;
        }
        fout<<((I3[0][2]*x)%MOD+(I3[0][1]*y)%MOD+(I3[0][0]*z)%MOD)%MOD<<"\n";
    }
    return 0;
}