Pagini recente » Cod sursa (job #104768) | Cod sursa (job #1923749) | Cod sursa (job #2211748) | Cod sursa (job #672431) | Cod sursa (job #2111666)
#include <fstream>
#define MOD 666013
using namespace std;
ifstream in("iepuri.in");
ofstream out("iepuri.out");
const int Nmax = 3;
int t, x, y, z, a, b, c, n;
int Mat[Nmax][Nmax], Sol[Nmax][Nmax];
void multiply (int A[Nmax][Nmax], int B[Nmax][Nmax])
{
int C[Nmax][Nmax];
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] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % MOD;
}
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
A[i][j] = C[i][j];
}
void init (int A[Nmax][Nmax], int B[Nmax][Nmax])
{
B[0][0]=0;
B[0][1]=0;
B[1][1]=0;
B[2][0]=0;
B[1][0]=1;
B[2][1]=1;
B[0][2]=z;
B[1][2]=y;
B[2][2]=x;
A[0][0]=a;
A[0][1]=b;
A[0][2]=c;
}
int main()
{
in >> t;
for (int i = 1; i <= t; i++)
{
in >> x >> y >> z >> a >> b >> c >> n;
init (Sol, Mat);
for (int j = 0; (1<<j) <= n; j++)
{
if ((1<<j) & n)
multiply (Sol, Mat);
multiply (Mat, Mat);
}
out << Sol[0][0] << '\n';
}
return 0;
}