Pagini recente » Cod sursa (job #2912195) | Istoria paginii fmi-no-stress-2012/solutii/invazie | Cod sursa (job #1874595) | Cod sursa (job #1595775) | Cod sursa (job #2106739)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
const int MOD=666013;
int X, Y, Z, A, B, C, N;
void inmm(int a[][3], int b[][3] ) //a=a*b;
{
long long t[3][3];
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
{
t[i][j] = 0;
for(int k = 0; k < 3; k++)
t[i][j] +=1LL* a[i][k] * b[k][j];
}
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
a[i][j] = t[i][j] % MOD;
}
int putere(int p)
{int m[3][3] = {{A, 1, 0}, {B,0,1},{C,0,0}};
int x[3][3] = {{Z, Y,X}, {0, 0,0},{0,0,0}};
while(p > 0)
if(p % 2 == 0)
{
p /= 2;
inmm(m, m); //m*=m(matrice)
}
else
{
p--;
inmm(x, m);
}
return x[0][0];
}
int main()
{
int T;
f>>T;
for(int i=1;i<=T;i++)
{
f>>X>>Y>>Z>>A>>B>>C>>N;
g<<putere(N-2)<<'\n';
}
return 0;
}