Pagini recente » Cod sursa (job #688567) | Cod sursa (job #3296906) | Cod sursa (job #688320) | Cod sursa (job #2667192) | Cod sursa (job #3298380)
#include <fstream>
#include <vector>
using namespace std;
const int MOD = 666013;
const int N = 3;
void produs(vector <vector <long long>> &a, vector <vector <long long>> &b)
{
vector <vector <long long>> p(N);
for (int i = 0; i < N; i++)
{
p[i].resize(3, 0);
for (int j = 0; j < N; j++)
{
for (int k = 0; k < N; k++)
{
p[i][k] += (long long)a[i][j] * b[j][k] % MOD;
if (p[i][k] >= MOD)
{
p[i][k]=p[i][k]%MOD;
}
}
}
}
a = p;
}
void putere(vector <vector <long long>> &a, int n)
{
vector <vector <long long>> p(N);
p[0].resize(N);
p[1].resize(N);
a[2].resize(N);
p[0] = {1,0,0};
p[1] = {0,1,0};
p[2] = {0,0,1};
while (n != 0)
{
if (n % 2 != 0)
{
produs(p, a);///p *= a
}
produs(a, a);///a *= a
n /= 2;
}
a = p;
}
int main()
{
ifstream in("iepuri.in");
ofstream out("iepuri.out");
int n,X,Y, Z, A, B,C,t;
in>>t;
for(int i=1;i<=t;i++){
in >> X>>Y>>Z>>A>>B>>C>>n;
vector <vector <long long>> a(N);
a[0].resize(N);
a[1].resize(N);
a[2].resize(N);
a[0] = {A, B, C};
a[1] = {1, 0, 0};
a[2] = {0, 1, 0};
putere(a, n - 2);
out << ((a[0][0]*Z)%MOD+(a[0][1]*Y)%MOD+(a[0][2]*X)%MOD)%MOD<< "\n";
}
in.close();
out.close();
return 0;
}