Pagini recente » Cod sursa (job #790543) | Cod sursa (job #1500620) | Cod sursa (job #1783635) | Cod sursa (job #1047246) | Cod sursa (job #2392692)
#include <fstream>
#define MOD 666013
using namespace std;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
long long c[3][3],sol[3][3],a[3][3];
void inmultire(long long a[3][3],long long b[3][3])
{
long long c[3][3];
int i,j,k;
for(i=0; i<=2; i++)
{
for(j=0; j<=2; j++)
{
c[i][j]=0;
for(k=0; k<=2; k++)
c[i][j]+=a[i][k]*b[k][j];
c[i][j]=c[i][j]%MOD;
}
}
for(i=0; i<=2; i++)
for(j=0; j<=2; j++)
a[i][j]=c[i][j];
}
void putere(long long k)
{
while(k)
{
if(k%2==1)
{
inmultire(sol,c);
k--;
}
else
{
inmultire(c,c);
k/=2;
}
}
}
int t,x,y,z,A,B,C,n,i,j;
int main()
{
f>>t;
while(t)
{
f>>x>>y>>z>>A>>B>>C>>n;
for(i=0; i<3; i++)
for(j=0; j<3; j++)
sol[i][j] = a[i][j] = c[i][j] = 0;
sol[0][0] = sol[1][1] = sol[2][2] = 1;
a[0][0] = x;
a[0][1] = y;
a[0][2] = z;
c[1][0] = 1;
c[2][1] = 1;
c[2][2] = A;
c[1][2] = B;
c[0][2] = C;
putere(n);
inmultire(a, sol);
g<<a[0][0]<<'\n';
t--;
}
return 0;
}