Pagini recente » Cod sursa (job #1431598) | Cod sursa (job #1378237) | Cod sursa (job #1244507) | Cod sursa (job #1418171) | Cod sursa (job #743627)
Cod sursa(job #743627)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("iepuri.in");
ofstream out("iepuri.out");
#define M 666013
long long t,x,y,z,a,b,c,n,m[3][3],r[3][3];
inline void inm(long long r[3][3], long long r2[3][3]) {
long long i,j,rez[3][3],k;
for(i = 0; i!=3; ++i)
for(j = 0; j!=3; ++j) {
rez[i][j] = 0;
for(k = 0; k!=3; ++k)
rez[i][j] = ((long long)rez[i][j] + r[i][k] * r2[k][j])%M;
}
for(i = 0; i!=3; ++i)
for(j = 0; j!=3; ++j)
r[i][j] = rez[i][j];
}
inline void logi(long long n) {
while(n) {
if(n & 1)
inm(r,m);
inm(m,m);
n>>=1;
}
}
int main() {
in >> t;
while(t--) {
in >> x >> y >> z >> a >> b >> c >> n;
m[0][1] = 1;
m[1][2] = 1;
m[2][0] = c; m[2][1] = b; m[2][2] = a;
m[0][0] = m[0][2] = m[1][0] = m[1][1] = 0;
r[0][0] = r[1][1] = r[2][2] = 1;
r[0][1] = r[0][2] = r[1][0] = r[1][2] = r[2][0] = r[2][1] = 0;
logi(n);
out << ((long long)r[0][0] * x%M + r[0][1] * y%M + r[0][2] * z%M)%M << "\n";
}
return 0;
}