Cod sursa(job #805735)

Utilizator blechereyalBlecher Eyal blechereyal Data 1 noiembrie 2012 01:07:47
Problema Iepuri Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.12 kb
//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 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[3][3]={{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;     
}