Cod sursa(job #2478817)

Utilizator Rares31100Popa Rares Rares31100 Data 22 octombrie 2019 19:07:11
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.92 kb
#include <bits/stdc++.h>
#define MOD 666013

using namespace std;

long long t,x,y,z,a,b,c,n;

void product(long long A[3][3],long long B[3][3])
{
    long long C[3][3]={{0,0,0},{0,0,0},{0,0,0}};
    for(int i=0;i<=2;i++)
        for(int j=0;j<=2;j++)
            for(int k=0;k<=2;k++)
            {
                C[i][j]+=A[i][k]*B[k][j];
                C[i][j]%=MOD;
            }

    for(int i=0;i<=2;i++)
        for(int j=0;j<=2;j++)
            A[i][j]=C[i][j];
}

int main()
{
    freopen("iepuri.in","r",stdin);
    freopen("iepuri.out","w",stdout);
    cin>>t;

    for(int l=1;l<=t;l++)
    {
        cin>>x>>y>>z>>a>>b>>c>>n;

        long long A[3][3]={{0,0,c},{1,0,b},{0,1,a}};
        long long F[3][3]={{1,0,0},{0,1,0},{0,0,1}};

        do{

            if(n%2)
                product(F,A);

            product(A,A);

            n/=2;
        }while(n);

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

}