Pagini recente » Cod sursa (job #2112190) | Cod sursa (job #41941) | Cod sursa (job #67572) | Cod sursa (job #1911376) | Cod sursa (job #2054182)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
const int MOD = 666013;
int Q[3][3],Sol[3][3];
int T,X,Y,Z,A,B,C,N;
void Multiply(int A[3][3], int B[3][3])
{
long long C[3][3];
for(int i = 0; i < 3; ++i)
for(int j = 0; j < 3; ++j)
{
C[i][j] = 0;
for(int k = 0; k < 3; ++k)
C[i][j] += 1LL * A[i][k]*B[k][j];
C[i][j] = C[i][j] % MOD;
}
for(int i = 0; i < 3; ++i)
for(int j = 0; j < 3; ++j)
A[i][j] = C[i][j];
}
int main()
{
fin >> T;
while(T--)
{
fin >> X >> Y >> Z >> A >> B >> C >> N;
memset(Sol,0,sizeof(Sol));
memset(Q,0,sizeof(Q));
Sol[0][0] = X; Sol[0][1] = Y; Sol[0][2] = Z;
Q[1][0] = Q[2][1] = 1;
Q[0][2] = C; Q[1][2] = B; Q[2][2] = A;
while(N)
{
if(N%2 == 1)
Multiply(Sol,Q);
Multiply(Q,Q);
N = N / 2;
}
fout << Sol[0][0] << "\n";
}
return 0;
}