Cod sursa(job #2135705)

Utilizator n.nadim2001Nofal Nadim n.nadim2001 Data 19 februarie 2018 08:29:22
Problema Iepuri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.19 kb
#include <iostream>
#include <fstream>

using namespace std;
typedef unsigned long long mat[3][3];
#define MOD 666013

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

int k,x,y,z,A,B,C;

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


void Alan(mat a,int n, mat b)
{
    if(n==0){ for(int i=0;i<3;i++)
                for(int j=0;j<3;j++) b[i][j]=0;
              b[0][0]=b[1][1]=b[2][2]=1;

             }
    else{mat aux;
         Alan(a,n/2,aux);
         inm(aux,aux,b);
         if(n%2)inm(b,a,b);
        }
}


int main()
{
mat q,t;
int T;
    fin>>T;
    while(T--)
    {
    fin>>x>>y>>z>>A>>B>>C>>k;

    q[0][0]=q[0][1]=q[2][0]=q[1][1]=0;
    q[1][0]=q[2][1]=1;
    q[0][2]=C; q[1][2]=B; q[2][2]=A;

    Alan(q,k-2,t);

    fout<<(x*t[0][2]%MOD+y*t[1][2]%MOD+z*t[2][2]%MOD)%MOD<<'\n';
    }

    fin.close(); fout.close();
    return 0;
}