Pagini recente » Cod sursa (job #1960722) | Cod sursa (job #925557) | Cod sursa (job #631442)
Cod sursa(job #631442)
#include <stdio.h>
#include <string.h>
#define MOD 666013
int T[3][3], res[3][3], aux[3][3];
void matrix_mult(int (*A)[3], int (*B)[3], int (*C)[3])
{
int i, j, k;
memset(aux, 0, sizeof(aux));
for (i=0; i<3; ++i)
for (j=0; j<3; ++j)
for (k=0; k<3; ++k)
aux[i][j] += (A[i][k]*B[k][j])%MOD;
for (i=0; i<3; ++i)
for (j=0; j<3; ++j)
C[i][j] = aux[i][j]%MOD;
}
void fastexp(int exp)
{
int i;
for (i=0; (1<<i)<=exp; ++i) {
if ((1<<i) & exp)
matrix_mult(res, T, res);
matrix_mult(T, T, T);
}
}
int main()
{
freopen("iepuri.in", "r", stdin);
freopen("iepuri.out", "w", stdout);
int t, i;
scanf("%d", &t);
for (i=0; i<t; ++i) {
int a, b, c, x, y, z, n;
scanf("%d %d %d %d %d %d %d", &x, &y, &z, &a, &b, &c, &n);
memset(T, 0, sizeof(T));
memset(res, 0, sizeof(res));
T[0][0] = a; T[0][1] = b; T[0][2] = c;
T[1][0] = 1; T[2][1] = 1;
res[0][0] = res[1][1] = res[2][2] = 1;
fastexp(n-2);
int result = ((res[0][0]*z)%MOD + (res[0][1]*y)%MOD + (res[0][2]*x)%MOD)%MOD;
printf("%d\n", result);
}
return 0;
}