Pagini recente » Cod sursa (job #2236298) | Cod sursa (job #2576521) | Cod sursa (job #1854124) | Cod sursa (job #1037140) | Cod sursa (job #3285282)
#include <fstream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const int MOD = 666013;
int K, F[3][3], M[3][3];
void Multiply(int A[3][3], int B[3][3])
{
long long C[3][3] = {0};
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++j)
{
for (int k = 0; k < 3; ++k)
{
C[i][j] += 1LL * A[i][k] * B[k][j];
}
C[i][j] %= MOD;
}
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++j)
A[i][j] = C[i][j];
}
int T, X, Y, Z, A, B, C, N;
int main()
{
fin >> T;
while (T--)
{
fin >> X >> Y >> Z >> A >> B >> C >> N;
F[0][0] = X;
F[0][1] = Y;
F[0][2] = Z;
M[0][0] = M[0][1] = M[1][1] = M[2][0] = 0;
M[1][0] = M[2][1] = 1;
M[0][2] = C;
M[1][2] = B;
M[2][2] = A;
while (N)
{
if (N % 2 == 1)
Multiply(F, M);
Multiply(M, M);
N = N / 2;
}
fout << F[0][0] << "\n";
}
return 0;
}