Pagini recente » Cod sursa (job #590111) | Cod sursa (job #2637235) | Cod sursa (job #2711093) | Cod sursa (job #1602507) | Cod sursa (job #1383717)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD=666013;
const int N=4;
long long x[N][N],y[N][N],z[N][N];
void inmultire(long long a[N][N], long long b[N][N]){
long long aux[N][N];
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
aux[i][j]=0;
for(int k=1;k<=3;k++){
aux[i][j]+=a[i][k]*b[k][j];
}
}
}
for(int i=1;i<=3;i++)
for(int j=1;j<=3;j++) a[i][j]=aux[i][j]%MOD;
}
int main()
{
long long k,t,a,b,c;
ifstream in("iepuri.in");
in>>t;
for(int i=1;i<=t;i++){
for(int j=1;j<N;j++)
for(int k=1;k<N;k++)
y[j][k]=x[j][k]=0;
in>>a>>b>>c;
in>>x[1][1]>>x[1][2]>>x[1][3];
in>>k;
x[2][1]=x[3][2]=1;
y[1][1]=y[2][2]=y[3][3]=1;
k--;
while(k>0){
if(k%2!=0) {
inmultire(y,x);
}
k/=2;
inmultire(x,x);
}
ofstream out("iepuri.out");
out<<y[2][2]<<"\n";
}
return 0;
}