Cod sursa(job #2277186)

Utilizator rebecca0312Andrei Rebecca rebecca0312 Data 5 noiembrie 2018 21:04:42
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2 kb
#include<fstream>
using namespace std;

const int MOD=666013;
long long mate[4][4],aux[4][4];

void press_f(int a, int b, int c, int n){
    n-=2;
    for(int i=0;i<=3;i++)
        for(int j=0;j<=3;j++)
            aux[i][j]=0;
    aux[0][0]=aux[1][1]=aux[2][2]=1;
    mate[0][0]=mate[0][1]=0,mate[0][2]=c;
    mate[1][0]=1,mate[1][1]=0,mate[1][2]=b;
    mate[2][0]=0,mate[2][1]=1,mate[2][2]=a;
    while(n){
        if(n%2){
            ///aux=aux*mate=chiul
            long long pass_the_auxcord[4][4];
            for(int i=0;i<=3;i++)
                for(int j=0;j<=3;j++)
                    pass_the_auxcord[i][j]=0;
            for(int i=0;i<=2;i++)
                for(int j=0;j<=2;j++)
                    for(int k=0;k<=2;k++)
                        pass_the_auxcord[i][j]=(pass_the_auxcord[i][j]+aux[i][k]*mate[k][j])%MOD;
            for(int i=0;i<=2;i++)
                for(int j=0;j<=2;j++)
                    aux[i][j]=pass_the_auxcord[i][j];
        }
        n/=2;
        ///mate*mate=mate^2=mate_ftw
        long long pass_the_auxcord[4][4];
        for(int i=0;i<=3;i++)
            for(int j=0;j<=3;j++)
                pass_the_auxcord[i][j]=0;
        for(int i=0;i<=2;i++)
            for(int j=0;j<=2;j++)
                for(int k=0;k<=2;k++)
                    pass_the_auxcord[i][j]=(pass_the_auxcord[i][j]+mate[i][k]*mate[k][j])%MOD;
        for(int i=0;i<=2;i++)
            for(int j=0;j<=2;j++)
                mate[i][j]=pass_the_auxcord[i][j];
    }
}

int main(){
    ifstream fin("iepuri.in");
    ofstream fout("iepuri.out");
    int t;
    fin>>t;
    for(int i=1;i<=t;i++){
        int x,y,z,a,b,c,n;
        fin>>x>>y>>z>>a>>b>>c>>n;
        press_f(a, b, c, n);
        long long v[3];
        v[0]=x,v[1]=y,v[2]=z;
        for(int j=0;j<=2;j++){
            long long s=0;
            for(int k=0;k<=2;k++)
                s=(s+v[k]*aux[k][j])%MOD;
            if(j==2)
                fout<<s%MOD<<'\n';
        }
    }
    return 0;
}