Cod sursa(job #1794965)

Utilizator Bodo171Bogdan Pop Bodo171 Data 1 noiembrie 2016 21:07:26
Problema Iepuri Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.22 kb
#include <iostream>
#include<fstream>
#define mod 666013
using namespace std;
int rez[4][4],p2[4][4],aux[4][4],p[35];
int x,y,z,a,b,c,n,t,i,j,k,ind;
void mems(int A[][4])
{
    for(i=0;i<3;i++)
        for(j=0;j<3;j++)
           A[i][j]=0;
}
void memc(int A[][4],int B[][4])
{
    for(i=0;i<3;i++)
        for(j=0;j<3;j++)
          A[i][j]=B[i][j];
}
void mult(int A[][4],int B[][4],int C[][4])
{
    for(i=0;i<3;i++)
        for(j=0;j<3;j++)
          for(k=0;k<3;k++)
            C[i][j]=(C[i][j]+1LL*A[i][k]*B[k][j])%mod;

}
void expp()
{
    rez[0][0]=x,rez[0][1]=y,rez[0][2]=z;
    p2[1][0]=1,p2[2][1]=1,p2[0][2]=c,p2[1][2]=b,p2[2][2]=a;
    for(ind=0;p[ind]<=n;ind++)
    {
        if(p[ind]&n)
        {
            mems(aux);
            mult(rez,p2,aux);
            memc(rez,aux);
        }
        mems(aux);
        mult(p2,p2,aux);
        memc(p2,aux);
    }
}
int main()
{
    ifstream f("iepuri.in");
    ofstream g("iepuri.out");
    f>>t;
    p[0]=1;
    for(i=1;i<=30;i++)
        p[i]=2*p[i-1];
    for(int cnt=1;cnt<=t;cnt++)
    {
        f>>x>>y>>z>>a>>b>>c>>n;
        mems(rez);
        mems(p2);
        expp();
        g<<rez[0][0]<<'\n';
    }
    return 0;
}