Cod sursa(job #1391063)

Utilizator pincucatalinPincu Catalin pincucatalin Data 17 martie 2015 16:28:17
Problema Iepuri Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.2 kb
#include <cstdio>

using namespace std;
FILE *in=fopen ("iepuri.in","r");
FILE *out=fopen ("iepuri.out","w");
const int mod=666013;
int m[4][4],p[4][4],x,y,z,a,b,c,n;
void inmultire (int a[4][4],int b[4][4])
{
    int aux[4][4];
    for (int i=1; i<=3; i++)
        for (int j=1; j<=3; j++)
        {
            aux[i][j]=0;
            for (int p=1; p<=3; p++)
                aux[i][j]=aux[i][j]+a[i][p]*b[p][j]%mod;
        }
    for (int i=1; i<=3; i++)
        for (int j=1; j<=3; j++)
            a[i][j]=aux[i][j]%mod;
}
int main()
{
    int t;
    fscanf (in,"%d",&t);
    for (int i=1; i<=t; i++)
    {
        for (int i=1; i<=4; i++)
            for (int j=1; j<=4; j++)
                m[i][j]=p[i][j]=0;
        fscanf (in,"%d%d%d%d%d%d%d",&x,&y,&z,&a,&b,&c,&n);
        m[1][1]=a;
        m[1][2]=b;
        m[1][3]=c;
        m[2][1]=1;
        m[3][2]=1;
        p[1][1]=p[2][2]=p[3][3]=1;
        int k=n-2;
        while (k!=0)
        {
            if (k%2!=0)
                inmultire (p,m);
            //fprintf(out, "k = %d\n\n", k);
            k/=2;
            inmultire(m,m);
            //afisare();
        }
        fprintf (out,"%d\n",(p[1][1]*z+p[1][2]*y+p[1][3]*x));
    }

    return 0;
}