Pagini recente » Cod sursa (job #877260) | Cod sursa (job #3143573) | Cod sursa (job #2134375) | Cod sursa (job #459162) | Cod sursa (job #2950978)
#include <fstream>
using namespace std;
const int MOD = 666013;
ifstream fin ("iepuri.in");
ofstream fout("iepuri.out");
int x, y, z, A, B, C, n;
void produs(int p [3][3], int a [3][3]) {
int aux [3][3];
for (int i = 0; i < 3; ++i) {
for (int k = 0; k < 3; ++k) {
aux [i][k] = 0;
for (int j = 0; j < 3; ++j) {
aux [i][k] += (long long)p [i][j] * a [j][k] % MOD;
aux [i][k] %= MOD;
}
}
}
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
p [i][j] = aux [i][j];
}
}
}
void putere(int a [3][3], int n) {
int p [3][3] = {{1, 0, 0}, {0, 1, 0}, {0, 0, 1}};
while (n != 0) {
if (n % 2 != 0) {
produs(p, a);
}
produs(a, a);
n /= 2;
}
fout << (p [0][0] * z % MOD + p [0][1] * y % MOD + p [0][2] * x % MOD) % MOD << '\n';
}
int main() {
int T;
fin >> T;
for (int i = 0; i < T; ++i) {
fin >> x >> y >> z >> A >> B >> C >> n;
int a [3][3] = {{A, B, C}, {1, 0, 0}, {0, 1, 0}};
putere(a, n - 2);
}
return 0;
fin.close();
fout.close();
}