Pagini recente » Cod sursa (job #1104839) | Cod sursa (job #397775) | Cod sursa (job #1382694) | Cod sursa (job #236381) | Cod sursa (job #1557241)
#include <fstream>
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
#define mod 666013
int tests, x, y, z, a, b, c, n;
int m[5][5], t[5][5], sol[5][5];
void inm2()
{
int i, j, k, r[5][5];
for (i = 1;i <= 3;i++)
for (j = 1;j <= 3;j++)
r[i][j] = 0;
for (i = 1;i <= 3;i++)
for (j = 1;j <= 3;j++)
for (k = 1;k <= 3;k++)
{
r[i][j] += m[i][k] * m[k][j];
r[i][j] %= mod;
}
for (i = 1;i <= 3;i++)
for (j = 1;j <= 3;j++)
m[i][j] = r[i][j];
}
void inm1()
{
int i, j, k, r[5][5];
for (i = 1;i <= 3;i++)
for (j = 1;j <= 3;j++)
r[i][j] = 0;
for (i = 1;i <= 3;i++)
for (j = 1;j <= 3;j++)
for (k = 1;k <= 3;k++)
{
r[i][j] += sol[i][k] * m[k][j];
r[i][j] %= mod;
}
for (i = 1;i <= 3;i++)
for (j = 1;j <= 3;j++)
sol[i][j] = r[i][j];
}
void expo(long long p)
{
long long i, j;
sol[1][1] = 1; sol[1][2] = 0; sol[1][3] = 0;
sol[2][1] = 0; sol[2][2] = 1; sol[2][3] = 0;
sol[3][1] = 0; sol[3][2] = 0; sol[3][3] = 1;
for (i = 0;1LL * (1<<i) <= p;i++)
{
if (((1<<i) & p) > 0)
inm1();
inm2();
}
}
int main()
{
int i, j, temp, t1, t2, t3;
for (f>>tests;tests;tests--)
{
f>>x>>y>>z>>a>>b>>c>>n;
m[1][1] = 0; m[1][2] = 1; m[1][3] = 0;
m[2][1] = 0; m[2][2] = 0; m[2][3] = 1;
m[3][1] = c; m[3][2] = b; m[3][3] = a;
expo(n - 2);
c = sol[3][1]; b = sol[3][2]; a = sol[3][3];
t1 = (c * x) % mod;
t2 = (b * y) % mod;
t3 = (a * z) % mod;
temp = (t1 + t2 + t3) % mod;
g<<temp<<'\n';
}
}