Cod sursa(job #1562537)

Utilizator vladutz15FMI Cornoiu Vlad vladutz15 Data 5 ianuarie 2016 11:44:35
Problema Iepuri Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.32 kb
#include <iostream>
#include <fstream>
#define MOD 666013
using namespace std;

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

int cc[5][5],aa[5][5],bb[5][5],dd[5][5];
int x,y,z,A,B,C,n,t,i,j,k;
void Inm_mat(int a[][5], int b[][5], int c[][5])
{
    int i,j,k;
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            c[i][j]=0;
    for(i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            for(k=1;k<=3;k++)
                c[i][j]=(c[i][j]+(a[i][k]*b[k][j])%MOD)%MOD;
}
void copycat(int b[][5],int c[][5])
{
    int i,j;
    for (i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            b[i][j]=c[i][j];
}
void reinit()
{
    for (i=1;i<=3;i++)
        for(j=1;j<=3;j++)
            aa[i][j]=bb[i][j]=cc[i][j]=dd[i][j]=0;
}
int main()
{
    f>>t;
    for(;t;t--)
    {
        f>>x>>y>>z>>A>>B>>C>>n;
        n-=2;
        bb[1][2]=1;
        bb[2][3]=1;
        bb[3][1]=C;
        bb[3][2]=B;
        bb[3][3]=A;
        aa[1][1]=1;
        aa[2][2]=1;
        aa[3][3]=1;
        for (i=0;(1<<i)<=n;++i)
        {
            if (((1<<i) & n) > 0)
            {
                Inm_mat(bb,aa,cc);
                copycat(bb,cc);
            }
            Inm_mat(aa,aa,dd);
            copycat(aa,dd);
        }
        g<<((1LL*bb[3][1]*x)%MOD + (1LL*bb[3][2]*y)%MOD + (1LL*bb[3][3]*z)%MOD)%MOD<<"\n";
        reinit();

    }
    return 0;
}