Pagini recente » Cod sursa (job #2791419) | Cod sursa (job #3165114) | Cod sursa (job #2917678) | Cod sursa (job #2379164) | Cod sursa (job #849054)
Cod sursa(job #849054)
#include<cstdio>
using namespace std;
#define mod 666013
int a[3][3],b[3][3],n,q;
int c[3][3];
void matmult(int a[3][3],int b[3][3])
{
int i,j,k;
for(i=0;i<=3;++i)
for (j=0;j<=3;++j)
c[i][j]=0;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
for(k=0;k<3;k++)
c[i][j]=(c[i][j]+a[i][k]*b[k][j])%mod;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
b[i][j]=(c[i][j])%mod;
}
void read()
{
int t,x,y,z,d,e,f;
int i,j,k,l;
scanf("%lld",&t);
for(i=1;i<=t;i++)
{
for(j=0;j<=3;++j)
for (k=0;k<=3;++k)
a[j][k]=b[j][k]=0;
scanf("%d %d %d %d %d %d %lld",&x,&y,&z,&d,&e,&f,&n);
a[0][0]=x; a[0][1]=y; a[0][2]=z;
b[2][0]=d; b[1][0]=e; b[0][0]=f;
a[1][0]=1;a[2][1]=1;
n=n-3;
q=n;
while (q)
{
if(q&1)
{
matmult(a,b);
}
matmult(a,b);
q=q>>1;
}
printf("%d\n",b[0][0]);
}
}
int main()
{
freopen("iepuri.in","r",stdin);
freopen("iepuri.out","w",stdout);
read();
}