Cod sursa(job #2991105)

Utilizator Danut200333Dumitru Daniel Danut200333 Data 9 martie 2023 09:29:24
Problema Iepuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.22 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
#define MOD 666013
long long c[4][4],u[4][4],s[4][4];
long long x,y,z,n,t;
void inmultire(long long a[4][4],long long b[4][4])
{
    long long c[4][4];
    for(int i=1;i<=3;i++)
    {
        for(int j=1;j<=3;j++)
        {
            c[i][j]=0;
            for(int k=1;k<=3;k++)c[i][j]=(c[i][j]+a[i][k]*b[k][j])%MOD;
        }
    }
    for(int i=1;i<=3;i++)
    {
        for(int j=1;j<=3;j++)a[i][j]=c[i][j];
    }
}
void putere(long long a[4][4],long long p)
{
    while(p)
    {
        if(p%2==1){inmultire(a,c);p--;}
        else{inmultire(c,c);p=p/2;}
    }
}
int main()
{
    fin>>t;
    while(t)
    {
        t--;
        fin>>x>>y>>z>>c[3][3]>>c[2][3]>>c[1][3]>>n;
        c[1][1]=0;c[1][2]=0;
        c[2][1]=1;c[2][2]=0;
        c[3][1]=0;c[3][2]=1;
        u[1][1]=1;u[1][2]=0;u[1][3]=0;
        u[2][1]=0;u[2][2]=1;u[2][3]=0;
        u[3][1]=0;u[3][2]=0;u[3][3]=1;
        s[1][1]=x;s[1][2]=y;s[1][3]=z;
        s[2][1]=0;s[2][2]=0;s[2][3]=0;
        s[3][1]=0;s[3][2]=0;s[3][3]=0;
        putere(u,n);
        inmultire(s,u);
        fout<<s[1][1]<<'\n';
    }
    return 0;
}