Pagini recente » Cod sursa (job #1626268) | Cod sursa (job #2559045) | Cod sursa (job #1499534) | Cod sursa (job #3166295) | Cod sursa (job #2334033)
#define MOD 666013
#include <fstream>
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
int n, t;
long long s[4];
long long m[4][4];
long long b[4][4];
long long c[4][4];
void inm(long long a[4][4], long long b[4][4], long long c[4][4])
{
for(int i=0; i<3; i++)
for(int j=0; j<3; j++)
c[i][j] = 0;
for(int i=0; i<3; i++)
{
for(int j=0; j<3; j++)
{
long long fin=0;
for(int k=0; k<3; k++)
fin = (fin + (a[i][k]*b[k][j])%MOD)%MOD;
c[i][j] = fin;
}
}
}
void inloc(long long a[4][4], long long b[4][4])
{
for(int i=0; i<3; i++)
for(int j=0; j<3; j++)
a[i][j] = b[i][j];
}
void mn()
{
b[0][0] = 1;
b[0][1] = 0;
b[0][2] = 0;
b[1][0] = 0;
b[1][0] = 0;
b[1][1] = 1;
b[1][2] = 0;
b[2][0] = 0;
b[2][1] = 0;
b[2][2] = 1;
int p = n-2;
while(p > 0)
{
if(p%2 == 1)
{
p--;
inm(b, m, c);
inloc(b, c);
continue;
}
inm(m, m, c);
inloc(m, c);
p/=2;
}
}
void inm()
{
mn();
long long fin=0;
for(int i=0; i<3; i++)
fin = (fin + (s[i]*c[i][0])%MOD)%MOD;
g<<fin<<'\n';
for(int i=0; i<3; i++)
for(int j=0; j<3; j++)
{
b[i][j] = 0;
c[i][j] = 0;
m[i][j] = 0;
}
}
int main()
{
f>>t;
for(int i=1; i<=t; i++)
{
int x, y, z, a, b, c;
f>>x>>y>>z>>a>>b>>c>>n;
m[0][0] = a;
m[0][1] = 1;
m[0][2] = 0;
m[1][0] = b;
m[1][1] = 0;
m[1][2] = 1;
m[2][0] = c;
m[2][1] = 0;
m[2][2] = 0;
s[0] = z;
s[1] = y;
s[2] = x;
inm();
}
return 0;
}