Pagini recente » Cod sursa (job #1556429) | Cod sursa (job #1979830) | Cod sursa (job #2172568) | Cod sursa (job #1606650) | Cod sursa (job #2290247)
#include <fstream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const long long modValue = 666013;
void multiplyMatrices (long long A[3][3], long long B[3][3], long long R[3][3])
{
for (int i = 0; i <= 2; i++)
for (int j = 0; j <= 2; j++)
{
R[i][j] = 0;
for (int k = 0; k <= 2; k++)
R[i][j] += A[i][k] * B[k][j];
R[i][j] %= modValue;
}
}
void raiseMatrix(long long A[3][3], long long power, long long R[3][3])
{
if (power == 1)
{
for (int i = 0; i <= 2; i++)
for (int j = 0; j <= 2; j++)
R[i][j] = A[i][j];
}
else
{
long long P[3][3];
raiseMatrix(A, power / 2, P);
if(power % 2 == 0)
multiplyMatrices(P, P, R);
else
{
long long T[3][3];
multiplyMatrices(P, P, T);
multiplyMatrices(T, A, R);
}
}
}
int main()
{
int T;
fin >> T;
for(; T; T--)
{
long long X, Y, Z, A, B, C, N;
fin >> X >> Y >> Z >> A >> B >> C >> N;
long long E[3][3];
E[0][0] = A; E[0][1] = 1; E[0][2] = 0;
E[1][0] = B; E[1][1] = 0; E[1][2] = 1;
E[2][0] = C; E[2][1] = 0; E[2][2] = 0;
long long R[3][3];
raiseMatrix(E, N-2, R);
fout << (Z * R[0][0] + Y * R[1][0] + X * R[2][0]) % modValue << '\n';
}
fin.close();
fout.close();
return 0;
}