Pagini recente » Cod sursa (job #522328) | Cod sursa (job #2822547) | Cod sursa (job #1637190) | Cod sursa (job #1693139) | Cod sursa (job #3030590)
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <fstream>
using namespace std;
ifstream cin("iepuri.in");
ofstream cout("iepuri.out");
const int MOD=666013;
long long matrix[3][3],putere[3][3];
void inmultire(long long a[][3],long long b[][3])
{
long long c[3][3]={0};
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
for(int d=0;d<3;d++)
c[i][j]=(c[i][j]+(a[i][d]*b[d][j])%MOD)%MOD;
for(int i=0;i<3;i++)
for(int j=0;j<3;j++)
a[i][j]=c[i][j];
}
void exponentiere(long long n)
{
if(n==0)
{
putere[0][0]=1;
putere[0][1]=0;
putere[0][2]=0;
putere[1][0]=0;
putere[1][1]=1;
putere[1][2]=0;
putere[2][0]=0;
putere[2][1]=0;
putere[2][2]=1;
return;
}
exponentiere(n/2);
inmultire(putere,putere);
if(n%2==1)
inmultire(putere,matrix);
}
void solve()
{
int x,y,z,a,b,c,n;
cin>>x>>y>>z>>a>>b>>c>>n;
matrix[0][0]=a;
matrix[1][0]=1;
matrix[0][1]=b;
matrix[2][1]=1;
matrix[0][2]=c;
exponentiere(n-2);
cout<<(z*putere[0][0]%MOD+y*putere[0][1]%MOD+x*putere[0][2]%MOD)%MOD<<'\n';
}
int main()
{
int T;
cin>>T;
for(int i=0;i<T;i++)
solve();
return 0;
}