Pagini recente » Cod sursa (job #2091326) | Cod sursa (job #1615419) | Cod sursa (job #3219131) | Cod sursa (job #2597407) | Cod sursa (job #2666377)
#include <fstream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const long long mod=666013;int C,B,A;
int solv[3][3],z[3][3],a[3][3];
void copyx(int a[3][3],int b[3][3])
{
for(int i=0;i<=2;i++)
for(int j=0;j<=2;j++)
a[i][j]=b[i][j];
}
void matrix()
{
z[0][0]=0;z[0][1]=0;z[0][2]=C;
z[1][0]=1;z[1][1]=0;z[1][2]=B;
z[2][0]=0;z[2][1]=1;z[2][2]=A;
}
void matrix_multiplication(int a[3][3],int b[3][3])
{
int c[3][3]={0};
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
{
for(int nr=0;nr<3;nr++)
c[i][j]=(c[i][j]+((1ll*a[i][nr]*b[nr][j])%mod))%mod;
}
copyx(a,c);
}
void exp(int expo)
{
solv[0][0]=1;solv[0][1]=0;solv[0][2]=0;
solv[1][0]=0;solv[1][1]=1;solv[1][2]=0;
solv[2][0]=0;solv[2][1]=0;solv[2][2]=1;
while(expo)
{
if(expo%2)
{
matrix_multiplication(solv,z);
}
expo/=2;
matrix_multiplication(z,z);
}
}
int main()
{
int X,Y,Z,t;long long n;
fin>>t;
for(int i=1;i<=t;i++)
{
fin>>X>>Y>>Z>>A>>B>>C>>n;
matrix();
exp(n-2);
fout<<(X*solv[0][2]+Y*solv[1][2]+Z*solv[2][2])%mod<<"\n";
}
return 0;
}