Pagini recente » Cod sursa (job #830722) | Cod sursa (job #450776) | Cod sursa (job #1142667) | Cod sursa (job #675136) | Cod sursa (job #1821022)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
const int MOD = 666013;
int T, X, Y, Z, A, B, C, N;
void prod(int A[][3], int B[][3])
{
int C[3][3];
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
{
long long x = 0;
for(int k = 0; k < 3; k++)
x += (long long)A[i][k] * B[k][j];
C[i][j] = x % MOD;
}
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
A[i][j] = C[i][j];
}
int putere(int n)
{
int P[3][3] = { { X, Y, Z }, { 0, 0, 0 }, { 0, 0, 0 } };
int M[3][3] = { { 0, 0, C }, { 1, 0, B }, { 0, 1, A } };
while(n)
{
while(n % 2 == 0)
{
prod(M, M);
n /= 2;
}
prod(P, M);
n--;
}
return P[0][2];
}
int main()
{
f >> T;
while(T--)
{
f >> X >> Y >> Z >> A >> B >> C >> N;
g << putere(N - 2) << endl;
}
f.close();
g.close();
return 0;
}