Pagini recente » Cod sursa (job #3261832) | Cod sursa (job #2887819) | Cod sursa (job #2339284) | Cod sursa (job #1257173) | Cod sursa (job #2857687)
#include<bits/stdc++.h>
#define MOD 666013
#define int long long
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
int A[3][3],B[3][3],ANS[3][3];
void inmultire(int m1[][3], int m2[][3])
{
int aux[3][3]={0},i,j,l;
for(i=0;i<=2;i++)
{
for(j=0;j<=2;j++)
{
for(l=0;l<=2;l++)
aux[i][j]+=(m1[i][l]*m2[l][j]);
}
}
for(i=0;i<=2;i++)
{
for(j=0;j<=2;j++)
{
m1[i][j]=aux[i][j]%MOD;
}
}
}
void putere(int X[][3], int put)
{
int p=1;
while(put!=0)
{
if(p&put)
{
inmultire(ANS,X);
put-=p;
}
inmultire(X,X);
p<<=1;
}
}
signed main()
{
int t,x,y,z,a,b,c,n,l;
f>>t;
for(l=1;l<=t;l++)
{
f>>x>>y>>z>>a>>b>>c>>n;
A[0][0]=x;
A[0][1]=y;
A[0][2]=z;
B[0][0]=ANS[0][0]=0;
B[1][0]=ANS[1][0]=1;
B[2][0]=ANS[2][0]=0;
B[0][1]=ANS[0][1]=0;
B[1][1]=ANS[1][1]=0;
B[2][1]=ANS[2][1]=1;
B[0][2]=ANS[0][2]=c;
B[1][2]=ANS[1][2]=b;
B[2][2]=ANS[2][2]=a;
putere(B,n-1);
inmultire(A,ANS);
g<<A[0][0]<<'\n';
}
return 0;
}