Cod sursa(job #587175)

Utilizator Smaug-Andrei C. Smaug- Data 4 mai 2011 00:17:56
Problema Iepuri Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.89 kb
#include <cstdio>
#include <string>

inline void matrmult(int A[3][3], int B[3][3]){

  int i, j, k;
  int a[3][3]={{0,0,0},{0,0,0},{0,0,0}};
  for(i=0; i<3; i++)
    for(j=0; j<3; j++)
      for(k=0; k<3; k++)
	a[i][j]=(a[i][j]+1LL*A[i][k]*B[k][j])%666013;

  memcpy(A, a, sizeof(a));

}

inline int lgmult(int X, int Y, int Z, int A, int B, int C, int N){
  
  int K[3][3]={{0,0,C},{1,0,B},{0,1,A}};
  int P[3][3]={{1,0,0},{0,1,0},{0,0,1}};
  int i;

  for(i=0; (1<<i) <= N; i++){
    if(N&(1<<i))
      matrmult(P, K);
    
    matrmult(K, K);
  }

  return (X*1LL*P[0][2]+1LL*Y*P[1][2]+1LL*Z*P[2][2])%666013;

}
  
  

int main(){

  freopen("iepuri.in", "r", stdin);
  freopen("iepuri.out", "w", stdout);

  int T, X, Y, Z, A, B, C, N, i;
  scanf("%d", &T);

  for(i=0; i<T; i++){
    scanf("%d%d%d%d%d%d%d", &X, &Y, &Z, &A, &B, &C, &N);
    printf("%d\n", lgmult(X, Y, Z, A, B, C, N-2));
  }

  return 0;
  
}