Pagini recente » Borderou de evaluare (job #2243315) | Cod sursa (job #909676) | Cod sursa (job #1117452) | Cod sursa (job #975557) | Cod sursa (job #679735)
Cod sursa(job #679735)
#include <cstring>
#include <fstream>
using namespace std;
const int MOD = 666013;
class matrix
{
public:
int v[3][3];
matrix()
{
memset(v, 0, sizeof(v));
}
};
matrix one()
{
matrix A;
for (int i = 0; i < 3; ++i)
A.v[i][i] = 1;
return A;
}
matrix mul(matrix A, matrix B)
{
matrix C;
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++j)
for (int k = 0; k < 3; ++k)
C.v[i][j] = (C.v[i][j] + 1LL * A.v[i][k] * B.v[k][j]) % MOD;
return C;
}
matrix power(matrix A, int K)
{
if (K == 0) return one();
if (K % 2 == 1) return mul(A, power(A, K - 1));
return power(mul(A, A), K / 2);
}
int T, X, Y, Z, A, B, C, N;
int main()
{
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
fin >> T;
while (T--)
{
fin >> X >> Y >> Z >> A >> B >> C >> N;
int result = 0;
if (N == 0) result = X;
else if (N == 1) result = Y;
else if (N == 2) result = Z;
else
{
matrix prmat;
prmat.v[1][0] = prmat.v[2][1] = 1;
prmat.v[0][2] = C;
prmat.v[1][2] = B;
prmat.v[2][2] = A;
matrix respow = power(prmat, N - 2), resfin;
resfin.v[0][0] = X, resfin.v[0][1] = Y, resfin.v[0][2] = Z;
resfin = mul(resfin, respow);
result = resfin.v[0][2];
}
fout << result << '\n';
}
fin.close();
fout.close();
}