Cod sursa(job #804599)

Utilizator R.A.RFMI Romila Remus Arthur R.A.R Data 29 octombrie 2012 23:17:26
Problema Iepuri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.37 kb
#include <fstream>
#define MOD 666013

using namespace std;

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

long long Rez[4][4],M[4][4],Aux[4][4];

void Init(long long T[][4])
{
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            T[i][j]=0;
}
void Copy(long long T[][4],long long R[][4])
{
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            R[i][j]=T[i][j];
}

void Compute(long long T[][4],long long R1[][4],long long R2[][4])
{
    Init(T);
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            for(int k=0;k<3;k++)
                T[i][j]+=R1[i][k]*R2[k][j],T[i][j]%=MOD;
}

int main()
{
    int T,X,Y,Z,A,B,C,N;
    int i,j,k;
    in>>T;

    while(T--)
    {
        in>>X>>Y>>Z>>A>>B>>C>>N;
        M  [0][0] = 0,M  [0][1] = 0,M  [0][2] = C,M  [1][0] = 1,M  [1][1] = 0,M  [1][2] = B,M  [2][0] = 0,M  [2][1] = 1,M  [2][2] = A;
        Rez[0][0] = 1,Rez[0][1] = 0,Rez[0][2] = 0,Rez[1][0] = 0,Rez[1][1] = 1,Rez[1][2] = 0,Rez[2][0] = 0,Rez[2][1] = 0,Rez[2][2] = 1;
        for(N-=2;N;N>>=1)
        {
            if(N&1)//daca bitul e 1 Rez = Rez * M
            {
                Compute(Aux,Rez,M);
                Copy(Aux,Rez);
            }
            Compute(Aux,M,M);
            Copy(Aux,M);
        }
        out<<(X*Rez[0][2]+Y*Rez[1][2]+Z*Rez[2][2])%MOD<<'\n';

    }
    return 0;
}