Cod sursa(job #2140587)

Utilizator Laura_CorneiLaura Maria Cornei Laura_Cornei Data 23 februarie 2018 17:39:53
Problema Iepuri Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.25 kb
#include <fstream>
#define mod 666013
using namespace std;
fstream f1("iepuri.in", ios::in);
fstream f2("iepuri.out", ios::out);
int nrt, x, y, z, a, b, c, n;
long long m[5][5], rez[5][5], r[5][5];
void inmultire(long long a[5][5], long long b[5][5]) //a=a*b
{
    int i, j, k;
    for(i=1; i<=3; i++)
        for(j=1; j<=3; j++)
    {
       r[i][j]=0;
       for(k=1; k<=3; k++)
       {
            r[i][j]+=(a[i][k]*b[k][j])%mod;
            r[i][j]%=mod;
       }
    }
    for(i=1; i<=3; i++)
        for(j=1; j<=3;j++)
           a[i][j]=r[i][j];
}
void ridica(int p) ///matricea m la puterea n
{
    while(p>0)
    {
        if(p%2==1)
        {
            inmultire(rez, m); ///rez=rez*m
            p--;
        }
        p/=2; ///m=m*m;
        inmultire(m, m);
    }
}
int main()
{
    f1>>nrt;
    while(nrt--)
    {
        f1>>x>>y>>z>>a>>b>>c>>n;
        m[1][1]=a; m[1][2]=b; m[1][3]=c;
        m[2][1]=1; m[2][2]=0; m[2][3]=0;
        m[3][1]=0; m[3][2]=1; m[3][3]=0;

        rez[1][1]=rez[2][2]=rez[3][3]=1;
        rez[1][2]=rez[1][3]=rez[2][1]=rez[2][3]=rez[3][1]=rez[3][2]=0;


       ridica(n-2);
       f2<<(((z*rez[1][1])%mod+ y*rez[1][2])%mod+ x*rez[1][3])%mod<<"\n";

    }
    return 0;
}