Pagini recente » Cod sursa (job #413378) | Cod sursa (job #806105) | Cod sursa (job #2403981) | Cod sursa (job #786287) | Cod sursa (job #805734)
Cod sursa(job #805734)
//iepuri
#define md 666013
#include <fstream>
using namespace std;
int i,j;
ifstream f("iepuri.in");
ofstream g("iepuri.out");
void init(long long a[3][3])
{
for (i=0;i<3;i++)
for (j=0;j<3;i++)
a[i][j]=0;
}
void matricein(long long a[3][3],long long b[3][3])
{int k;
long c[3][3];
init(c);
for(i=0;i<3;i++)
for(j=0;j<3;j++)
for(k=0;k<3;k++)
c[i][j]=(c[i][j]+(a[i][k]*b[k][j])%md)%md;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
a[i][j]=c[i][j];
}
void power(long long x[3][3],long n)
{
long long rez[2][2]={{1,0,0},{0,1,0},{0,0,1}};
while (n)
{
if (n & 1)
{
matricein(rez,x);//rez =rez*x;
n--;
}
matricein(x,x);//x =x*x;
n >>=1 ;
}
for(i=0;i<3;i++)
for(j=0;j<3;j++)
x[i][j]=rez[i][j];
}
int main()
{long long v[3][3];
int T,X,Y,Z,A,B,C;
long n;
f>>T;
for (i=1;i<=t;i++)
{f>>X>>Y>>Z>>A>>B>>C>>N;
init(v);
v[0][0]=A;v[0][1]=B;v[0][2]=C;
v[1][0]=1;v[2][1]=1;
power(v,N-2);
g<<((v[0][0] * Z)%md +(v[0][1] * Y)%md+(v[0][2] * X)%md)%md<<"\n;"
}
return 0;
}