Pagini recente » Cod sursa (job #1657387) | Cod sursa (job #2142844) | Cod sursa (job #2856074) | Cod sursa (job #334513) | Cod sursa (job #2743453)
#include <fstream>
#include <cstring>
#define MOD 666013
using namespace std;
ifstream in("iepuri.in");
ofstream out("iepuri.out");
void inmultire(int a[5][5], int b[5][5]) {
int aux[5][5] = {0};
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j)
for (int k = 0; k < 3; ++k)
aux[i][j] = (1ll * aux[i][j] + 1ll * a[i][k] * b[k][j]) % MOD;
}
for (int i = 0; i < 5; ++i)
for (int j = 0; j < 5; ++j)
a[i][j] = aux[i][j];
}
int main() {
int n;
in >> n;
for (int q = 0; q < n; ++q) {
int x, y, z, a, b, c, zile;
in >> x >> y >> z;
in >> a >> b >> c;
in >> zile;
int mat[5][5] = {{a, 1, 0}, {b, 0, 1}, {c, 0, 0}};
int r[5][5] = {{a, 1, 0}, {b, 0, 1}, {c, 0, 0}};
zile -= 3;
while (zile) {
if (zile % 2 == 1)
inmultire(r, mat);
inmultire(mat, mat);
zile /= 2;
}
out << (1ll * z * r[0][0] + 1ll * y * r[1][0] + 1ll * x * r[2][0]) % MOD << '\n';
}
return 0;
}