Pagini recente » Cod sursa (job #1307847) | Cod sursa (job #211943) | Cod sursa (job #227719) | Cod sursa (job #2944981) | Cod sursa (job #1214129)
#include <cstring>
#include <fstream>
using namespace std;
const int mod = 666013;
template<const int Size>
class Matrice
{
public:
long long a[Size][Size];
Matrice()
{
memset(a, 0, sizeof a);
}
Matrice operator*(Matrice &M)
{
Matrice R;
for (int i = 0; i < Size; ++i)
for (int j = 0; j < Size; ++j)
for (int k = 0; k < Size; ++k)
R.a[i][j] = (R.a[i][j] + a[i][k] * M.a[k][j] ) % mod;
return R;
}
void operator*=(Matrice &M)
{
*this = *this * M;
}
};
int solve(int X, int Y, int Z, int A, int B, int C, int N)
{
Matrice<3> rasp, aux;
rasp.a[0][0] = Z;
rasp.a[0][1] = Y;
rasp.a[0][2] = X;
aux.a[0][0] = A;
aux.a[1][0] = B;
aux.a[2][0] = C;
aux.a[0][1] = 1;
aux.a[1][2] = 1;
N -= 2;
while ( N )
{
if ( N & 1 )
rasp *= aux;
aux *= aux;
N >>= 1;
}
return rasp.a[0][0];
}
int main()
{
ifstream fin("iepuri.in");
ofstream fout("iepuri.out");
int X, Y, Z, A, B, C, T, N;
fin >> T;
while ( T-- )
{
fin >> X >> Y >> Z >> A >> B >> C >> N;
fout << solve(X, Y, Z, A, B, C, N) << '\n';
}
fin.close();
fout.close();
return 0;
}