Pagini recente » Cod sursa (job #1414563) | Cod sursa (job #2894756) | Cod sursa (job #529986) | Cod sursa (job #146311) | Cod sursa (job #3245747)
#include <iostream>
#include<fstream>
using namespace std;
const int MOD=666013;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int x,y,z,a,b,c;
void mul(int a[][3], int b[][3])
{
long long c[3][3];
int i,j,k;
for(i=0; i<3; i++)
for(j=0; j<3; j++)
{
c[i][j]=0;
for(k=0; k<3; k++)
c[i][j]+=1LL*a[i][k]*b[k][j];
}
for(i=0; i<3; i++)
for(j=0; j<3; j++)
a[i][j]=c[i][j]%MOD;
}
int putere(int n)
{
int m[3][3]=
{
{a,1,0},
{b,0,1},
{c,0,0}
};
int v[3][3]=
{
{z,y,x},
{0,0,0},
{0,0,0}
};
while(n>0)
{
if(n%2==0)
mul(m,m),
n/=2;
else
mul(v,m),
n--;
}
return v[0][0];
}
int main()
{
int t,n;
fin>>t;
for(int i=1; i<=t; i++)
{
fin>>x>>y>>z>>a>>b>>c>>n;
fout<<putere(n-2)<<'\n';
}
fin.close();
fout.close();
return 0;
}