Pagini recente » Cod sursa (job #1549708) | Cod sursa (job #1907155) | Cod sursa (job #50045) | Cod sursa (job #731608) | Cod sursa (job #2111683)
#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] + 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];
}
int main()
{
in >> t;
for (int i = 1; i <= t; i++)
{
in >> a >> b >> c >> x >> y >> z >> n;
Mat[0][0]=0;
Mat[0][1]=0;
Mat[1][1]=0;
Mat[2][0]=0;
Mat[1][0]=1;
Mat[2][1]=1;
Mat[0][2]=z;
Mat[1][2]=y;
Mat[2][2]=x;
Sol[0][0]=a;
Sol[0][1]=b;
Sol[0][2]=c;
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;
}