Pagini recente » Cod sursa (job #2608580) | Cod sursa (job #2750363) | Cod sursa (job #2816534) | Cod sursa (job #208490) | Cod sursa (job #1612400)
#include <fstream>
using namespace std;
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int mat[4][4];
const int mod = 666013;
void Produs(int a[4][4], int n)
{
int b[4][4], c[4][4], i, j, k;
for (i = 1; i <= 3; ++i)
for (j = 1; j <= 3; ++j)
b[i][j] = a[i][j];
if (n > 1)
{
for (i = 1; i <= 3; ++i)
for (j = 1; j <= 3; ++j)
{
a[i][j] = 0;
for (k = 1; k <= 3; ++k)
a[i][j] = (a[i][j] + (1LL * b[i][k] * b[k][j]) % mod) % mod;
}
if (n % 2 == 0)
Produs(a, n/2);
else
{
Produs(a, (n-1)/2);
for (i = 1; i <= 3; ++i)
for (j = 1; j <= 3; ++j)
c[i][j] = a[i][j];
for (i = 1; i <= 3; ++i)
for (j = 1; j <= 3; ++j)
{
a[i][j] = 0;
for (k = 1; k <= 3; ++k)
a[i][j] = (a[i][j] + (1LL * b[i][k] * c[k][j]) % mod) % mod;
}
}
}
}
int main()
{
int t, x, y, z, a, b, c, n, nr, i;
fin >> t;
for (i = 1; i <= t; ++i)
{
fin >> x >> y >> z >> a >> b >> c >> n;
mat[1][1] = mat[1][2] = mat[2][2] = mat[3][1] = 0;
mat[2][1] = mat[3][2] = 1;
mat[1][3] = c;
mat[2][3] = b;
mat[3][3] = a;
Produs(mat, n-2);
nr = (((1LL * x * mat[1][3]) % mod) + ((1LL * y * mat[2][3]) % mod) + ((1LL * z * mat[3][3]) % mod)) % mod;
fout << nr << "\n";
}
fin.close();
fout.close();
return 0;
}